arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.2387cs.NIcs.DC
收藏

用于多消息通信的无线电网络的快速构造

Fast Structuring of Radio Networks for Multi-Message Communications

Mohsen Ghaffari, Bernhard Haeupler

摘要:

我们引入无冲突分层结构作为一种强大的方式来构建无线电网络。这些分层结构可以在许多情况下取代难以计算的BFS树,同时具有高效的随机分布式结构。我们证明了他们的多功能性,使用它们来提供几个多消息通信原语接近最佳的分布式算法。为无线电网络设计有效的通信原语有着丰富的历史,始于25年前,当时Bar-Yehuda等人引入了用于广播和构建BFS树的快速随机算法。他们的BFS树构建时间是$O(D \log^2 n)$轮,其中$D$是网络直径,$n$是节点数。从那时起,广播的复杂性被解决为$T_{BC} = Θ(D \log \frac{n}{D} + \log^2 n)$轮。另一方面,BFS树已被用作许多通信原语的关键构建块,它们的构建时间仍然是这些原语的瓶颈。我们引入无冲突的layerworks,可以用来代替BFS树,我们给这些layerworks,在近广播时间运行的随机结构,即w. h. p.在$T_{Lay} = O(D \log \frac{n}{D} + \log^{2+ε} n)$轮任何常数$ε>0$。然后,我们使用这些分层结构,以获得:(1)一个随机算法收集$k$消息运行w. h. p.在$O(T_{Lay} + k)$轮。(2)一种随机$k$ -消息广播算法,在$O(T_{Lay} + k \log n)$轮中运行w. h. p.。这些算法在$T_{BC}$和$T_{Lay}$之间的加性多对数项差很小的情况下是最优的。此外,它们还隐含着第一个最优的$O(n \log n)$轮随机流言算法.

英文摘要:

We introduce collision free layerings as a powerful way to structure radio networks. These layerings can replace hard-to-compute BFS-trees in many contexts while having an efficient randomized distributed construction. We demonstrate their versatility by using them to provide near optimal distributed algorithms for several multi-message communication primitives. Designing efficient communication primitives for radio networks has a rich history that began 25 years ago when Bar-Yehuda et al. introduced fast randomized algorithms for broadcasting and for constructing BFS-trees. Their BFS-tree construction time was $O(D \log^2 n)$ rounds, where $D$ is the network diameter and $n$ is the number of nodes. Since then, the complexity of a broadcast has been resolved to be $T_{BC} = Θ(D \log \frac{n}{D} + \log^2 n)$ rounds. On the other hand, BFS-trees have been used as a crucial building block for many communication primitives and their construction time remained a bottleneck for these primitives. We introduce collision free layerings that can be used in place of BFS-trees and we give a randomized construction of these layerings that runs in nearly broadcast time, that is, w.h.p. in $T_{Lay} = O(D \log \frac{n}{D} + \log^{2+ε} n)$ rounds for any constant $ε>0$. We then use these layerings to obtain: (1) A randomized algorithm for gathering $k$ messages running w.h.p. in $O(T_{Lay} + k)$ rounds. (2) A randomized $k$-message broadcast algorithm running w.h.p. in $O(T_{Lay} + k \log n)$ rounds. These algorithms are optimal up to the small difference in the additive poly-logarithmic term between $T_{BC}$ and $T_{Lay}$. Moreover, they imply the first optimal $O(n \log n)$ round randomized gossip algorithm.

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

↑