pith. sign in

arxiv: 1808.05141 · v2 · pith:XDYY6TUBnew · submitted 2018-08-13 · 💻 cs.IT · math.IT

Age of Information Minimization for an Energy Harvesting Source with Updating Erasures: With and Without Feedback

classification 💻 cs.IT math.IT
keywords updatingsensordestinationpolicystatusenergypoliciesfeedback
0
0 comments X
read the original abstract

Consider an energy harvesting (EH) sensor that continuously monitors a system and sends time-stamped status update to a destination. The sensor harvests energy from nature and uses it to power its updating operations. The destination keeps track of the system status through the successfully received updates. With the recently introduced information freshness metric "Age of Information" (AoI), our objective is to design optimal online status updating policy to minimize the long-term average AoI at the destination, subject to the energy causality constraint at the sensor. Due to the noisy channel between the sensor and the destination, each transmitted update may be erased with a fixed probability, and the AoI at the destination will be reset to zero only when an update is successfully received. We first consider status updating without feedback available to the sensor and show that the Best-effort Uniform updating (BU) policy is optimal. We then investigate status updating with perfect feedback to the sensor and prove the optimality of the Best-effort Uniform updating with Retransmission (BUR) policy. In order to prove the optimality of the proposed policies, for each case, we first identify a lower bound on the long-term average AoI among a broad class of online policies, and then construct a sequence of virtual policies to approach the lower bound asymptotically. Since those virtual policies are sub-optimal to the original policy, the original policy is thus optimal.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Trading Off Computation with Transmission in Status Update Systems

    cs.IT 2019-07 unverdicted novelty 4.0

    Derives closed-form average and peak AoI for a tandem M/GI/1/1 and GI/M/1/2* queue system with dependent service times between computation and transmission.