Optimizing Age of Information in Wireless Networks with Throughput Constraints
Optimizing Age of Information in Wireless Networks with Throughput Constraints
复制标题
DOI：
10.1109/infocom.2018.8486307
复制
发表时间：
2018-04
期刊：
影响因子：
--
通讯作者：
I. Kadota;Abhishek Sinha;E. Modiano
中科院分区：
文献类型：
--
作者：
I. Kadota;Abhishek Sinha;E. Modiano
信息年龄（AoI）是一个性能指标，从目的地的角度捕捉信息的新鲜度。AoI测量自生成最近一次发送到目的地的数据包以来所经过的时间。在本文中，我们考虑了一个单跳无线网络与一些节点发送时间敏感的信息到基站和地址的问题，最小化的网络的期望加权和AoI，同时满足时间吞吐量的限制，从节点。我们开发了三个低复杂度的传输调度政策，试图尽量减少AOI受最低吞吐量的要求，并评估其性能对最佳的政策。特别是，我们开发了一个随机化的政策，最大权重的政策和惠特尔指数的政策，并表明，他们保证在一个因素内的两个，四个和八个，分别远离最小的AoI可能。相比之下，仿真结果表明，最大权重优于其他政策，无论是在AoI和吞吐量方面，在每一个网络配置模拟，并达到接近最佳的性能。
Age of Information (AoI) is a performance metric that captures the freshness of the information from the perspective of the destination. The AoI measures the time that elapsed since the generation of the packet that was most recently delivered to the destination. In this paper, we consider a single-hop wireless network with a number of nodes transmitting time-sensitive information to a Base Station and address the problem of minimizing the Expected Weighted Sum AoI of the network while simultaneously satisfying timely-throughput constraints from the nodes. We develop three low-complexity transmission scheduling policies that attempt to minimize AoI subject to minimum throughput requirements and evaluate their performance against the optimal policy. In particular, we develop a randomized policy, a Max-Weight policy and a Whittle's Index policy, and show that they are guaranteed to be within a factor of two, four and eight, respectively, away from the minimum AoI possible. In contrast, simulation results show that Max-Weight outperforms the other policies, both in terms of AoI and throughput, in every network configuration simulated, and achieves near optimal performance.