TY - GEN
T1 - Optimal status updating for an energy harvesting sensor with a noisy channel
AU - Feng, Songtao
AU - Yang, Jing
N1 - Funding Information:
This work was supported in part by the National Science Foundation (NSF) under Grant ECCS-1650299.
Publisher Copyright:
© 2018 IEEE.
PY - 2018/7/6
Y1 - 2018/7/6
N2 - Consider an energy harvesting sensor continuously monitors a system and sends time-stamped status update to a destination. The destination keeps track of the system status through the received updates. Under the energy causality constraint at the sensor, our objective is to design an optimal online status updating policy to minimize the long-term average Age of Information (AoI) at the destination. We focus on the scenario where the the channel between the source and the destination is noisy, and each transmitted update may fail independently with a constant probability. We assume there is no channel state information or transmission feedback available to the sensor. We prove that within a broadly defined class of online policies, the best-effort uniform updating policy, which was shown to be optimal when the channel is perfect, is still optimal in the presence of update failures. Our proof relies on tools from Martingale processes, and the construction of a sequence of virtual policies.
AB - Consider an energy harvesting sensor continuously monitors a system and sends time-stamped status update to a destination. The destination keeps track of the system status through the received updates. Under the energy causality constraint at the sensor, our objective is to design an optimal online status updating policy to minimize the long-term average Age of Information (AoI) at the destination. We focus on the scenario where the the channel between the source and the destination is noisy, and each transmitted update may fail independently with a constant probability. We assume there is no channel state information or transmission feedback available to the sensor. We prove that within a broadly defined class of online policies, the best-effort uniform updating policy, which was shown to be optimal when the channel is perfect, is still optimal in the presence of update failures. Our proof relies on tools from Martingale processes, and the construction of a sequence of virtual policies.
UR - http://www.scopus.com/inward/record.url?scp=85050672261&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85050672261&partnerID=8YFLogxK
U2 - 10.1109/INFCOMW.2018.8406974
DO - 10.1109/INFCOMW.2018.8406974
M3 - Conference contribution
AN - SCOPUS:85050672261
T3 - INFOCOM 2018 - IEEE Conference on Computer Communications Workshops
SP - 348
EP - 353
BT - INFOCOM 2018 - IEEE Conference on Computer Communications Workshops
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE Conference on Computer Communications Workshops, INFOCOM 2018
Y2 - 15 April 2018 through 19 April 2018
ER -