TY - GEN
T1 - Age-minimal online policies for energy harvesting sensors with incremental battery recharges
AU - Arafa, Ahmed
AU - Yang, Jing
AU - Ulukus, Sennur
AU - Poor, H. Vincent
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/10/23
Y1 - 2018/10/23
N2 - A sensor node that is sending measurement updates regarding some physical phenomenon to a destination is considered. The sensor relies on energy harvested from nature to transmit its updates, and is equipped with a finite B-sized battery to save its harvested energy. Energy recharges the battery incrementally in units, according to a Poisson process, and one update consumes one energy unit to reach the destination. The setting is online, where the energy arrival times are revealed causally after the energy is harvested. The goal is to update the destination in a timely manner, namely, such that the long term average age of information is minimized, subject to energy causality constraints. The age of information at a given time is defined as the time spent since the latest update has reached the destination. It is shown that the optimal update policy follows a renewal structure, where the inter-update times are independent, and the time durations between any two consecutive events of submitting an update and having k units of energy remaining in the battery are independent and identically distributed for a given κ ≤ B-1. The optimal renewal policy for the case of B=2 energy units is explicitly characterized, and it is shown that it has an energy-dependent threshold structure, where the sensor updates only if the age grows above a certain threshold that is a function of the amount of energy in its battery.
AB - A sensor node that is sending measurement updates regarding some physical phenomenon to a destination is considered. The sensor relies on energy harvested from nature to transmit its updates, and is equipped with a finite B-sized battery to save its harvested energy. Energy recharges the battery incrementally in units, according to a Poisson process, and one update consumes one energy unit to reach the destination. The setting is online, where the energy arrival times are revealed causally after the energy is harvested. The goal is to update the destination in a timely manner, namely, such that the long term average age of information is minimized, subject to energy causality constraints. The age of information at a given time is defined as the time spent since the latest update has reached the destination. It is shown that the optimal update policy follows a renewal structure, where the inter-update times are independent, and the time durations between any two consecutive events of submitting an update and having k units of energy remaining in the battery are independent and identically distributed for a given κ ≤ B-1. The optimal renewal policy for the case of B=2 energy units is explicitly characterized, and it is shown that it has an energy-dependent threshold structure, where the sensor updates only if the age grows above a certain threshold that is a function of the amount of energy in its battery.
UR - http://www.scopus.com/inward/record.url?scp=85050677838&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050677838&partnerID=8YFLogxK
U2 - 10.1109/ITA.2018.8503180
DO - 10.1109/ITA.2018.8503180
M3 - Conference contribution
AN - SCOPUS:85050677838
T3 - 2018 Information Theory and Applications Workshop, ITA 2018
BT - 2018 Information Theory and Applications Workshop, ITA 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 Information Theory and Applications Workshop, ITA 2018
Y2 - 11 February 2018 through 16 February 2018
ER -