Competitive Online Age-of-Information Optimization for Energy Harvesting Systems

• Main Authors: Lin, Qiulin, Su, Junyan, Chen, Minghua
• Format: Conference Proceeding
• Language: English
• Subjects: Batteries; Energy harvesting; Information age; Optimization; Receivers; Resource management; Uncertainty
• ISSN: 2641-9874
• DOI: 10.1109/INFOCOM52122.2024.10621320

We consider the scenario where an energy harvesting source sends its updates to a receiver. The source optimizes its energy allocation over a decision period to maximize a sum of time-varying functions of the age of information (AoI), representing the value of providing timely information. In a practical online setting, we need to make irrevocable energy allocation decisions at each time while the time-varying functions and the energy arrivals are only revealed sequentially. The problem is then challenging as 1) we are facing uncertain energy harvesting arrivals and time-varying functions, and 2) the energy allocation decisions and the energy harvesting process are coupled due to the capacity-limited battery. In this paper, we develop an optimal online algorithm CR-Reserve and show it achieves (lnθ + 1)-competitive, where θ is a parameter representing the level of uncertainty of the time-varying functions. It is the optimal competitive ratio among all deterministic and randomized online algorithms. We conduct simulations based on real-world traces and compare our algorithms with conceivable alternatives. The results show that our algorithms achieve 12% performance improvement as compared to the state-of-the-art baseline.