arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1805.04842cs.DC
收藏

没有网络知识的随机通信

Randomized Communication Without Network Knowledge

Artur Czumaj, Peter Davies

摘要:

无线电网络是一个长期研究的模型,用于无线通信的设备的分布式系统。当这些设备是移动的或具有有限的能力时,系统通常最好由ad-hoc变体建模,其中设备不知道网络的结构。大量的工作一直致力于设计算法的ad-hoc模型,特别是基本的通信任务,如广播。然而,这些算法中的大多数假设设备具有一些网络知识(通常是网络中的节点数量$n$和直径$D$的界限),这在具有弱设备或逐步部署的系统中可能并不总是现实的。如果没有这方面的信息,人们对可以做些什么知之甚少。这是我们在这项工作中解决的问题,提出了第一个\emph{randomized}广播算法的\emph{blind}网络中的节点没有任何先验知识。我们证明,参数知识的缺乏,可以克服在运行时间只有一个小的增加。具体来说,我们表明,在没有冲突检测的网络中,广播可以实现在$O(D\log\frac nD\log^2\log\frac nD + \log^2 n)$的时间,几乎达到了$Ω(D\log\frac nD + \log^2 n)$下限。我们还给出了一个具有碰撞检测的有向网络的算法,它只需要$O(D\log\frac nD\log\log\log\frac nD + \log^2 n)$时间。

英文摘要:

Radio networks are a long-studied model for distributed system of devices which communicate wirelessly. When these devices are mobile or have limited capabilities, the system is often best modeled by the ad-hoc variant, in which the devices do not know the structure of the network. A large body of work has been devoted to designing algorithms for the ad-hoc model, particularly for fundamental communications tasks such as broadcasting. Most of these algorithms, however, assume that devices have some network knowledge (usually bounds on the number of nodes in the network $n$, and the diameter $D$), which may not always be realistic in systems with weak devices or gradual deployment. Very little is known about what can be done when this information is not available. This is the issue we address in this work, by presenting the first \emph{randomized} broadcasting algorithms for \emph{blind} networks in which nodes have no prior knowledge whatsoever. We demonstrate that lack of parameter knowledge can be overcome at only a small increase in running time. Specifically, we show that in networks without collision detection, broadcast can be achieved in $O(D\log\frac nD\log^2\log\frac nD + \log^2 n)$ time, almost reaching the $Ω(D\log\frac nD + \log^2 n)$ lower bound. We also give an algorithm for directed networks with collision detection, which requires only $O(D\log\frac nD\log\log\log\frac nD + \log^2 n)$ time.

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

↑