Node coloring for dense wireless sensor networks

Details Node coloring for dense wireless sensor networks Node coloring for dense wireless sensor networks

2011-04-11

arxiv.org/abs/1104.1859v1

Computer Science

Networking and Internet Architecture

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Node coloring for dense wireless sensor networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Node coloring for dense wireless sensor networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Node coloring for dense wireless sensor networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-58169