Optimal Algorithms for Online Age-of-Information Optimization in Energy Harvesting Systems
IEEE Transactions on Networking · 2025-12 · 33 (6) · 3146-3161
DOI: 10.1109/ton.2025.3582413 ↗Kurz gefasst
Fachartikel in der Zeitschrift IEEE Transactions on Networking, 2025-12. Verfasst von Qiulin Lin und 2 weiteren Autor:innen. Die Arbeit wurde bisher 2-mal zitiert (Crossref) und nennt 44 Literaturangaben. Gefördert von: General Research Fund from Research Grants Council, Hong Kong, Collaborative Research Fund from Research Grants Council, Hong Kong, InnoHK initiative, The Government of HKSAR, Laboratory for AI-Powered Financial Technologies.
Abstract (Originalsprache)
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 $\textsf {CR-RePursuit}$ and show it achieves $(\ln \theta +1)$ -competitiveness, where $\theta $ 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 also introduce an adaptive variant of the algorithm, +, that further exploits the revealed information to obtain significantly improved empirical performance. We conduct simulations based on real-world traces and compare our algorithms with conceivable alternatives. The results show that our algorithms achieve 15% performance improvement as compared to the state-of-the-art baseline.
Förderung
- General Research Fund from Research Grants Council, Hong Kong
- Collaborative Research Fund from Research Grants Council, Hong Kong
- InnoHK initiative, The Government of HKSAR, Laboratory for AI-Powered Financial Technologies
- Shenzhen-Hong Kong-Macau Science and Technology Project
Zitieren
APA
Lin, Q., Su, J., & Chen, M. (2025). Optimal Algorithms for Online Age-of-Information Optimization in Energy Harvesting Systems. IEEE Transactions on Networking, 33(6), 3146-3161. https://doi.org/10.1109/ton.2025.3582413
Vancouver
Lin Q, Su J, Chen M. Optimal Algorithms for Online Age-of-Information Optimization in Energy Harvesting Systems. IEEE Transactions on Networking. 2025;33(6):3146-3161. doi:10.1109/ton.2025.3582413
BibTeX
@article{Lin2025,
author = {Lin, Qiulin and Su, Junyan and Chen, Minghua},
title = {Optimal Algorithms for Online Age-of-Information Optimization in Energy Harvesting Systems},
journal = {IEEE Transactions on Networking},
year = {2025},
volume = {33},
number = {6},
pages = {3146--3161},
doi = {10.1109/ton.2025.3582413}
}
EUVIMED