Scheduling to Minimize Age of Synchronization in Wireless Broadcast Networks with Random Updates

In this work, a wireless broadcast network with a base station (BS) sending random time-sensitive information updates to multiple users with interference constraints is considered. The Age of Synchronization (AoS), namely the amount of time elapsed since the information stored at the network user becomes desynchronized, is adopted to measure data freshness from the perspective of network users. Compared with the more widely used metric—the Age of Information (AoI), AoS accounts for the freshness of the randomly changing content. We formulate the scheduling problem into a discrete time Markov decision process and approximate the optimal solution through finite state policy iteration. An index based heuristic scheduling policy based on restless multi-arm bandit (RMAB) is provided to reduce computational complexity. Numerical results are presented to demonstrate the performance of the proposed policies.

[1]  Bin Li,et al.  Age-based Scheduling: Improving Data Freshness for Wireless Real-Time Traffic , 2018, MobiHoc.

[2]  Eytan Modiano,et al.  Age of information: Design and analysis of optimal scheduling algorithms , 2016, 2017 IEEE International Symposium on Information Theory (ISIT).

[3]  J. Bather,et al.  Multi‐Armed Bandit Allocation Indices , 1990 .

[4]  R. Weber,et al.  On an index policy for restless bandits , 1990, Journal of Applied Probability.

[5]  Christian M. Ernst,et al.  Multi-armed Bandit Allocation Indices , 1989 .

[6]  Eytan Modiano,et al.  Minimizing age-of-information in multi-hop wireless networks , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Roy D. Yates,et al.  Two Freshness Metrics for Local Cache Refresh , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[8]  Eytan Modiano,et al.  Minimizing the Age of Information in broadcast wireless networks , 2016, 2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[9]  Roy D. Yates,et al.  Timeliness in Lossless Block Coding , 2016, 2016 Data Compression Conference (DCC).

[10]  Parimal Parag,et al.  On Real-Time Status Updates over Symbol Erasure Channels , 2017, 2017 IEEE Wireless Communications and Networking Conference (WCNC).

[11]  Roy D. Yates,et al.  Age-optimal constrained cache updating , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[12]  Jian Song,et al.  Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints , 2019, 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[13]  Shahab Farazi,et al.  Staleness Bounds and Efficient Protocols for Dissemination of Global Channel State Information , 2017, IEEE Transactions on Wireless Communications.

[14]  R. Weber,et al.  ON AN INDEX POLICY FOR RESTLESS BANDITS , 1990 .

[15]  Hyun-Kyu Cho,et al.  Efficient Monitoring Algorithm for Fast News Alerts , 2007, IEEE Transactions on Knowledge and Data Engineering.

[16]  Anthony Ephremides,et al.  On the age of channel information for a Finite-State Markov model , 2015, 2015 IEEE International Conference on Communications (ICC).

[17]  Dmitri Loguinov,et al.  On sample-path staleness in lazy data replication , 2015, 2015 IEEE Conference on Computer Communications (INFOCOM).

[18]  Zhisheng Niu,et al.  Decentralized Status Update for Age-of-Information Optimization in Wireless Multiaccess Channels , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[19]  Hector Garcia-Molina,et al.  Synchronizing a database to improve freshness , 2000, SIGMOD 2000.

[20]  Eytan Modiano,et al.  Optimizing Age of Information in Wireless Networks with Throughput Constraints , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications.

[21]  Eytan Modiano,et al.  Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks , 2018, 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[22]  Prathamesh Mayekar,et al.  Optimal Lossless Source Codes for Timely Updates , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[23]  Hector Garcia-Molina,et al.  Effective page refresh policies for Web crawlers , 2003, TODS.

[24]  Jian Song,et al.  Scheduling to Minimize Age of Synchronization in Wireless Broadcast Networks With Random Updates , 2020, IEEE Transactions on Wireless Communications.

[25]  Yu-Pin Hsu,et al.  Age of Information: Whittle Index for Scheduling Stochastic Arrivals , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[26]  Roy D. Yates,et al.  Real-time status: How often should one update? , 2012, 2012 Proceedings IEEE INFOCOM.

[27]  Zhisheng Niu,et al.  Optimizing Information Freshness in Broadcast Network with Unreliable Links and Random Arrivals: An Approximate Index Policy , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[28]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[29]  Eytan Modiano,et al.  Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks , 2018, IEEE/ACM Transactions on Networking.