Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks

Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-reconguration and power eciency 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 eciency 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 specication 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.

• Type: Conference
• Year: 2006
• Where: ALGOSENSORS
• Authors: Colette Johnen, Le Huy Nguyen
• Keywords: Ad Hoc Sensor, ALGOSENSORS 2006, Hoc Sensor Network, Sensor Network, Sensor Networks