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 asymptotically optimal number of colors.

• Type: Conference
• Year: 2009
• Where: INFOCOM
• Authors: Arik Motskin, Tim Roughgarden, Primoz Skraba, Leonidas J. Guibas
• Keywords: Communications, INFOCOM 2009, Randomized Algorithms, Severe Computational Limitations, Ultra-lightweight Randomized Algorithms