Lightweight Coloring and Desynchronization for Networks

We study the distributed desynchronization problem for graphs with arbitrary topology. Motivated by the severe computational limitations of sensor networks, we present a randomized algorithm for network desynchronization that uses an extremely lightweight model of computation, while being robust to link volatility and node failure. These techniques also provide novel, ultra-lightweight randomized algorithms for quickly computing distributed vertex colorings using an asymp- totically optimal number of colors. I. INTRODUCTION As inherently distributed computational systems, sensor networks rely critically on coordination between nodes to effectively sense, communicate and interpret environmental data. Individual nodes face severe battery and computational limitations, so a notion of coordinated task-sharing and duty- cycling is critical to maintaining the longevity and efficient operation of the network. In this sense, desynchronizing the actions of nodes is desirable. Efficient desynchronization pro- tocols can be applied to a variety of sensor network applica- tions, including periodic resource sharing, coordinated sleep schedules, and evenly shared sensing burden across nearby nodes (3).

[1]  Radhika Nagpal,et al.  Desynchronization: The Theory of Self-Organizing Algorithms for Round-Robin Scheduling , 2007, First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007).

[2]  S.M. Kay,et al.  Digital signal processing for sonar , 1981, Proceedings of the IEEE.

[3]  Thomas Moscibroda,et al.  What Cannot Be Computed Locally , 2004 .

[4]  Nathan Linial,et al.  Locality in Distributed Graph Algorithms , 1992, SIAM J. Comput..

[5]  Kyle Jamieson,et al.  Understanding the real-world performance of carrier sense , 2005, E-WIND '05.

[6]  Uriel Feige,et al.  Zero knowledge and the chromatic number , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[7]  Deborah Estrin,et al.  Statistical model of lossy links in wireless sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[8]  P. Levis,et al.  RSSI is Under Appreciated , 2006 .

[9]  Steven Kay,et al.  Fundamentals Of Statistical Signal Processing , 2001 .

[10]  Leonidas J. Guibas,et al.  Wireless sensor networks - an information processing approach , 2004, The Morgan Kaufmann series in networking.

[11]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[12]  Hagit Attiya,et al.  Distributed Computing: Fundamentals, Simulations and Advanced Topics , 1998 .

[13]  Radhika Nagpal,et al.  DESYNC: Self-Organizing Desynchronization and TDMA on Wireless Sensor Networks , 2007, International Symposium on Information Processing in Sensor Networks.

[14]  Roger Wattenhofer,et al.  On the locality of bounded growth , 2005, PODC '05.

[15]  Roger Wattenhofer,et al.  On the complexity of distributed graph coloring , 2006, PODC '06.

[16]  Philip Levis,et al.  Improving Wireless Simulation Through Noise Modeling , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.