4.4 Article

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

出版社

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TGCN.2021.3105881

关键词

Batteries; Energy harvesting; Monitoring; Communication channels; Round robin; Optimization; Noise measurement; Age of information; energy harvesting communications; erasure channel; multiple sources

资金

  1. U.S. National Science Foundation [CNS 15-26608, CCF 17-13977, ECCS 18-07348, CCF 19-08308, ECCS 16-54471]

向作者/读者索取更多资源

This article discusses a status updating system that aims to minimize the cumulative long-term average age-of-information (AoI) by sampling data from multiple sources using an energy harvesting sensor and transmitting it to a remote destination. The problem is studied in two settings: no erasure status feedback and perfect instantaneous feedback. Optimal policies are proposed for both settings, considering the availability of energy and the erasure probability.
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. The goal is to deliver status updates of all sources in a timely manner, such that the cumulative long-term average age-of-information (AoI) is minimized. The AoI for each source is defined as the time elapsed since the generation time of the latest successful status update received at the destination from that source. Transmissions are subject to energy availability, which arrives in units according to a Poisson process, with each energy unit capable of carrying out one transmission from only one source. The sensor is equipped with a unit-sized battery to save the incoming energy. A scheduling policy is designed in order to determine which source is sampled using the available energy. The problem is studied in two main settings: 1) no erasure status feedback and 2) perfect instantaneous feedback. For the case of one source, it is shown that renewal policies are optimal, in which successful status update instances form a renewal process. In the setting without feedback, it is further shown that threshold-based policies are optimal, in which the source is sampled only if the time until a new energy unit arrives exceeds a certain threshold. In the setting with feedback, threshold-greedy policies are investigated, in which the source is sampled according to a threshold-based policy following successful transmissions, and instantaneously whenever energy is available following failed transmissions. The optimal thresholds are found in closed-form in terms of the erasure probability. Such threshold-based policies are then extended for the case of multiple sources, combined with round robin scheduling in the setting without feedback, in which sources are sampled in the same repeating order; and maximum-age-first scheduling in the setting with feedback, in which sources with maximum AoI are given priority. In both settings, the achieved cumulative long-term average AoI is derived in closed-form in terms of the threshold, the erasure probability and the number of sources.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.4
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据