{'fraction_non_alphanumeric': 0.013404825737265416, 'fraction_numerical': 0.0, 'mean_word_length': 5.549707602339181, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Energy-efficient scheduling of delay constrained traffic under practical power model

In this paper, we focus on the delay constrained scheduling problem for wireless link communication under the practical concerns, such as the practical power consumption of transmitter and energy used for channel estimation. In particular, we target to design an energy-efficient scheduling policy that minimizes the total energy expenditure while satisfying the deadline constraint based on knowledge about the unserved bits, channel state/statistics, practical power model and the remaining time slots to the deadline. We formulate the scheduling problem as a stochastic programming problem and propose a suboptimal policy by analyzing the structure of the solution. In addition, we study a special case that the whole packet is served in a single slot and propose an optimal channel-threshold policy based on the stopping theory. Numerical results illustrate that the proposed policies provide great energy efficiency especially when the data amount is relatively small and the transmission independent power consumption is large.