TY - GEN
T1 - Optimal status updating to minimize age of information with an energy harvesting source
AU - Wu, Xianwen
AU - Yang, Jing
AU - Wu, Jingxian
N1 - Publisher Copyright:
© 2017 IEEE.
PY - 2017/7/28
Y1 - 2017/7/28
N2 - In this paper, we consider a scenario where an energy harvesting sensor continuously monitors a system and sends time-stamped status updates to a destination. The destination keeps track of the system status through the received updates. We use the metric Age of Information (AoI), the time that has elapsed since the last received update was generated, to measure the 'freshness' of the status information available at the destination. We assume energy arrives randomly at the sensor according to a Poisson process, and each status update consumes one unit of energy. Our objective is to design optimal online status update policies to minimize the long-term average Aol, subject to the energy causality constraint at the sensor. We consider three scenarios, i.e., the battery size is infinite, finite, and one unit only, respectively. For the infinite battery scenario, we adopt a best-effort uniform status update policy and and show that it minimizes the long-term average AoI. For the finite battery scenario, we adopt an energy-aware adaptive status update policy, and prove that it is asymptotically optimal when the battery size goes to infinity. For the last scenario where the battery size is one, we propose a threshold based status update policy. We analytically characterize the long-term average AoI under this policy, and prove it is optimal. Simulation results corroborate the theoretical bounds.
AB - In this paper, we consider a scenario where an energy harvesting sensor continuously monitors a system and sends time-stamped status updates to a destination. The destination keeps track of the system status through the received updates. We use the metric Age of Information (AoI), the time that has elapsed since the last received update was generated, to measure the 'freshness' of the status information available at the destination. We assume energy arrives randomly at the sensor according to a Poisson process, and each status update consumes one unit of energy. Our objective is to design optimal online status update policies to minimize the long-term average Aol, subject to the energy causality constraint at the sensor. We consider three scenarios, i.e., the battery size is infinite, finite, and one unit only, respectively. For the infinite battery scenario, we adopt a best-effort uniform status update policy and and show that it minimizes the long-term average AoI. For the finite battery scenario, we adopt an energy-aware adaptive status update policy, and prove that it is asymptotically optimal when the battery size goes to infinity. For the last scenario where the battery size is one, we propose a threshold based status update policy. We analytically characterize the long-term average AoI under this policy, and prove it is optimal. Simulation results corroborate the theoretical bounds.
UR - http://www.scopus.com/inward/record.url?scp=85028332398&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85028332398&partnerID=8YFLogxK
U2 - 10.1109/ICC.2017.7996423
DO - 10.1109/ICC.2017.7996423
M3 - Conference contribution
AN - SCOPUS:85028332398
T3 - IEEE International Conference on Communications
BT - 2017 IEEE International Conference on Communications, ICC 2017
A2 - Debbah, Merouane
A2 - Gesbert, David
A2 - Mellouk, Abdelhamid
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2017 IEEE International Conference on Communications, ICC 2017
Y2 - 21 May 2017 through 25 May 2017
ER -