TY - GEN
T1 - Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor
AU - Arafa, Ahmed
AU - Yang, Jing
AU - Ulukus, Sennur
AU - Poor, H. Vincent
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/7
Y1 - 2019/7
N2 - A real-time status updating system is considered, in which an energy harvesting sensor is acquiring measurements regarding some physical phenomenon and sending them to a destination through an erasure channel. The setting is online, in which energy arrives in units according to a Poisson process with unit rate, with arrival times being revealed causally over time. Energy is saved in a unit-sized battery. The sensor is notified by the destination of whether updates were erased via feedback. Updates need to reach the destination successfully in a timely fashion, namely, such that the long term average age of information, defined as the time elapsed since the latest successful update has reached the destination, is minimized. First, it is shown that the optimal status update policy has a renewal structure: successful update times should constitute a renewal process. Then, threshold-greedy policies are investigated: a new update is transmitted, following a successful one, only if the age of information grows above a certain threshold; and if it is erased, then all subsequent update attempts are greedily scheduled whenever energy is available. The optimal threshold-greedy policy is then analytically derived.
AB - A real-time status updating system is considered, in which an energy harvesting sensor is acquiring measurements regarding some physical phenomenon and sending them to a destination through an erasure channel. The setting is online, in which energy arrives in units according to a Poisson process with unit rate, with arrival times being revealed causally over time. Energy is saved in a unit-sized battery. The sensor is notified by the destination of whether updates were erased via feedback. Updates need to reach the destination successfully in a timely fashion, namely, such that the long term average age of information, defined as the time elapsed since the latest successful update has reached the destination, is minimized. First, it is shown that the optimal status update policy has a renewal structure: successful update times should constitute a renewal process. Then, threshold-greedy policies are investigated: a new update is transmitted, following a successful one, only if the age of information grows above a certain threshold; and if it is erased, then all subsequent update attempts are greedily scheduled whenever energy is available. The optimal threshold-greedy policy is then analytically derived.
UR - http://www.scopus.com/inward/record.url?scp=85073155274&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85073155274&partnerID=8YFLogxK
U2 - 10.1109/ISIT.2019.8849636
DO - 10.1109/ISIT.2019.8849636
M3 - Conference contribution
AN - SCOPUS:85073155274
T3 - IEEE International Symposium on Information Theory - Proceedings
SP - 607
EP - 611
BT - 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE International Symposium on Information Theory, ISIT 2019
Y2 - 7 July 2019 through 12 July 2019
ER -