论文标题
固定和非平稳环境中信息年龄的基本限制
Fundamental Limits of Age-of-Information in Stationary and Non-stationary Environments
论文作者
论文摘要
我们研究了多用户调度问题，以最大程度地减少固定和非平稳状态下细胞无线网络中信息年龄（AOI）。我们为调度问题和设计有效的在线政策提供了基本的下限，并提供可证明的性能保证。在固定设置中，我们考虑了一组围绕多个单元格的移动用户的AOI优化问题。在这种情况下，我们提出了一项调度策略，并表明它是$ 2 $最佳的。接下来，我们提出了一个新的对抗渠道模型，用于研究非平稳环境中的调度问题。对于$ n $用户，我们表明此设置中任何在线调度策略的竞争比率至少为$ω（n）$。然后，我们提出一项在线政策，并表明它达到了$ O（n^2）$的竞争比率。最后，我们介绍了一个放松的对抗模型，并对不久的将来进行了渠道状态估算。我们提出了一种启发式模型预测控制政策，该政策利用了此功能并通过数值模拟比较其性能。
We study the multi-user scheduling problem for minimizing the Age of Information (AoI) in cellular wireless networks under stationary and non-stationary regimes. We derive fundamental lower bounds for the scheduling problem and design efficient online policies with provable performance guarantees. In the stationary setting, we consider the AoI optimization problem for a set of mobile users travelling around multiple cells. In this setting, we propose a scheduling policy and show that it is $2$-optimal. Next, we propose a new adversarial channel model for studying the scheduling problem in non-stationary environments. For $N$ users, we show that the competitive ratio of any online scheduling policy in this setting is at least $Ω(N)$. We then propose an online policy and show that it achieves a competitive ratio of $O(N^2)$. Finally, we introduce a relaxed adversarial model with channel state estimations for the immediate future. We propose a heuristic model predictive control policy that exploits this feature and compare its performance through numerical simulations.
