Minimizing the Age of Information in Wireless Networks with Stochastic Arrivals
Minimizing the Age of Information in Wireless Networks with Stochastic Arrivals
复制标题
DOI：
10.1109/tmc.2019.2959774
复制
发表时间：
2021-03-01
影响因子：
7.9
通讯作者：
Modiano, Eytan
中科院分区：
文献类型：
--
作者：
Kadota, Igor;Modiano, Eytan
我们考虑一个无线网络的基站服务多个流量流到不同的目的地。来自每个流的分组根据随机过程到达基站，并且在单独的（每个流）队列中排队。分组规则控制每个队列中的哪个分组可用于传输。基站在每个时间t决定哪个流服务于对应的目的地。调度决策的目标是保持目的地的信息最新。信息新鲜度由信息年龄（AoI）度量捕获。在本文中，我们推导出一个下界的AoI性能可实现的任何给定的网络下运行的任何搜索纪律。然后，我们考虑了三个常见的随机化规则，并在每个规则下分别设计了一个最优平稳随机化策略和一个最大权重策略。我们的方法使我们能够评估的综合影响的随机到达，排队纪律和调度政策的AOI。我们评估的AOI性能分析和使用模拟。数值结果表明，最大权策略的性能接近分析下限。
We consider a wireless network with a base station serving multiple traffic streams to different destinations. Packets from each stream arrive to the base station according to a stochastic process and are enqueued in a separate (per stream) queue. The queueing discipline controls which packet within each queue is available for transmission. The base station decides, at every time t, which stream to serve to the corresponding destination. The goal of scheduling decisions is to keep the information at the destinations fresh. Information freshness is captured by the Age of Information (AoI) metric. In this paper, we derive a lower bound on the AoI performance achievable by any given network operating under any queueing discipline. Then, we consider three common queueing disciplines and develop both an Optimal Stationary Randomized policy and a Max-Weight policy under each discipline. Our approach allows us to evaluate the combined impact of the stochastic arrivals, queueing discipline and scheduling policy on AoI. We evaluate the AoI performance both analytically and using simulations. Numerical results show that the performance of the Max-Weight policy is close to the analytical lower bound.