Self-Stabilization in Self-Organized Multihop Wireless Networks

Abstract

In large scale multihop wireless networks, flat architectures are not scalable. In order to overcome this major drawback, clusterization is introduced to support selforganization 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 clusterization process. As far as we know, very few studies check the robustness feature of their clusterization protocols. Moreover, when it is the case, the evaluation is driven by simulations and never by a theoretical approach.In this paper, we show that a clusterization 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 selfstabilizing properties always hold regardless of the underlying topology. These extra criterion are tested by simulations.

Multiple point of interest discovery and coverage with mobile wireless sensors

“…WSN have received a lot of attention over the last decade above all in improving the deployment quality [14,25], self-organization [11,31], energy efficiency [19], communication aspects [34,35], and the overall reliability and security [7]. A typical application of WSN is environmental monitoring.…”

Ascending Runs in Dependent Uniformly Distributed Random Variables: Application to Wireless Networks

“…having two nodes at distance d or less assigned a distinct color) can be enough to solve a wide range of problems. For example, local coloring at distance 3 can be used to assign TDMA time slots in an adaptive manner [7], and local coloring at distance 2 has successively been used to self-organize a wireless network into more manageable clusters [12].…”

“…In [11], the stabilization time of the coloring protocol was theoretically analyzed while the stabilization time of a particular client protocol (the clustering scheme of [12]) was only studied by simulation. The analysis performed in this paper gives a theoretical upper bound on the stabilization time of all client protocols that use a coloring scheme as an underlying basis.…”

Distributed Node Location in Clustered Multi-hop Wireless Networks

“…Only basis and features which lead our motivations or which are relevant for localization and routing are evoked here. For more details or other characteristics of our clustering heuristic, please refer to [19,20,22].…”

“…Age(v)++ and ∀w ∈ Γ1(u) Age(w) = 0. end Locally broadcast P(u) and H(u) end As proved in [22], at the end of three message exchange rounds, each node is aware of its parent in the tree, at the end of four message rounds, it knows the parent of each of its neighbors and thus is able to determine whether one of them has elected it as parent and thus learns its condition in the tree (root, leaf, regular node). A node is a leaf if no other node has chosen it as its parent; a node is a cluster-head if it has chosen itself as parent and all its 1-neighbors have joined it; a node is a regular node otherwise.…”