arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.16285cs.ITcs.NIcs.SYeess.SPeess.SYmath.IT
收藏

具有源多视图的网络中的Gossip Age

Age of Gossip in Networks with Multiple Views of a Source

Kian J. Khojastepour, Matin Mortaheb, Sennur Ulukus

AI总结:

研究多源视图网络中的版本信息年龄,推导平均版本AoI递归表达式及多种拓扑的渐近行为,证明分布式感知在拆分速率下不损失性能,且环网仅需O(√n)感知节点即可实现O(√n)渐近性能。

摘要:

我们考虑网络中的版本信息年龄(AoI),其中一部分节点作为感知节点,对通常服从连续分布的源进行采样。源的任何样本都构成信息的新版本,信息的版本年龄是相对于整个网络可用的最新信息版本定义的。我们推导了不同节点子集之间平均版本AoI的递归表达式,该表达式可用于评估包括任何单个节点在内的任何节点子集的平均版本AoI。我们推导了各种拓扑结构(包括线型、环型和全连接网络)下网络中任何单个节点的平均AoI的渐近行为。Yates [ISIT'21] 关于网络版本年龄的现有技术结果可以在我们的推导中解释为具有源的单视图网络,例如,通过速率为 $λ_{00}$ 的 Poisson 过程。我们的结果表明,通过拆分相同的速率 $λ_{00}$,用跨多个节点的分布式感知替换源的单视图,在平均版本AoI性能上没有损失。特别是,我们表明,渐近地,全连接和环型网络的平均AoI分别以 $O(\log(n))$ 和 $O(\sqrt{n})$ 的规模增长。更有趣的是,我们表明,对于环型网络,如果感知节点的数量仅以 $O(\sqrt{n})$ 的规模增长,而不是先前已知要求 $O(n)$ 的结果,分布式感知仍然可以实现相同的 $O(\sqrt{n})$ 平均AoI渐近性能。我们的结果表明,只要最大连续非感知节点数也以 $O(\sqrt{n})$ 的规模增长,感知节点就可以任意选择。

英文摘要:

We consider the version age of information (AoI) in a network where a subset of nodes act as sensing nodes, sampling a source that in general can follow a continuous distribution. Any sample of the source constitutes a new version of the information and the version age of the information is defined with respect to the most recent version of the information available for the whole network. We derive a recursive expression for the average version AoI between different subsets of the nodes which can be used to evaluate the average version AoI for any subset of the nodes including any single node. We derive asymptotic behavior of the average AoI on any single node of the network for various topologies including line, ring, and fully connected networks. The prior art result on version age of a network by Yates [ISIT'21] can be interpreted as in our derivation as a network with a single view of the source, e.g., through a Poisson process with rate $λ_{00}$. Our result indicates that there is no loss in the average version AoI performance by replacing a single view of the source with distributed sensing across multiple nodes by splitting the same rate $λ_{00}$. Particularly, we show that asymptotically, the average AoI scales with $O(\log(n))$ and $O(\sqrt{n})$ for fully connected and ring networks, respectively. More interestingly, we show that for the ring network the same $O(\sqrt{n})$ asymptotical performance on average AoI is still achieved with distributed sensing if the number of sensing nodes only scales with $O(\sqrt{n})$ instead of prior known result which requires $O(n)$. Our results indicate that the sensing nodes can be arbitrarily chosen as long as the maximum number of consecutive non-sensing nodes also scales as $O(\sqrt{n})$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑