Online Timely Status Updates with Erasures for Energy Harvesting Sensors

@article{Arafa2018OnlineTS,
  title={Online Timely Status Updates with Erasures for Energy Harvesting Sensors},
  author={Ahmed M. Arafa and Jing Yang and Sennur Ulukus and H. Vincent Poor},
  journal={2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)},
  year={2018},
  pages={966-972}
}
  • A. ArafaJing Yang H. Poor
  • Published 1 October 2018
  • Computer Science
  • 2018 56th Annual Allerton Conference on Communication, Control, and Computing (Allerton)
An energy harvesting sensor that is sending status updates to a destination through an erasure channel is considered, in which transmissions are prone to being erased with some probability $q$, independently from other transmissions. The sensor, however, is unaware of erasure events due to lack of feedback from the destination. Energy expenditure is normalized in the sense that one transmission consumes one unit of energy. The sensor is equipped with a unit-sized battery to save its incoming… 

Figures from this paper

Timely Status Updating Over Erasure Channels Using an Energy Harvesting Sensor: Single and Multiple Sources

A status updating system is considered in which data from multiple sources are sampled by an energy harvesting sensor and transmitted to a remote destination through an erasure channel, and it is shown that renewal policies are optimal, in which successful status update instances form a renewal process.

Age-Minimal Transmission for Energy Harvesting Sensors With Finite Batteries: Online Policies

An energy-harvesting sensor node that is sending status updates to a destination is considered, and it is shown that the optimal renewal policy has an energy-dependent threshold structure, in which the sensor sends a status update only if the AoI grows above a certain threshold that depends on the energy available in its battery.

Timely Updating with Intermittent Energy and Data for Multiple Sources over Erasure Channels

  • C. DanielA. Arafa
  • Computer Science
    2021 17th International Symposium on Wireless Communication Systems (ISWCS)
  • 2021
Multiple numerical evaluations are demonstrated to show how the optimal threshold value behaves as a function of the system parameters, and showcase the benefits of a threshold-based waiting policy with intermittent energy and data arrivals.

Optimal status updating with a finite-battery energy harvesting source

It is proved that one optimal solution of this problem is a monotone threshold policy, which satisfies (i) each new update is sent out only when the age is higher than a threshold and (ii) the threshold is a non-increasing function of the instantaneous battery level.

Timely Updates in Energy Harvesting Two-Hop Networks: Offline and Online Policies

A two-hop energy harvesting communication network is considered, in which measurement updates are transmitted by a source to a destination through an intermediate relay, showing that it is optimal to transmit updates from the source just in time as the relay is ready to forward them to the destination.

Age of Information Minimization in Energy Harvesting Sensors with Non-Ideal Batteries

This work considers a sensor-monitor pair, where the EH-powered sensor delivers timely updates to the monitor over a fading channel, and reduces the computational complexity of the value iteration, by showing that the optimal action takes one of the two values.

Optimal Update for Energy Harvesting Sensor with Reliable Backup Energy

The optimal information updating policy is proved to have a threshold structure and an algorithm for efficiently computing the optimal policy is proposed andumerical results show that the optimal updating policy proposed outperforms baseline policies.

Age-of-Information With Information Source Diversity in an Energy Harvesting System

This work considers an energy-harvesting monitoring node equipped with a finite-size battery and collecting status updates from multiple heterogeneous information sources, and investigates the policies that minimize the average AoI, and evaluates the role of information source diversity on the system performance.

Age of Information of Parallel Server Systems with Energy Harvesting

This work shows that the average Age of Information of a status update system that is formed by two parallel homogeneous servers and such that there is an energy source that feeds the system following a random process can be characterized by solving a system with eight linear equations.

Active Status Update Packet Drop Control in an Energy Harvesting Node

  • P. RafieeOmur Ozel
  • Computer Science
    2020 IEEE 21st International Workshop on Signal Processing Advances in Wireless Communications (SPAWC)
  • 2020
Age-threshold based power ON-OFF schemes to minimize age of information at the node subject to energy harvesting constraints with partial and full power down options for Bmax = 1 and B max = TO cases are developed.

References

SHOWING 1-10 OF 30 REFERENCES

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

A sensor node that is sending measurement updates regarding some physical phenomenon to a destination is considered, and it is shown that the optimal update policy follows a renewal structure, where the inter-update times are independent, and the time durations between any two consecutive events of submitting an update are independent and identically distributed.

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

The optimal scheduling update policy is a renewal policy, and 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.

Age-Minimal Transmission for Energy Harvesting Sensors With Finite Batteries: Online Policies

An energy-harvesting sensor node that is sending status updates to a destination is considered, and it is shown that the optimal renewal policy has an energy-dependent threshold structure, in which the sensor sends a status update only if the AoI grows above a certain threshold that depends on the energy available in its battery.

Optimal status updating for an energy harvesting sensor with a noisy channel

  • Songtao FengJ. Yang
  • Computer Science
    IEEE INFOCOM 2018 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
  • 2018
It is proved 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.

Minimizing Age of Information for an Energy Harvesting Source with Updating Failures

  • Songtao FengJing Yang
  • Computer Science
    2018 IEEE International Symposium on Information Theory (ISIT)
  • 2018
This paper proposes a status updating policy called Best-effort Uniform updating with Retransmission (BUR), under which the source tries to equalize the delay between two successful updates as much as possible, and retransmits an update immediately if the previous transmission fails.

Optimal Status Update for Age of Information Minimization With an Energy Harvesting Source

The metric Age of Information, the time that has elapsed since the last received update was generated, is used to measure the “freshness” of the status information available at the destination to design optimal online status update policies to minimize the long-term average AoI.

Scheduling status updates to minimize age of information with an energy harvesting sensor

The problem of finding an age-optimal threshold policy, with the transmission threshold being a function of the energy state and the estimated current age, is formulated and the average age is analyzed for the unit battery scenario under a memoryless energy arrival process.

Age of information under energy replenishment constraints

An effective online heuristic, Balance Updating (BU), that achieves performance close to an omniscient (offline) policy is proposed and simulations indicate that they can significantly improve the age over greedy approaches.

Age minimization in energy harvesting communications: Energy-controlled delays

  • A. ArafaS. Ulukus
  • Computer Science
    2017 51st Asilomar Conference on Signals, Systems, and Computers
  • 2017
The goal is to transmit updates in a timely manner, namely, such that the total age of information is minimized by the end of the communication session, subject to energy causality constraints.

Average age of information for status update systems with an energy harvesting server

The average age of information in a single-source status update system with energy constraints is analyzed both for servers that are able or unable to perform simultaneous service and energy harvesting and closed-form expressions for the average age in terms of the system parameters are derived.