Average Age of Information in Update Systems with Active Sources and Packet Delivery Errors
Average Age of Information in Update Systems with Active Sources and Packet Delivery Errors
复制标题
具有活动源和数据包传送错误的更新系统中信息的平均寿命
DOI：
10.1109/lwc.2020.2983397
复制
发表时间：
2020
影响因子：
6.3
通讯作者：
Brown, D.
中科院分区：
文献类型：
--
作者：
Farazi, S.;Klein, A.;Brown, D.
这封信研究多源状态更新系统中的“信息年龄”（AoI），其中N个活动源各自通过具有数据包传递错误的服务器将其时变过程的更新发送到监视器。我们分析了平均AOI固定随机和循环调度策略。对于这两种调度策略，我们进一步分析了分组重传策略的影响，即，当发生错误时，不重传而重传、重传而重传或不重传。平均AoI的表达式推导出每种情况下。它示出的循环调度策略，结合重传与rescovery错误发生时，达到最低的平均AoI之间所考虑的情况。对于具有等概率源选择的固定随机调度，进一步表明具有相同分组管理策略的轮询调度的平均AoI间隙为O（N）。最后，对于平稳随机策略，最优源选择概率，最小化加权和平均AoI度量。
This letter studies the “age of information” (AoI) in a multi-source status update system where N active sources each send updates of their time-varying process to a monitor through a server with packet delivery errors. We analyze the average AoI for stationary randomized and round-robin scheduling policies. For both of these scheduling policies, we further analyze the effect of packet retransmission policies, i.e., retransmission without resampling, retransmission with resampling, or no retransmission, when errors occur. Expressions for the average AoI are derived for each case. It is shown that the round-robin schedule policy in conjunction with retransmission with resampling when errors occur achieves the lowest average AoI among the considered cases. For stationary randomized schedules with equiprobable source selection, it is further shown that the average AoI gap to round-robin schedules with the same packet management policy scales as O(N ). Finally, for stationary randomized policies, the optimal source selection probabilities that minimize a weighted sum average AoI metric are derived.