Age-Minimal Online Policies for Energy Harvesting Sensors with Random Battery Recharges
Ahmed Arafa, Jing Yang, Sennur Ulukus

TL;DR
This paper studies optimal online update policies for energy harvesting sensors with finite batteries, aiming to minimize the long-term average age of information by employing a threshold-based renewal policy.
Contribution
It characterizes the optimal scheduling policy as a multi-threshold renewal policy for sensors with Poisson energy arrivals and finite batteries.
Findings
Optimal policy is a renewal policy.
Policy has a multi-threshold structure.
Minimizes long-term average age of information.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAge of Information Optimization · Atomic and Subatomic Physics Research · IoT Networks and Protocols
