Bounds on the Age of Information for Global Channel State Dissemination in Fully-Connected Networks
Bounds on the Age of Information for Global Channel State Dissemination in Fully-Connected Networks
复制标题
全连接网络中全球通道状态传播的信息时代界限
DOI：
10.1109/icccn.2017.8038426
复制
发表时间：
2017
期刊：
影响因子：
--
通讯作者：
D. Brown
中科院分区：
文献类型：
--
作者：
S. Farazi;A. G. Klein;D. Brown
本文研究了具有时变互易信道和分组传输的全连接无线网络中的“信息时代”问题。具体来说，考虑了网络中每个节点都希望维护全局信道状态信息（CSI）表的情况。每个节点以两种方式更新其全局CSI表：（i）通过标准信道估计技术进行直接信道测量，以及（ii）通过来自网络中其他节点的CSI传播来间接观察信道。信息老化，即CSI过时，本文通过允许在每个数据包中传播任意数量的 CSI 估计，得出了任何协议的最大和平均 CSI 陈旧性的新下限。边界并根据各种网络参数量化 CSI 陈旧性。
This paper studies an ``age of information" problem in fully-connected wireless networks with time-varying reciprocal channels and packetized transmissions. Specifically, a scenario where each node in the network wishes to maintain a table of global channel state information (CSI) is considered. Each node updates its global CSI table in two ways: (i) direct channel measurements through standard channel estimation techniques and (ii) indirect observations of channels through CSI dissemination from other nodes in the network. Information aging, i.e., CSI staleness, occurs due to timeslotting and contention for the common channel resources. This paper derives new lower bounds for the maximum and average CSI staleness of any protocol. These bounds generalize previously developed bounds by allowing for any number of CSI estimates to be disseminated in each packet. A simple one-step greedy protocol is also proposed for any network size and any number of CSI estimates disseminated per packet. Numerical results are provided to demonstrate the achieved staleness of the greedy protocol with respect to the bounds and to also quantify CSI staleness in terms of various network parameters.