Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor

Ahmed Arafa, Jing Yang, Sennur Ulukus, H. Vincent Poor

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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.

Original languageEnglish (US)
Title of host publication2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages607-611
Number of pages5
ISBN (Electronic)9781538692912
DOIs
StatePublished - Jul 2019
Event2019 IEEE International Symposium on Information Theory, ISIT 2019 - Paris, France
Duration: Jul 7 2019Jul 12 2019

Publication series

NameIEEE International Symposium on Information Theory - Proceedings
Volume2019-July
ISSN (Print)2157-8095

Conference

Conference2019 IEEE International Symposium on Information Theory, ISIT 2019
CountryFrance
CityParis
Period7/7/197/12/19

Fingerprint

Energy Harvesting
Energy harvesting
Updating
Update
Feedback
Sensor
Sensors
Unit
Energy
Renewal Process
Arrival Time
Renewal
Poisson process
Battery
Real-time
Term
Policy

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Information Systems
  • Modeling and Simulation
  • Applied Mathematics

Cite this

Arafa, A., Yang, J., Ulukus, S., & Poor, H. V. (2019). Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings (pp. 607-611). [8849636] (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ISIT.2019.8849636
Arafa, Ahmed ; Yang, Jing ; Ulukus, Sennur ; Poor, H. Vincent. / Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor. 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. pp. 607-611 (IEEE International Symposium on Information Theory - Proceedings).
@inproceedings{c8e79a4c921b4465945ae7c9cb31ac71,
title = "Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor",
abstract = "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.",
author = "Ahmed Arafa and Jing Yang and Sennur Ulukus and Poor, {H. Vincent}",
year = "2019",
month = "7",
doi = "10.1109/ISIT.2019.8849636",
language = "English (US)",
series = "IEEE International Symposium on Information Theory - Proceedings",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "607--611",
booktitle = "2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings",
address = "United States",

}

Arafa, A, Yang, J, Ulukus, S & Poor, HV 2019, Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor. in 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings., 8849636, IEEE International Symposium on Information Theory - Proceedings, vol. 2019-July, Institute of Electrical and Electronics Engineers Inc., pp. 607-611, 2019 IEEE International Symposium on Information Theory, ISIT 2019, Paris, France, 7/7/19. https://doi.org/10.1109/ISIT.2019.8849636

Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor. / Arafa, Ahmed; Yang, Jing; Ulukus, Sennur; Poor, H. Vincent.

2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2019. p. 607-611 8849636 (IEEE International Symposium on Information Theory - Proceedings; Vol. 2019-July).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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

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.

ER -

Arafa A, Yang J, Ulukus S, Poor HV. Using Erasure Feedback for Online Timely Updating with an Energy Harvesting Sensor. In 2019 IEEE International Symposium on Information Theory, ISIT 2019 - Proceedings. Institute of Electrical and Electronics Engineers Inc. 2019. p. 607-611. 8849636. (IEEE International Symposium on Information Theory - Proceedings). https://doi.org/10.1109/ISIT.2019.8849636