Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State
Name
1805.06752.pdf
Description
Submitted version
Size
471.93 KB
Format
Adobe PDF
Checksum (MD5)
c600cb52dbe8a3deaf8cdb909f0fe4e2
Author(s)
Talak, Rajat Rajendra
Kadota, Igor
Karaman, Sertac
Modiano, Eytan H
Date Issued
August 2018
Journal
IEEE International Symposium on Information Theory (ISIT)
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Talak, Rajak et al. "Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State." IEEE International Symposium on Information Theory (ISIT), June 2018, Vail, Colorado, USA, Institute of Electrical and Electronics Engineers, August 2018. © 2018 IEEE
Version
Original manuscript
Abstract
Age of information (AoI) is a recently proposed metric that measures the time elapsed since the generation of the last received information update. We consider the problem of AoI minimization for a network under general interference constraints, and time varying channel. We study the case where the channel statistics are known, but the current channel state is unknown. We propose two scheduling policies, namely, the virtual queue based policy and age-based policy. In the virtual queue based policy, the scheduler schedules links with maximum weighted sum of the virtual queue lengths, while in the age-based policy, the scheduler schedules links with maximum weighted sum of a function of link AoI. We prove that the virtual queue based policy is peak age optimal, up to an additive constant, while the age-based policy is at most factor 4 away from the optimal age. Numerical results suggest that both the proposed policies are, in fact, very close to the optimal.
MIT Department
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/isit.2018.8437688
