Minimizing the Sum of Age of Information and Transmission Cost under Stochastic Arrival Model

We consider a node-monitor pair, where updates are generated stochastically (according to a known distribution) at the node that it wishes to send to the monitor. The node is assumed to incur a fixed cost for each transmission, and the objective of the node is to find the update instants so as to minimize a linear combination of AoI of information and average transmission cost. First, we consider the Poisson arrivals case, where updates have an exponential inter-arrival time for which we derive an explicit optimal online policy. Next, for arbitrary distributions of inter-arrival time of updates, we propose a simple randomized algorithm that transmits any newly arrived update with a fixed probability (that depends on the distribution) or never transmits that update. The competitive ratio of the proposed algorithm is shown to be a function of the variance and the mean of the inter-arrival time distribution. For some of the commonly considered distributions such as exponential, uniform, and Rayleigh, the competitive ratio bound is shown to be 2.

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

[2]  Leila GHOLAMHOSSEINI,et al.  Hospital Real-Time Location System (A Practical Approach in Healthcare): A Narrative Review Article , 2019, Iranian journal of public health.

[3]  Wolfgang Kellerer,et al.  Optimal Scheduling for Discounted Age Penalty Minimization in Multi-Loop Networked Control , 2020, 2020 IEEE 17th Annual Consumer Communications & Networking Conference (CCNC).

[4]  Song Han,et al.  Transmit or Discard: optimizing Data Freshness in Networked Embedded Systems with Energy Harvesting Sources , 2019, 2019 56th ACM/IEEE Design Automation Conference (DAC).

[5]  Songtao Feng,et al.  Minimizing Age of Information for an Energy Harvesting Source with Updating Failures , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

[6]  Sennur Ulukus,et al.  Partial Updates: Losing Information for Freshness , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

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

[8]  Hongguang Sun,et al.  AoI and Energy Consumption Oriented Dynamic Status Updating in Caching Enabled IoT Networks , 2020, IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[9]  Marian Codreanu,et al.  Closed-Form Expression for the Average Age of Information in a Multi-Source M/G/1 Queueing Model , 2019, 2019 IEEE Information Theory Workshop (ITW).

[10]  Mehul Motani,et al.  Throughput Maximization with an Average Age of Information Constraint in Fading Channels , 2019, 2020 IEEE International Conference on Communications Workshops (ICC Workshops).

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

[12]  Konstantinos Gatsis,et al.  Age of Information in Random Access Channels , 2020, 2020 IEEE International Symposium on Information Theory (ISIT).

[13]  Maged N Kamel Boulos,et al.  Real-time locating systems (RTLS) in healthcare: a condensed primer. , 2012, International journal of health geographics.

[14]  Sennur Ulukus,et al.  Age of Information for Updates With Distortion: Constant and Age-Dependent Distortion Constraints , 2021, IEEE/ACM Transactions on Networking.

[15]  Wolfgang Kellerer,et al.  AoI-Penalty Minimization for Networked Control Systems with Packet Loss , 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[16]  Eytan Modiano,et al.  Age-Delay Tradeoffs in Queueing Systems , 2019, IEEE Transactions on Information Theory.

[17]  Sheldon M. Ross,et al.  Introduction to probability models , 1975 .

[18]  Marian Codreanu,et al.  Optimal Sampling Cost in Wireless Networks with Age of Information Constraints , 2020, IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

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

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

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

[22]  Sharayu Moharir,et al.  Age of Information in Multi-Source Systems , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[23]  Rahul Vaze,et al.  Not Just Age but Age and Quality of Information , 2018, IEEE Journal on Selected Areas in Communications.

[24]  Roy D. Yates,et al.  The Age of Information in Networks: Moments, Distributions, and Sampling , 2018, IEEE Transactions on Information Theory.

[25]  Yu-Pin Hsu,et al.  Online Energy-Efficient Scheduling for Timely Information Downloads in Mobile Networks , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[26]  Marian Codreanu,et al.  Age of information with packet management , 2014, 2014 IEEE International Symposium on Information Theory.

[27]  Walter L. Smith.  Probability and Statistics , 1959, Nature.

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

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

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

[31]  Eitan Altman,et al.  Controlling Packet Drops to Improve Freshness of information , 2018, NetGCooP.