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

SINR网络模型的本地广播层

A Local Broadcast Layer for the SINR Network Model

Magnus M. Halldorsson, Stephan Holzer, Nancy Lynch

摘要:

我们提出了第一个算法,实现了一个抽象的MAC(absMAC)层的信号干扰噪声比(SINR)的无线网络模型。我们首先证明,有效的SINR实现是不可能的标准absMAC规范。我们将该规范修改为更适合SINR模型的“近似”版本。我们给出了一个有效的算法来实现修改后的规范,并使用它来获得高层次的全局广播和共识问题的有效算法。特别是,我们表明,absMAC的进展属性没有有效的实施的SINR强连接图$G_{1-ε}$,其中包含边缘节点之间的距离最多$(1-ε)$倍的传输范围,其中$ε>0$是一个小常数,可以由用户选择。这个progress属性限制了一个节点在至少有一个邻居正在发送消息时保证接收到某个消息的时间。为了克服这个限制,我们引入了稍微弱的概念,近似进展到absMAC规范。我们提供了一个快速实现的修改后的规范,分解成本地和全球部分的已知算法的基础上。我们分析我们的算法的局部参数,如节点度,而不是全局参数,如节点的总数。一个关键的贡献是,我们证明,这样的本地分析是可能的,即使在全球干扰的存在。我们的absMAC算法导致几个新的,有效的算法解决更高层次的问题,在SINR模型。也就是说,通过将我们的算法与已知的高级算法相结合,我们得到了一个改进的算法,全局单消息广播的SINR模型中,和第一个有效的算法,该模型中的多消息广播。

英文摘要:

We present the first algorithm that implements an abstract MAC (absMAC) layer in the Signal-to-Interference-plus-Noise-Ratio (SINR) wireless network model. We first prove that efficient SINR implementations are not possible for the standard absMAC specification. We modify that specification to an "approximate" version that better suits the SINR model. We give an efficient algorithm to implement the modified specification, and use it to derive efficient algorithms for higher-level problems of global broadcast and consensus. In particular, we show that the absMAC progress property has no efficient implementation in terms of the SINR strong connectivity graph $G_{1-ε}$, which contains edges between nodes of distance at most $(1-ε)$ times the transmission range, where $ε>0$ is a small constant that can be chosen by the user. This progress property bounds the time until a node is guaranteed to receive some message when at least one of its neighbors is transmitting. To overcome this limitation, we introduce the slightly weaker notion of approximate progress into the absMAC specification. We provide a fast implementation of the modified specification, based on decomposing a known algorithm into local and global parts. We analyze our algorithm in terms of local parameters such as node degrees, rather than global parameters such as the overall number of nodes. A key contribution is our demonstration that such a local analysis is possible even in the presence of global interference. Our absMAC algorithm leads to several new, efficient algorithms for solving higher-level problems in the SINR model. Namely, by combining our algorithm with known high-level algorithms, we obtain an improved algorithm for global single-message broadcast in the SINR model, and the first efficient algorithm for multi-message broadcast in that model.

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

↑