Age of Information under Energy Replenishment Constraints

Date

2015-02-06

Author

Bacınoğlu, Baran Tan
Ceran, Elif Tugce
Uysal, Elif

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

74
views

0
downloads

We consider managing the freshness of status updates sent from a source (such as a sensor) to a monitoring node. The time-varying availability of energy at the sender limits the rate of update packet transmissions. At any time, the age of information is defined as the amount of time since the most recent update was successfully received. An offline solution that minimizes not only the time average age, but also the peak age for an arbitrary energy replenishment profile is derived. The related decision problem under stochastic energy arrivals at the sender is studied through a discrete time dynamic programming formulation, and the structure of the optimal policy that minimizes the expected age is shown. It is found that tracking the expected value of the current age (which is a linear operation), together with the knowledge of the current energy level at the sender side is sufficient for generating an optimal threshold policy. An effective online heuristic, Balance Updating (BU), that achieves performance close to an omniscient (offline) policy is proposed. Simulations of the policies indicate that they can significantly improve the age over greedy approaches. An extension of the formulation to stochastically formed updates is considered.

URI

https://hdl.handle.net/11511/53349

Conference Name

nformation Theory and Applications Workshop (ITA)

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

Measuring age of information on real-life connections Beytur, Hasan Burhan; Baghaee, Sajjad; Uysal, Elif (2019-04-01) Age of Information (AoI) is a relatively new metric to measure freshness of networked application such as real-time monitoring of status updates or control. The AoI metric is discussed in the literature mainly in a theoretical way. In this work, we want to point out the issues related to the measuring AoI-related values, such as synchronization and calculation of the values. We discussed the effect of synchronization error in the measurement and a solution for calculating an estimate of average AoI without ...
Update or Wait: How to Keep Your Data Fresh Sun, Yin; Uysal, Elif; Yates, Roy D.; Koksal, C. Emre; Shroff, Ness B. (2017-11-01) In this paper, we study how to optimally manage the freshness of infimmation updates sent from a source node to a destination via a channel. A proper metric for data freshness at the destination is the age-of-information, or simply age, which is defined as how old the freshest received update is, since the moment that this update was generated at the source node (e.g., a sensor). A reasonable update policy is the zero wait policy, i.e., the source node submits a fresh update once the previous update is deli...
Scheduling Status Updates to Minimize Age of Information with an Energy Harvesting Sensor Bacınoğlu, Baran Tan; Uysal, Elif (2017-06-30) Age of Information is a measure of the freshness of status updates in monitoring applications and update-based systems. We study a real-time sensing scenario with a sensor which is restricted by time-varying energy constraints and battery limitations. The sensor sends updates over a packet erasure channel with no feedback. The problem of finding an age-optimal threshold policy, with the transmission threshold being a function of the energy state and the estimated current age, is formulated. The average age ...
Age-Optimal Updates of Multiple Information Flows Sun, Yin; Uysal, Elif; Kompella, Sastry (2018-04-19) In this paper, we study an age of information minimization problem, where multiple flows of update packets are sent over multiple servers to their destinations. Two online scheduling policies are proposed. When the packet generation and arrival times are synchronized across the flows, the proposed policies are shown to be (near) optimal for minimizing any time-dependent, symmetric, and non-decreasing penalty function of the ages of the flows over time in a stochastic ordering sense.
Efficient Network Monitoring via In-band Telemetry Simsek, Goksel; Ergenc, Doganalp; Onur, Ertan (2021-04-19) © 2021 IEEE.Network monitoring is one of the key aspects to ensure communication reliability in case of failures and malicious activities and has several design issues depending on the system characteristics. As traditional monitoring solutions usually rely on periodic updates between the network controller and ordinary nodes, scalability remains a challenge, especially for complex systems. A recent solution, the In-Band Network Telemetry (INT) framework, allows data packets to probe the nodes while travers...

Citation Formats

B. T. Bacınoğlu, E. T. Ceran, and E. Uysal, “Age of Information under Energy Replenishment Constraints,” presented at the nformation Theory and Applications Workshop (ITA), Univ California, San Diego, CA, 2015, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/53349.