Fast Convergence in Self-stabilizing Wireless Networks. - Archive ouverte HAL Access content directly
Conference Papers Year : 2006

Fast Convergence in Self-stabilizing Wireless Networks.


The advent of large scale multi-hop wireless networks highlights problems of fault tolerance and scale in distributed systems, motivating designs that autonomously recover from transient faults and spontaneous reconfigurations. Self-stabilization provides an elegant solution for recovering from such faults. We present a complexity analysis for a family of self-stabilizing vertex coloring algorithms in the context of multi-hop wireless networks. Such "coloring" processes are used in several protocols for solving many different issues (clustering, synchronizing...). Overall, our results show that the actual stabilization time is much smaller than the upper bound provided by previous studies. Similarly, the height of the induced DAG is much lower than the linear dependency on the size of the color domain (that was previously announced). Finally, it appears that symmetry breaking tricks traditionally used to expedite stabilization are in fact harmful when used in networks that are not tightly synchronized.
Fichier principal
Vignette du fichier
ICPADS06.pdf (212.93 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00383834 , version 1 (13-05-2009)


  • HAL Id : hal-00383834 , version 1


Nathalie Mitton, Eric Fleury, Isabelle Guérin-Lassous, Bruno Sericola, Sébastien Tixeuil. Fast Convergence in Self-stabilizing Wireless Networks.. 12th International Conference on Parallel and Distributed Systems (ICPADS 2006), 12-15 July 2006, Minneapolis, Minnesota, USA, Jul 2006, Mineapolis, United States. pp.31-38. ⟨hal-00383834⟩
782 View
150 Download


Gmail Facebook Twitter LinkedIn More