Journal
IEEE TRANSACTIONS ON MOBILE COMPUTING
Volume 19, Issue 12, Pages 2903-2915Publisher
IEEE COMPUTER SOC
DOI: 10.1109/TMC.2019.2936199
Keywords
Age of information; scheduling algorithms; Markov decision processes
Funding
- Ministry of Science and Technology of Taiwan [MOST 107-2221-E-305-007-MY3]
- NSF [AST-1547331, CNS-1713725, CNS-1701964]
- Army Research Office (ARO) [W911NF-17-1-0508]
- Singapore Ministry of Education Academic Research Fund Tier 2 [MOE2016-T2-1-173]
Ask authors/readers for more resources
Age of information is a new network performance metric that captures the freshness of information at end-users. This paper studies the age of information from a scheduling perspective. To that end, we consider a wireless broadcast network where a basestation (BS) is updating many users on random information arrivals under a transmission capacity constraint. For the offline case when the arrival statistics are known to the BS, we develop a structural MDP scheduling algorithm and an index scheduling algorithm, leveraging Markov decision process (MDP) techniques and the Whittle's methodology for restless bandits. By exploring optimal structural results, we not only reduce the computational complexity of the MDP-based algorithm, but also simplify deriving a closed form of the Whittle index. Moreover, for the online case, we develop an MDP-based online scheduling algorithm and an index-based online scheduling algorithm. Both the structural MDP scheduling algorithm and the MDP-based online scheduling algorithm asymptotically minimize the average age, while the index scheduling algorithm minimizes the average age when the information arrival rates for all users are the same. Finally, the algorithms are validated via extensive numerical studies.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available