AoI-Penalty Minimization for Networked Control Systems with Packet Loss

In this work the impact of age of information (AoI) is studied from the perspective of networked control systems (NCS), i.e., control loops that are closed over networks. We formulate the estimation problem of a linear time invariant (LTI) system and show that related performance metrics can be optimized by minimizing age-penalty functions. From the variety of possible penalties that make sense from an NCS point of view, we derive a general age-penalty minimization problem. We characterize properties of penalty functions that are trivial or non-trivial to solve and show that for non-trivial age-penalties, the optimal transmission policy over a single link with packet loss is AoI-threshold based. Then, we propose an algorithm to find the optimal threshold. Simulation results verify that threshold policies with optimal threshold can serve to optimally solve a variety of NCS related estimation problems.

[1]  Anthony Ephremides,et al.  Controlling the age of information: Buffer size, deadline, and packet replacement , 2016, MILCOM 2016 - 2016 IEEE Military Communications Conference.

[2]  Anthony Ephremides,et al.  Effect of Message Transmission Path Diversity on Status Age , 2016, IEEE Transactions on Information Theory.

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

[4]  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.

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

[6]  Eytan Modiano,et al.  Optimizing age-of-information in a multi-class queueing system , 2015, 2015 IEEE International Symposium on Information Theory (ISIT).

[7]  Yin Sun,et al.  Information Aging Through Queues: A Mutual Information Perspective , 2018, 2018 IEEE 19th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[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]  Ness B. Shroff,et al.  Optimizing data freshness, throughput, and delay in multi-server information-update systems , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

[11]  Anthony Ephremides,et al.  Age and value of information: Non-linear age case , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[13]  Anthony Ephremides,et al.  Age of information with a packet deadline , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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

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

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

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

[18]  Eugene A. Feinberg,et al.  Average Cost Markov Decision Processes with Weakly Continuous Transition Probabilities , 2012, Math. Oper. Res..