Scheduling to Minimize Age of Synchronization in Wireless Broadcast Networks With Random Updates
- 16 March 2020
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Wireless Communications
- Vol. 19 (6) , 4023-4037
Abstract
In this work, a wireless broadcast network with a base station (BS) sending random time-sensitive information updates to multiple users under bandwidth constraint is considered. To measure the effect of data desynchronization when the updates appear randomly because of external environment, the metric Age of Synchronization (AoS) is adopted in this work. It shows the amount of the time elapsed since freshest information at the receiver becomes desynchronized. The AoS minimization scheduling problem is formulated into a discrete time Markov decision process and the optimal solution is approximated through structural finite state policy iteration. An index based heuristic scheduling policy based on restless multi-arm bandit (RMAB) is provided to further reduce the computational complexity. Simulation results show that the proposed index policy achieves compatible performance with the MDP and is close to the AoS lower bound. Our work indicates that, to obtain a small AoS over the entire network, users with larger transmission success probability and smaller random update probability are more likely to be scheduled at smaller AoS.Keywords
Funding Information
- National Basic Research Program of China (2017YFE0112300)
- Beijing National Research Center For Information Science And Technology (BNR2019RC01014, BNR2019TD01001)
- Tsinghua University Tutor Research Fund
This publication has 25 references indexed in Scilit:
- Staleness Bounds and Efficient Protocols for Dissemination of Global Channel State InformationIEEE Transactions on Wireless Communications, 2017
- Age-optimal constrained cache updating2017
- On Real-Time Status Updates over Symbol Erasure Channels2017
- Minimizing the Age of Information in broadcast wireless networks2016
- Timeliness in Lossless Block Coding2016
- On Sample-Path Staleness in Lazy Data ReplicationIEEE/ACM Transactions on Networking, 2015
- On the age of channel information for a Finite-State Markov model2015
- Effective page refresh policies for Web crawlersACM Transactions on Database Systems, 2003
- Synchronizing a database to improve freshnessACM SIGMOD Record, 2000
- On an index policy for restless banditsJournal of Applied Probability, 1990