论文标题
在空间分布的随机访问无线网络中最小化信息的年龄
Minimizing Age of Information in Spatially Distributed Random Access Wireless Networks
论文作者
论文摘要
我们在无线网络中分析了信息年龄（AOI），在该网络中，节点使用空间自适应随机访问方案将状态更新发送到中央基础站。我们表明，在此设置中，可实现的AOI集是凸，并且设计策略以最大程度地减少加权总和，最小值和按比例公平的AOI，通过将传输概率设置为节点位置的函数。我们表明，在捕获模型下，当考虑网络的空间拓扑结构时，可以显着改善AOI，并且在加权总和和最小值aOI上获得了紧密的性能界限。最后，我们设计了一个策略，每个节点仅根据其自身距离基站的距离设置其传输概率，而当它不知道其他节点的位置时，并表明它会收敛到最佳的按比例公平的公平策略，因为网络的大小转移到了无穷大。
We analyze Age of Information (AoI) in wireless networks where nodes use a spatially adaptive random access scheme to send status updates to a central base station. We show that the set of achievable AoI in this setting is convex, and design policies to minimize weighted sum, min-max, and proportionally fair AoI by setting transmission probabilities as a function of node locations. We show that under the capture model, when the spatial topology of the network is considered, AoI can be significantly improved, and we obtain tight performance bounds on weighted sum and min-max AoI. Finally, we design a policy where each node sets its transmission probability based only on its own distance from the base station, when it does not know the positions of other nodes, and show that it converges to the optimal proportionally fair policy as the size of the network goes to infinity.
