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

无线网络中的节点着色:复杂性结果和网格着色

Node Coloring in Wireless Networks: Complexity Results and Grid Coloring

Ichrak Amdouni, Pascale Minet, Cédric Adjih

摘要:

着色在无线网络中用于提高通信效率,主要是在带宽、能量和可能的端到端延迟方面。本文定义了h跳节点着色问题,h为任意正整数,适用于无线网络中的两类应用。我们对一般的应用给出了一般模式,对数据收集应用给出了策略模式,并证明了相关的决策问题是NP-完全的。然后,我们专注于网格拓扑结构,构成大型或密集的无线网络的常规拓扑结构。我们考虑不同的传输范围,并确定一个颜色模式,可以复制到颜色的最佳数量的整个网格。我们得到一个最佳的周期性着色的网格所考虑的传输范围。然后,我们提出了一个3跳分布式着色算法,称为SERENA。通过模拟结果,我们强调了节点优先级分配对任何网络和网格获得的颜色数量的影响。然后,我们比较这些最佳结果的网格与SERENA获得的,并确定方向,以改善SERENA。

英文摘要:

Coloring is used in wireless networks to improve communication efficiency, mainly in terms of bandwidth, energy and possibly end-to-end delays. In this paper, we define the h-hop node coloring problem, with h any positive integer, adapted to two types of applications in wireless networks. We specify both general mode for general applications and strategic mode for data gathering applications.We prove that the associated decision problem is NP-complete. We then focus on grid topologies that constitute regular topologies for large or dense wireless networks. We consider various transmission ranges and identify a color pattern that can be reproduced to color the whole grid with the optimal number of colors. We obtain an optimal periodic coloring of the grid for the considered transmission range. We then present a 3-hop distributed coloring algorithm, called SERENA. Through simulation results, we highlight the impact of node priority assignment on the number of colors obtained for any network and grids in particular. We then compare these optimal results on grids with those obtained by SERENA and identify directions to improve SERENA.

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

↑