{'fraction_non_alphanumeric': 0.018683274021352312, 'fraction_numerical': 0.0, 'mean_word_length': 5.578947368421052, '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 with Individual Delay Constraints over a Fading Channel

This paper focuses on energy-efficient packet transmission with individual packet delay constraints over a fading channel. The problem of optimal offline scheduling (vis-a-vis total transmission energy), assuming information of all packet arrivals and channel states before scheduling, is formulated as a convex optimization problem with linear constraints. The optimality conditions are analyzed. From the analysis, a recursive algorithm is developed to search for the optimal offline scheduling. The optimal offline scheduler tries to equalize the energy-rate derivative function as much as possible subject to the causality and delay constraints. The properties of the optimal transmission rates are analyzed, from which upper and lower bounds of the average packet delay are derived. In addition, a heuristic online scheduling algorithm, using causal traffic and channel information, is proposed and shown via simulations to achieve comparable energy and delay performance to the optimal offline scheduler in a wide range of scenarios.