Date Added: Oct 2011
Graph coloring is used in wireless 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, the authors focus on wireless sensor networks with grid topologies. This method consists in determining at which grid nodes a color can be reproduced without creating interferences between these nodes while minimizing the number of colors used. They 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.