Towards Desynchronization of Multi-hop Topologies

In this paper we study desynchronization, a closelyrelated primitive to graph coloring. A valid graph coloring is an assignment of colors to nodes such that no node’s color is the same as a neighbor’s. A desynchronized configuration is an assignment of real values in S1 to nodes such that each node’s value is exactly at the midpoint of two of its closest neighbors’ values. Recent work has shown that a simple, self-organizing algorithm, DESYNC, can solve desynchronization in single-hop networks, with applications to collision-free wireless broadcast [1] and duty-cycling [2]. Here we generalize this work by defining and analyzing desynchronization for multi-hop networks and experimentally analyzing the DESYNC algorithm’s behavior for multi-hop networks. We describe desynchronized configurations for several classes of graphs (lines, rings, two-colorable, and hamiltonian cycles) and discuss the relationship with other variants of graph coloring. We extend the DESYNC algorithm...

• Type: Conference
• Year: 2008
• Where: SASO
• Authors: Julius Degesys, Radhika Nagpal
• Keywords: Graph Coloring, Multi-hop Networks, SASO 2008, Self-organizing Algorithm, Self-Organizing Systems