Age-Minimal Online Policies for Energy Harvesting Sensors with Random Battery Recharges

February 05, 2018 Β· Declared Dead Β· πŸ› 2018 IEEE International Conference on Communications (ICC)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ahmed Arafa, Jing Yang, Sennur Ulukus arXiv ID 1802.01563 Category cs.IT: Information Theory Cross-listed cs.NI, eess.SP Citations 84 Venue 2018 IEEE International Conference on Communications (ICC) Last Checked 4 months ago
Abstract
We consider an energy harvesting sensor that is sending measurement updates regarding some physical phenomenon to a destination. The sensor relies on energy harvested from nature to measure and send its updates, and is equipped with a battery of finite size to collect its harvested energy. The energy harvesting process is Poisson with unit rate, and arrives in amounts that fully recharge the battery. Our setting is online in the sense that the times of energy arrivals are revealed causally to the sensor after the energy is harvested; only the statistics of the arrival process is known a priori. Updates need to be sent in a timely manner to the destination, namely, such that the long term average age of information is minimized over the course of communication. The age of information is defined as the time elapsed since the freshest update has reached the destination. We first show that the optimal scheduling update policy is a renewal policy, and then show that it has a multi threshold structure: the sensor sends an update only if the age of information grows above a certain threshold that depends on the available energy.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted