使用蜂鸣声部署无线网络
Deploying Wireless Networks with Beeps
摘要:
我们提出了\emph{discrete beeping}通信模型,它假设节点有最少的知识,他们的环境和严重有限的通信能力。具体来说,节点没有关于网络的局部或全局结构的信息,无法访问同步时钟,并且被对手唤醒。此外,它们完全依靠载波侦听来交换信息,而不是通过消息进行通信。我们研究的问题,\emph{interval coloring},一个变种的顶点着色特别适合于研究蜂鸣模型。给定一组资源,区间着色的目标是为每个节点分配一大部分连续的资源,使得相邻节点不共享资源。为了强调模型离散性的重要性,我们将其与[17]中描述的连续变量进行了对比。我们提出了一个O(1 $ time algorithm that terminates with probability 1 and assigns an interval of size $ Ω(T/Δ)$ that repeats every $ T $ time units to every node of the network. This improves an $ O(\log n)$ time algorithm with the same guarantees presented in \cite{infocom09}, and accentuates the unrealistic assumptions of the continuous model. Under the more realistic discrete model, we present a Las Vegas algorithm that solves $ Ω(T/Δ)$-interval coloring in $ O(\log n)$ time with high probability and describe how to adapt the algorithm for dynamic networks where nodes may join or leave. For constant degree graphs we prove a lower bound of $ Ω(\log n)$的区间着色所需的时间与随机算法。这个下界意味着我们的算法对于常度图是渐近最优的。
英文摘要:
We present the \emph{discrete beeping} communication model, which assumes nodes have minimal knowledge about their environment and severely limited communication capabilities. Specifically, nodes have no information regarding the local or global structure of the network, don't have access to synchronized clocks and are woken up by an adversary. Moreover, instead on communicating through messages they rely solely on carrier sensing to exchange information. We study the problem of \emph{interval coloring}, a variant of vertex coloring specially suited for the studied beeping model. Given a set of resources, the goal of interval coloring is to assign every node a large contiguous fraction of the resources, such that neighboring nodes share no resources. To highlight the importance of the discreteness of the model, we contrast it against a continuous variant described in [17]. We present an O(1$ time algorithm that terminates with probability 1 and assigns an interval of size $Ω(T/Δ)$ that repeats every $T$ time units to every node of the network. This improves an $O(\log n)$ time algorithm with the same guarantees presented in \cite{infocom09}, and accentuates the unrealistic assumptions of the continuous model. Under the more realistic discrete model, we present a Las Vegas algorithm that solves $Ω(T/Δ)$-interval coloring in $O(\log n)$ time with high probability and describe how to adapt the algorithm for dynamic networks where nodes may join or leave. For constant degree graphs we prove a lower bound of $Ω(\log n)$ on the time required to solve interval coloring for this model against randomized algorithms. This lower bound implies that our algorithm is asymptotically optimal for constant degree graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。