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

具有抽象MAC层和不可靠链路的多消息广播

Multi-Message Broadcast with Abstract MAC Layers and Unreliable Links

Mohsen Ghaffari, Erez Kantor, Nancy Lynch, Calvin Newport

摘要:

我们研究了多消息广播问题,使用抽象的MAC层模型的无线网络。这些模型捕获了现有MAC层的关键保证,同时抽象出信号传播和争用等低级细节。我们开始研究这个问题的上限和下限在一个{ \em标准抽象MAC层模型}-确定一个有趣的依赖关系之间的结构不可靠的链接和可实现的时间复杂度。更详细地说,给定由不可靠链路直接连接的设备在可靠链路拓扑中彼此不太远的限制,我们可以(几乎)匹配可靠情况的效率。然而,对于相关的限制,即两个设备连接的不可靠的链接是不是太远,从彼此的地理距离,我们证明了一个新的下界,表明这种效率是不可能的。然后,我们研究必须向模型中添加多少额外的功率才能使效率达到新的数量级。更详细地说,我们考虑了{ \em增强抽象MAC层模型},并提出了一种新的多消息广播算法,(在某些自然的假设下)解决了这个问题,在这个模型中的速度比任何已知的解决方案,在一个抽象的MAC层设置。

英文摘要:

We study the multi-message broadcast problem using abstract MAC layer models of wireless networks. These models capture the key guarantees of existing MAC layers while abstracting away low-level details such as signal propagation and contention. We begin by studying upper and lower bounds for this problem in a {\em standard abstract MAC layer model}---identifying an interesting dependence between the structure of unreliable links and achievable time complexity. In more detail, given a restriction that devices connected directly by an unreliable link are not too far from each other in the reliable link topology, we can (almost) match the efficiency of the reliable case. For the related restriction, however, that two devices connected by an unreliable link are not too far from each other in geographic distance, we prove a new lower bound that shows that this efficiency is impossible. We then investigate how much extra power must be added to the model to enable a new order of magnitude of efficiency. In more detail, we consider an {\em enhanced abstract MAC layer model} and present a new multi-message broadcast algorithm that (under certain natural assumptions) solves the problem in this model faster than any known solutions in an abstract MAC layer setting.

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

↑