Self-stabilization in self-organized multihop wireless networks

In large scale multihop wireless networks, flat architectures are not scalable. In order to overcome this major drawback, clusterization is introduced to support self-organization and to enable hierarchical routing. When dealing with multihop wireless networks, the robustness is a main issue due to the dynamicity of such networks. Several algorithms have been designed for the clustering process. As far as we know, very few studies check the robustness feature of their clustering protocols. In this paper, we show that a clustering algorithm, that seems to present good properties of robustness, is self-stabilizing. We propose several enhancements to reduce the stabilization time and to improve stability. The use of a directed acyclic graph ensures that the self-stabilizing properties always hold regardless of the underlying topology. These extra criterion are tested by simulations.