Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks
Name
1803.06469.pdf
Description
Submitted version
Size
366.9 KB
Format
Unknown
Checksum (MD5)
f296ec94a6326aea2ec3c37291d0c2d7
Author(s)
Talak, Rajat Rajendra
Karaman, Sertac
Modiano, Eytan H
Date Issued
June 2018
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Talak, Rajat, Karaman, Sertac and Modiano, Eytan. 2018. "Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks."
Version
Original manuscript
Abstract
© 2018 IEEE. Age of Information (AoI), measures the time elapsed since the last received information packet was generated at the source. We consider the problem of AoI minimization for single-hop flows in a wireless network, under pairwise interference constraints and time varying channel. We consider simple, yet broad, class of distributed scheduling policies, in which a transmission is attempted over each link with a certain attempt probability. We obtain an interesting relation between the optimal attempt probability and the optimal AoI of the link, and its neighboring links. We then show that the optimal attempt probabilities can be computed by solving a convex optimization problem, which can be done distributively.
MIT Department
Massachusetts Institute of Technology. Laboratory for Information and Decision Systems
Massachusetts Institute of Technology. Department of Aeronautics and Astronautics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/SPAWC.2018.8445979
