VCM: the vector-based coloring method for grid wireless ad hoc and sensor networks

Authors:
Cedric Adjih;Ichrak Amdouni;Pascale Minet
Affiliations:
Inria Paris Rocquencourt, Le Chesnay, France;Inria Paris Rocquencourt, Le Chesnay, France;Inria Paris Rocquencourt, Le Chesnay, France
Venue:
Proceedings of the 15th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
Year:
2012

Citing 12
Cited 0

Coloring interval graphs with First-Fit

Discrete Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Grid Coverage for Surveillance and Target Location in Distributed Sensor Networks

IEEE Transactions on Computers
Conflict-Free Colorings of Simple Geometric Regions with Applications to Frequency Assignment in Cellular Networks

SIAM Journal on Computing
Energy-efficient collision-free medium access control for wireless sensor networks

Proceedings of the 1st international conference on Embedded networked sensor systems
Z-MAC: a hybrid MAC for wireless sensor networks

Proceedings of the 3rd international conference on Embedded networked sensor systems
A tight bound for online colouring of disk graphs

Theoretical Computer Science
FlexiTP: A Flexible-Schedule-Based TDMA Protocol for Fault-Tolerant and Energy-Efficient Wireless Sensor Networks

IEEE Transactions on Parallel and Distributed Systems
Wireless sensor network deployment for water use efficiency in irrigation

Proceedings of the workshop on Real-world wireless sensor networks
Coloring unstructured wireless multi-hop networks

Proceedings of the 28th ACM symposium on Principles of distributed computing
TDMA-ASAP: Sensor Network TDMA Scheduling with Adaptive Slot-Stealing and Parallelism

ICDCS '09 Proceedings of the 2009 29th IEEE International Conference on Distributed Computing Systems
Hallway monitoring: distributed data processing with wireless sensor networks

REALWSN'10 Proceedings of the 4th international conference on Real-world wireless sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph coloring is used in wireless ad hoc and sensor networks to optimize network resources: bandwidth and energy. Nodes access the medium according to their color. It is the responsibility of the coloring algorithm to ensure that interfering nodes do not have the same color. In this paper, we focus on wireless ad hoc and sensor networks with grid topologies. How does a coloring algorithm take advantage of the regularity of grid topology to provide an optimal periodic coloring, that is a coloring with the minimum number of colors? We propose the Vector-Based Coloring Method, denoted VCM, a new method that is able to provide an optimal periodic coloring for any radio transmission range and for any h-hop coloring, he1. In h-hop coloring, no nodes that are p-hop away, with 1 d p d h use the same color. This method consists in determining where a color can be reproduced in the grid without creating interferences while minimizing the number of colors used. We compare the number of colors provided by VCM with the number of colors obtained by a distributed coloring algorithm with line and column priority assignments. Finally, we discuss the applicability of this method to a real wireless network.