TY - GEN
T1 - Minimizing Age of Information for an Energy Harvesting Source with Updating Failures
AU - Feng, Songtao
AU - Yang, Jing
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/8/15
Y1 - 2018/8/15
N2 - In this paper, we consider a status monitoring system where an energy harvesting sensor continuously sends time-stamped status updates to a destination. With a non-zero probability, each update will be corrupted by noise and result in an updating failure. The destination keeps track of the system status through the successfully delivered updates. We assume that there is a perfect feedback channel between the destination and the source, so that the source is aware of the updating failures once they occur. With the feedback information, our objective is to design the optimal online status updating policy to minimize the expected long-term average Age of Information (AoI) at the destination, subject to the energy causality constraint at the sensor. We propose a status updating policy called Best-effort Uniform updating with Retransmission (BUR), under which the source tries to equalize the delay between two successful updates as much as possible, and retransmits an update immediately if the previous transmission fails. We show that the BUR policy achieves the minimum expected long-term average AoI among a broad class of online policies.
AB - In this paper, we consider a status monitoring system where an energy harvesting sensor continuously sends time-stamped status updates to a destination. With a non-zero probability, each update will be corrupted by noise and result in an updating failure. The destination keeps track of the system status through the successfully delivered updates. We assume that there is a perfect feedback channel between the destination and the source, so that the source is aware of the updating failures once they occur. With the feedback information, our objective is to design the optimal online status updating policy to minimize the expected long-term average Age of Information (AoI) at the destination, subject to the energy causality constraint at the sensor. We propose a status updating policy called Best-effort Uniform updating with Retransmission (BUR), under which the source tries to equalize the delay between two successful updates as much as possible, and retransmits an update immediately if the previous transmission fails. We show that the BUR policy achieves the minimum expected long-term average AoI among a broad class of online policies.
UR - http://www.scopus.com/inward/record.url?scp=85052474663&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85052474663&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2018.8437547
DO - 10.1109/ISIT.2018.8437547
M3 - Conference contribution
AN - SCOPUS:85052474663
SN - 9781538647806
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 2431
EP - 2435
BT - 2018 IEEE International Symposium on Information Theory, ISIT 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE International Symposium on Information Theory, ISIT 2018
Y2 - 17 June 2018 through 22 June 2018
ER -