Minimizing the Age of Information in broadcast wireless networks
Name
Igor_allerton16 copy.pdf
Size
329.74 KB
Format
Adobe PDF
Checksum (MD5)
be479471ca6a9137caf8ba0c2df00e05
Author(s)
Kadota, Igor
Uysal-Biyikoglu, Elif
Modiano, Eytan H
Singh, Rahul
Date Issued
February 2017
Journal
2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Kadota, Igor, et al. "Minimizing the Age of Information in Broadcast Wireless Networks." 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 27-30 September, 2016, Monticello, Illinois, IEEE, 2016, pp. 844–51.
Version
Author's final manuscript
Abstract
We consider a wireless broadcast network with a base station sending time-sensitive information to a number of clients. The Age of Information (AoI), namely the amount of time that elapsed since the most recently delivered packet was generated, captures the freshness of the information. We formulate a discrete-time decision problem to find a scheduling policy that minimizes the expected weighted sum AoI of the clients in the network. To the best of our knowledge, this is the first work to provide a scheduling policy that optimizes AoI in a wireless network with unreliable channels. The results are twofold: first, we show that a Greedy Policy, which transmits the packet with highest current age, is optimal for the case of symmetric networks. Then, for the general network case, we establish that the problem is indexable and obtain the Whittle Index in closed-form. Numerical results are presented to demonstrate the performance of the policies.
MIT Department
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ALLERTON.2016.7852321
