Fundamental bounds on the age of information in multi-hop global status update networks
Fundamental bounds on the age of information in multi-hop global status update networks
复制标题
DOI：
10.1109/jcn.2019.000038
复制
发表时间：
2019-06
影响因子：
3.6
通讯作者：
S. Farazi;A. G. Klein;D. Brown
中科院分区：
文献类型：
--
作者：
S. Farazi;A. G. Klein;D. Brown
本文研究了一般多源多跳无线网络中的"信息时代"问题。具体来说，本文考虑的情况下，假设网络中的每个节点都是一个源和一个监视器的信息，所有的节点都希望从网络中的所有其他节点接收新鲜的状态更新，只有一个节点可以在每个时隙发送。信息的峰值和平均年龄的下限推导和表示的基本图形属性，包括连接控制数。一个算法来产生近最优的周期性状态更新计划的基础上顺序最优洪泛。分析表明，这些时间表完全达到了峰值年龄范围，也实现了平均年龄范围内的一个添加剂的差距缩放线性网络的大小。此外，结果是足够的一般适用于任何连接的网络拓扑结构。说明性的数值例子，用于验证分析的几个典型的网络拓扑结构的任意大小，以及每个连接的网络与9个或更少的节点。
This paper studies the "age of information" in a general multi-source multi-hop wireless network with explicit channel contention. Specifically, the scenario considered in this paper assumes that each node in the network is both a source and a monitor of information, that all nodes wish to receive fresh status updates from all other nodes in the network, and that only one node can transmit in each time slot. Lower bounds for peak and average age of information are derived and expressed in terms of fundamental graph properties including the connected domination number. An algorithm to generate near-optimal periodic status update schedules based on sequential optimal flooding is also developed. These schedules are analytically shown to exactly achieve the peak age bound and also achieve the average age bound within an additive gap scaling linearly with the size of the network. Moreover, the results are sufficiently general to apply to any connected network topology. Illustrative numerical examples are presented which serve to verify the analysis for several canonical network topologies of arbitrary size, as well as every connected network with nine or fewer nodes.