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

密集无线传感器网络节点着色算法

Node coloring for dense wireless sensor networks

Ichrak Amdouni, Pascale Minet, Cédric Adjih

摘要:

着色在无线网络中用于提高通信效率,主要是在带宽、能量和可能的端到端延迟方面。在这篇研究报告中,我们定义了h-hop节点着色问题,其中h为任意正整数。我们证明了相关的决策问题是NP-完全的。然后,我们提出了一个3跳的分布式着色算法,是密集的网络优化:一个节点不需要交换其2跳邻居的优先级和颜色。通过模拟结果,我们强调了优先级分配对任何网络获得的颜色数量的影响。然后,我们专注于网格,并确定一个颜色模式,可以复制到整个网格的颜色。我们展示了着色算法如何使用正则性来获得具有最佳颜色数量的周期性颜色图案。然后,我们考虑网格与孔,并研究如何扩展我们的结果。

英文摘要:

Coloring is used in wireless networks to improve communication efficiency, mainly in terms of bandwidth, energy and possibly end-to-end delays. In this research report, we define the h-hop node coloring problem, with h any positive integer. We prove that the associated decision problem is NP-complete. We then present a 3-hop distributed coloring algorithm that is optimized for dense networks: a node does not need to exchange the priorities and colors of its 2-hop neighbors. Through simulation results, we highlight the impact of priority assignment on the number of colors obtained for any network. We then focus on grids and identify a color pattern that can be reproduced to color the whole grid. We show how the coloring algorithm can use regularity properties to obtain a periodic color pattern with the optimal number of colors. We then consider grids with holes and study how to extend our results.

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

↑