Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks
Distributed Scheduling Algorithms for Optimizing Information Freshness in Wireless Networks
复制标题
DOI：
10.1109/spawc.2018.8445979
复制
发表时间：
2018-03
期刊：
影响因子：
--
通讯作者：
Rajat Talak;S. Karaman;E. Modiano
中科院分区：
文献类型：
--
作者：
Rajat Talak;S. Karaman;E. Modiano
信息年龄（AoI）测量自在源处生成最后一个接收到的信息包以来所经过的时间。本文研究了在时变信道和成对干扰约束条件下，无线网络中单跳流的AoI最小化问题。我们认为简单，但广泛的，类的分布式调度策略，在其中传输尝试在每个链路上有一定的尝试概率。我们得到了一个有趣的最佳尝试概率和最佳的AoI的链接之间的关系，及其相邻的链接。然后，我们表明，最佳的尝试概率可以计算通过解决凸优化问题，这可以做到分布式。
Age of Information (AoI), measures the time elapsed since the last received information packet was generated at the source. We consider the problem of AoI minimization for single-hop flows in a wireless network, under pairwise interference constraints and time varying channel. We consider simple, yet broad, class of distributed scheduling policies, in which a transmission is attempted over each link with a certain attempt probability. We obtain an interesting relation between the optimal attempt probability and the optimal AoI of the link, and its neighboring links. We then show that the optimal attempt probabilities can be computed by solving a convex optimization problem, which can be done distributively.