{'fraction_non_alphanumeric': 0.02132701421800948, 'fraction_numerical': 0.0, 'mean_word_length': 5.079136690647482, '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}}
Packet Scheduling Algorithms to Minimize the Age of Information in Energy Harvesting Networks

This paper studies the problem of minimizing the age of information by scheduling packets with hard deadlines in wireless networks powered by energy harvesting base stations. The problem is shown to be NP-hard in its simplest form. We propose a general optimization framework to model the problem and further we provide an integer linear programming formulation. The integer program is useful to help solving the problem optimally using off-the-shelf solvers. To solve the problem in polynomial-time efficiently, we derive two greedy online (non-anticipative) algorithms—one being an improved version of the other. We present simulation results and show the efficiency of the proposed solutions compared to the optimal and the state-of-the-art ones.