Age of Incorrect Information under Delay

This paper investigates the problem of minimizing the Age of Incorrect Information (AoII) when the communication channel has a random delay. We consider a slotted-time system where a transmitter observes a dynamic source and decides when to send updates to a remote receiver through a channel with random delay. The receiver maintains estimates of the state of the dynamic source based on the received updates. In this paper, we adopt AoII as the performance metric and investigate the problem of optimizing the transmitter's action in each time slot to minimize AoII. We first characterize the considered problem using Markov Decision Process (MDP). Then, leveraging the policy improvement theorem and under an easy-to-verify condition, we prove that the optimal decision for the transmitter is to initiate a transmission whenever the channel is idle and AoII is not zero. The results apply to generic delay distribution. Lastly, we verify the condition numerically and provide the numerical results that highlight the performance of the optimal policy.

[1]  A. Ephremides,et al.  Scheduling to Minimize Age of Incorrect Information with Imperfect Channel State Information , 2021, Entropy.

[2]  Mohamad Assaad,et al.  Minimizing the Age of Incorrect Information for Real-time Tracking of Markov Remote Sources , 2021, 2021 IEEE International Symposium on Information Theory (ISIT).

[3]  Anthony Ephremides,et al.  Minimizing Age of Incorrect Information for Unreliable Channel with Power Constraint , 2021, 2021 IEEE Global Communications Conference (GLOBECOM).

[4]  A. Ephremides,et al.  The Age of Incorrect Information: An Enabler of Semantics-Empowered Communication , 2020, IEEE Transactions on Wireless Communications.

[5]  Roy D. Yates,et al.  Age of Information: An Introduction and Survey , 2020, IEEE Journal on Selected Areas in Communications.

[6]  Anthony Ephremides,et al.  Age of Incorrect Information for Remote Estimation of a Binary Markov Source , 2020, IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[7]  Eytan Modiano,et al.  Age of Information: A New Metric for Information Freshness , 2019, Age of Information.

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

[9]  Yin Sun,et al.  Sampling for Remote Estimation through Queues: Age of Information and Beyond , 2019, 2019 International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOPT).

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

[11]  Vangelis Angelakis,et al.  Age of Information: A New Concept, Metric, and Tool , 2018, Found. Trends Netw..

[12]  Yin Sun,et al.  Sampling of the Wiener Process for Remote Estimation Over a Channel With Random Delay , 2017, IEEE Transactions on Information Theory.

[13]  Elif Uysal-Biyikoglu,et al.  Optimal Sampling and Remote Estimation of the Wiener Process over a Channel with Random Delay , 2017, ArXiv.

[14]  Roy D. Yates,et al.  Update or wait: How to keep your data fresh , 2016, IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications.

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

[16]  Linn I. Sennott,et al.  Average Cost Optimal Stationary Policies in Infinite State Markov Decision Processes with Unbounded Costs , 1989, Oper. Res..

[17]  R. Howard Dynamic Programming and Markov Processes , 1960 .

[18]  K. Johansson,et al.  Semantic Communications in Networked Systems , 2021, ArXiv.

[19]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.