HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Self-Stabilizing weight-based Clustering Algorithm for Ad hoc sensor Networks

Abstract : Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a fixed infrastructure. Fast self-reconfiguration and power efficiency are very important property on any sensor network management. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. Clustering increase the scalability and the energy efficiency of communication among the sensors. A self-stabilizing algorithm, regardless of the initial system state, converges to a set of states that satisfy the problem specification without external intervention. Due to this property, self-stabilizing algorithms are adapted highly dynamic networks. In this paper we present a Self-stabilizing Clustering Algorithm for Ad hoc sensor network. Our algorithm adapts faster than other algorithms to topology changes.
Complete list of metadata

Contributor : Colette Johnen Connect in order to contact the contributor
Submitted on : Friday, June 29, 2007 - 8:17:04 PM
Last modification on : Thursday, July 8, 2021 - 3:47:42 AM

Links full text



Colette Johnen, Le Huy Nguyen. Self-Stabilizing weight-based Clustering Algorithm for Ad hoc sensor Networks. Second International Workshop on Algorithmic Aspects of Wireless Sensor Networks, Jun 2006, Venice, Italy. pp.83-94, ⟨10.1007/11963271_8⟩. ⟨inria-00158857⟩



Record views