分层合作的大型网络中的信息扩展时代
Age of Information Scaling in Large Networks with Hierarchical Cooperation
摘要：
给定$n$随机定位的源-目的地（S-D）对在一个固定的区域网络上，希望彼此通信，我们研究的年龄的信息，特别关注其缩放网络大小$n$的增长。我们提出了一个三阶段的传输方案，利用\textit{hierarchical cooperation}与\textit{mega update packets}用户之间的平均年龄缩放的$O(n^{α(h)}\log n)$每个用户是可以实现的，其中$h$表示的层次和$α(h) = \frac{1}{3\cdot2^h+1}$的数量往往$0$作为$h$增加，使渐近平均年龄缩放的建议计划是$O(\log n)$。据我们所知，这是具有多个S-D对的状态更新系统中的最佳平均年龄缩放结果。
英文摘要：
Given $n$ randomly located source-destination (S-D) pairs on a fixed area network that want to communicate with each other, we study the age of information with a particular focus on its scaling as the network size $n$ grows. We propose a three-phase transmission scheme that utilizes \textit{hierarchical cooperation} between users along with \textit{mega update packets} and show that an average age scaling of $O(n^{α(h)}\log n)$ per-user is achievable where $h$ denotes the number of hierarchy levels and $α(h) = \frac{1}{3\cdot2^h+1}$ which tends to $0$ as $h$ increases such that asymptotically average age scaling of the proposed scheme is $O(\log n)$. To the best of our knowledge, this is the best average age scaling result in a status update system with multiple S-D pairs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
