Timely Synchronization with Sporadic Status Changes

In this paper, we consider a status updating system where the transmitter sends status updates of the signal it monitors to the destination through a rate-limited link. We consider the scenario where the status of the monitored signal only changes at discrete time points. The objective is to let the destination be synchronized with the source in a timely manner once a status change happens. What complicates the problem is that the transmission takes multiple time slots due to the link-rate constraint. Thus, the transmitter has to decide to switch or to skip a new update when the status of the monitored signal changes and it has not completed the transmission of the previous one yet. We adopt a metric called “Age of Synchronization” (AoS) to measure the “dissatisfaction” of the destination when it is desynchronized with the source. Then, the objective of this paper is to minimize the time-average AoS by designing optimal transmission policies for the transmitter. We formulate the problem as a Markov decision process (MDP) and prove the multi-threshold structure of the optimal policy. Based on that, we propose a low computational-complexity algorithm for the MDP value iteration. We then evaluate the performance of the multi-threshold policy through simulations and compare it with two baseline policies and the AoI-optimal policy.

[1]  Roy D. Yates,et al.  Status updates through queues , 2012, 2012 46th Annual Conference on Information Sciences and Systems (CISS).

[2]  Ness B. Shroff,et al.  Minimizing the Age of Information Through Queues , 2017, IEEE Transactions on Information Theory.

[3]  Apostolos Traganitis,et al.  Control of Status Updates for Energy Harvesting Devices That Monitor Processes with Alarms , 2019, 2019 IEEE Globecom Workshops (GC Wkshps).

[4]  Jing Yang,et al.  Age-Minimal Online Policies for Energy Harvesting Sensors with Random Battery Recharges , 2018, 2018 IEEE International Conference on Communications (ICC).

[5]  Kun Chen,et al.  Age-of-information in the presence of error , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

[7]  Jingxian Wu,et al.  Optimal Status Update for Age of Information Minimization With an Energy Harvesting Source , 2017, IEEE Transactions on Green Communications and Networking.

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

[9]  Jing Yang,et al.  When to preempt? Age of information minimization under link capacity constraint , 2018, Journal of Communications and Networks.

[10]  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).

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

[12]  Vangelis Angelakis,et al.  Age of information of multiple sources with queue management , 2015, 2015 IEEE International Conference on Communications (ICC).

[13]  Linn I. Sennott,et al.  On computing average cost optimal policies with application to routing to parallel queues , 1997, Math. Methods Oper. Res..

[14]  Roy D. Yates,et al.  Status updates over unreliable multiaccess channels , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[15]  Jing Yang,et al.  Age of Information Minimization for an Energy Harvesting Source With Updating Erasures: Without and With Feedback , 2018, IEEE Transactions on Communications.

[16]  Ness B. Shroff,et al.  Age-optimal information updates in multihop networks , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[17]  Eytan Modiano,et al.  Scheduling Algorithms for Optimizing Age of Information in Wireless Networks With Throughput Constraints , 2019, IEEE/ACM Transactions on Networking.

[18]  Eytan Modiano,et al.  Scheduling Algorithms for Minimizing Age of Information in Wireless Broadcast Networks with Random Arrivals , 2017, IEEE Transactions on Mobile Computing.

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

[20]  Roy D. Yates,et al.  Timely Cloud Computing: Preemption and Waiting , 2019, 2019 57th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[21]  Jian Song,et al.  Scheduling to Minimize Age of Synchronization in Wireless Broadcast Networks with Random Updates , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[22]  Anthony Ephremides,et al.  Towards an effective age of information: Remote estimation of a Markov source , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[23]  Elif Uysal-Biyikoglu,et al.  Age-optimal updates of multiple information flows , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[24]  Anthony Ephremides,et al.  The Age of Incorrect Information: A New Performance Metric for Status Updates , 2019, IEEE/ACM Transactions on Networking.

[25]  Jing Yang,et al.  To Skip or to Switch? Minimizing Age of Information Under Link Capacity Constraint , 2018, 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[26]  Roy D. Yates,et al.  Lazy is timely: Status updates by an energy harvesting source , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).