Optimizing Information Freshness in Wireless Networks Under General Interference Constraints

Optimizing Information Freshness in Wireless Networks Under General Interference Constraints
复制标题

DOI:
10.1145/3209582.3209589
复制
发表时间:
2018-03
期刊:
IEEE/ACM Transactions on Networking
影响因子:
--
通讯作者:
Rajat Talak;S. Karaman;E. Modiano
Rajat Talak;S. Karaman;E. Modiano
中科院分区:
其他
文献类型:
--
作者:
Rajat Talak;S. Karaman;E. Modiano

文献摘要

被引文献

相似文献

信息年龄(AoI)是近期提出的一种用于衡量信息新鲜度的指标。AoI衡量的是从生成上次接收到的更新以来所经过的时间。我们考虑在一般干扰约束下,在由一组源 - 目的链路组成的无线网络中最小化平均和峰值AoI的问题。当总有新鲜信息可供传输时,我们表明一种平稳调度策略在峰值年龄方面是最优的。我们还证明该策略所实现的平均年龄在最优平均年龄的两倍因子范围内。在新鲜信息不总是可用,并且必须连同调度链路进行传输来控制分组/信息生成速率的情况下,我们证明了一个重要的分离原则:可以在假设信息新鲜的情况下设计最优调度策略,并且独立地,可以通过忽略干扰来进行分组生成速率控制。首次分析了离散时间G/Ber/1队列的峰值和平均AoI,这可能具有独立的研究价值。
Age of information (AoI) is a recently proposed metric for measuring information freshness. AoI measures the time that elapsed since the last received update was generated. We consider the problem of minimizing average and peak AoI in a wireless networks, consisting of a set of source-destination links, under general interference constraints. When fresh information is always available for transmission, we show that a stationary scheduling policy is peak age optimal. We also prove that this policy achieves average age that is within a factor of two of the optimal average age. In the case where fresh information is not always available, and packet/information generation rate has to be controlled along with scheduling links for transmission, we prove an important separation principle: the optimal scheduling policy can be designed assuming fresh information, and independently, the packet generation rate control can be done by ignoring interference. Peak and average AoI for discrete time G/Ber/1 queue is analyzed for the first time, which may be of independent interest.