论文标题
关于在多传感器设置中最小化信息时代的信息时代
On Minimizing Channel-Aware Age of Information in a Multi-Sensor Setting
论文作者
论文摘要
我们提出了一种信息时代（AOI）度量的变体，称为信息感知时代的信息时代（CA-AOI）。与AOI不同，CA-AOI考虑了源和预期目的地之间的渠道条件，以计算目的地最近收到的最新更新的“年龄”。该新的度量确保了资源分配不会大大倾斜到渠道条件下的来源。我们为多传感器系统设计了调度策略，其中传感器通过共享的不可靠的通信渠道向中央监控站报告其测量值，以最大程度地降低CA-AOIS加权总和的时间平均值。我们最初为新鲜目标提供了普遍的下限。我们表明，调度问题是可索引的，并得出了基于较低的复杂性基于质指数的调度策略。我们还设计固定的随机调度算法并提供优化过程以找到策略的最佳参数。通过模拟，我们表明我们提出的政策在几种情况下超过了贪婪的政策。此外，基于Whittle索引的调度策略在所有考虑的所有设置中都优于其他政策。
We propose a variant of the Age of Information (AoI) metric called Channel-Aware Age of Information (CA-AoI). Unlike AoI, CA-AoI takes into account the channel conditions between the source and the intended destination to compute the "age" of the recent most update received by the destination. This new metric ensures that the resource allocation is not heavily tilted towards the sources with poor channel conditions. We design scheduling policies for multi-sensor systems in which sensors report their measurements to a central monitoring station via a shared unreliable communication channel with the goal of minimizing the time-average of the weighted sum of CA-AoIs. We initially derive universal lower bounds for the freshness objective. We show that the scheduling problem is indexable and derive low complexity Whittle index based scheduling policies. We also design stationary randomized scheduling algorithms and give optimization procedures to find the optimal parameters of the policy. Via simulations, we show that our proposed policies surpass the greedy policy in several settings. Moreover the Whittle Index based scheduling policies outperform other policies in all the settings considered.
