当前位置: X-MOL 学术arXiv.cs.IT › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Timely Updating with Intermittent Energy and Data for Multiple Sources over Erasure Channels
arXiv - CS - Information Theory Pub Date : 2021-09-15 , DOI: arxiv-2109.07459
Christopher Daniel Jr., Ahmed Arafa

A status updating system is considered in which multiple data sources generate packets to be delivered to a destination through a shared energy harvesting sensor. Only one source's data, when available, can be transmitted by the sensor at a time, subject to energy availability. Transmissions are prune to erasures, and each successful transmission constitutes a status update for its corresponding source at the destination. The goal is to schedule source transmissions such that the collective long-term average age-of-information (AoI) is minimized. AoI is defined as the time elapsed since the latest successfully-received data has been generated at its source. To solve this problem, the case with a single source is first considered, with a focus on threshold waiting policies, in which the sensor attempts transmission only if the time until both energy and data are available grows above a certain threshold. The distribution of the AoI is fully characterized under such a policy. This is then used to analyze the performance of the multiple sources case under maximum-age-first scheduling, in which the sensor's resources are dedicated to the source with the maximum AoI at any given time. The achievable collective long-term average AoI is derived in closed-form. 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.

中文翻译:

通过擦除通道及时更新多个源的间歇性能量和数据

考虑一种状态更新系统,其中多个数据源生成要通过共享能量收集传感器传送到目的地的数据包。传感器一次只能传输一个来源的数据(如果可用),取决于能源可用性。传输被修剪为擦除,并且每次成功的传输构成其在目的地的相应源的状态更新。目标是安排源传输,使集体长期平均信息年龄 (AoI) 最小化。AoI 定义为自最新成功接收的数据在其源处生成以来经过的时间。为了解决这个问题,首先考虑单一来源的情况,重点是阈值等待策略,其中,只有当能量和数据都可用的时间超过某个阈值时,传感器才会尝试传输。在这样的政策下,AoI 的分布得到了充分的表征。然后将其用于分析最大年龄优先调度下多源情况的性能,其中传感器的资源专用于在任何给定时间具有最大 AoI 的源。可实现的集体长期平均 AoI 以封闭形式导出。演示了多个数值评估,以显示最佳阈值如何作为系统参数的函数,并展示具有间歇性能量和数据到达的基于阈值的等待策略的好处。在这样的政策下,AoI 的分布得到了充分的表征。然后将其用于分析最大年龄优先调度下多源情况的性能,其中传感器的资源专用于在任何给定时间具有最大 AoI 的源。可实现的集体长期平均 AoI 以封闭形式导出。演示了多个数值评估,以显示最佳阈值如何作为系统参数的函数,并展示具有间歇性能量和数据到达的基于阈值的等待策略的好处。在这样的政策下,AoI 的分布得到了充分的表征。然后将其用于分析最大年龄优先调度下多源情况的性能,其中传感器的资源专用于在任何给定时间具有最大 AoI 的源。可实现的集体长期平均 AoI 以封闭形式导出。演示了多个数值评估,以显示最佳阈值如何作为系统参数的函数,并展示具有间歇性能量和数据到达的基于阈值的等待策略的好处。可实现的集体长期平均 AoI 以封闭形式导出。演示了多个数值评估,以显示最佳阈值如何作为系统参数的函数,并展示具有间歇性能量和数据到达的基于阈值的等待策略的好处。可实现的集体长期平均 AoI 以封闭形式导出。演示了多个数值评估,以显示最佳阈值如何作为系统参数的函数,并展示具有间歇性能量和数据到达的基于阈值的等待策略的好处。
更新日期:2021-09-16
down
wechat
bug