Age of Information with Soft Updates

We consider an information updating system where an information provider and an information receiver engage in an update process over time. Different from the existing literature where updates are countable (hard) and take effect either immediately or after a delay, but instantaneously in both cases, here updates start taking effect right away but gradually over time. We coin this setting soft updates. When the updating process starts, the age decreases until the soft update period ends. We constrain the number of times the information provider and the information receiver meet (number of update periods) and the total duration of the update periods. We consider two models for the decrease of age during an update period: In the first model, the rate of decrease of the age is proportional to the current age, and in the second model, the rate of decrease of the age is constant. The first model results in an exponentially decaying age, and the second model results in a linearly decaying age. In both cases, we determine the optimum updating schemes, by determining the optimum start times and the optimum durations of the updates, subject to the constraints on the number of update periods (number of meetings) and the total update duration.

[1]  Roy D. Yates,et al.  Timely updates over an erasure channel , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[3]  Jing Yang,et al.  Optimal status updating for an energy harvesting sensor with a noisy channel , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

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

[5]  Anthony Ephremides,et al.  Age of information under random updates , 2013, 2013 IEEE International Symposium on Information Theory.

[6]  H. Vincent Poor,et al.  Age-Minimal Online Policies for Energy Harvesting Sensors with Incremental Battery Recharges , 2018, 2018 Information Theory and Applications Workshop (ITA).

[7]  Emre Telatar,et al.  Status updates in a multi-stream M/G/1/1 preemptive queue , 2018, IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

[8]  Sennur Ulukus,et al.  Coded status updates in an energy harvesting erasure channel , 2018, 2018 52nd Annual Conference on Information Sciences and Systems (CISS).

[9]  Roy D. Yates,et al.  Real-time status updating: Multiple sources , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.

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

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

[12]  H. Vincent Poor,et al.  Age-Minimal Transmission for Energy Harvesting Sensors With Finite Batteries: Online Policies , 2018, IEEE Transactions on Information Theory.

[13]  H. Vincent Poor,et al.  Online Timely Status Updates with Erasures for Energy Harvesting Sensors , 2018, 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[14]  Sennur Ulukus,et al.  Minimizing age of information with soft updates , 2018, Journal of Communications and Networks.

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

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

[17]  Sennur Ulukus,et al.  Age-Minimal Transmission in Energy Harvesting Two-Hop Networks , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

[18]  Sennur Ulukus,et al.  Age minimization in energy harvesting communications: Energy-controlled delays , 2017, 2017 51st Asilomar Conference on Signals, Systems, and Computers.

[19]  Elif Uysal-Biyikoglu,et al.  Achieving the Age-Energy Tradeoff with a Finite-Battery Energy Harvesting Source , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

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

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

[22]  Jing Yang,et al.  Sening Information Through Status Updates , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).

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

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

[25]  Elif Uysal-Biyikoglu,et al.  Age of information under energy replenishment constraints , 2015, 2015 Information Theory and Applications Workshop (ITA).