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

存在淹没的未知拓扑网络中的广播

Broadcasting in Networks of Unknown Topology in the Presence of Swamping

Evangelos Kranakis, Michel Paquette

摘要:

在本文中,我们解决了一个新的通信模型下的无线网络中的广播问题:{ \em swamping}通信模型。在该模型中,节点仅与几何距离大于$s$且至多为$r$的那些节点通信。在该模型下,附近节点之间的通信可能非常耗时,因为在距离$s$内的两个节点之间的路径的长度在许多情况下仅由直径$D$限制。对于$n$节点格形网络,我们给出了最优时间复杂度的算法,分别是格线的$O(n/r + r/(r-s))$和二维格的$O(\sqrt{n}/r + r/(r-s))$。我们还考虑直径$D$和参数$g$({ \em粒度})的未知拓扑的网络。更具体地说,我们认为网络与$γ$之间的任何两个节点和$g = 1/γ$的最小距离。我们提出了网络的节点放置在线路上和平面上的广播算法,各自的时间复杂度$O(D/l + g^2)$和$O(Dg/l + g^4)$,其中$l \in Θ(\max\{(1-s),γ\})$。

英文摘要:

In this paper, we address the problem of broadcasting in a wireless network under a novel communication model: the {\em swamping} communication model. In this model, nodes communicate only with those nodes at geometric distance greater than $s$ and at most $r$ from them. Communication between nearby nodes under this model can be very time consuming, as the length of the path between two nodes within distance $s$ is only bounded above by the diameter $D$, in many cases. For the $n$-node lattice networks, we present algorithms of optimal time complexity, respectively $O(n/r + r/(r-s))$ for the lattice line and $O(\sqrt{n}/r + r/(r-s))$ for the two-dimensional lattice. We also consider networks of unknown topology of diameter $D$ and of a parameter $g$ ({\em granularity}). More specifically, we consider networks with $γ$ the minimum distance between any two nodes and $g = 1/γ$. We present broadcast algorithms for networks of nodes placed on the line and on the plane with respective time complexities $O(D/l + g^2)$ and $O(Dg/l + g^4)$, where $l \in Θ(\max\{(1-s),γ\})$.

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

↑