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.
Type de document :
Communication dans un congrès
Sotiris E. Nikoletseas and José D.P. Rolim. Second International Workshop on Algorithmic Aspects of Wireless Sensor Networks, Jun 2006, Venice, Italy. Springer Berlin / Heidelberg, 4240, pp.83-94, 2006, LNCS. 〈10.1007/11963271_8〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00158857
Contributeur : Colette Johnen <>
Soumis le : vendredi 29 juin 2007 - 20:17:04
Dernière modification le : mardi 24 avril 2018 - 13:51:40

Lien texte intégral

Identifiants

Collections

Citation

Colette Johnen, Le Huy Nguyen. Self-Stabilizing weight-based Clustering Algorithm for Ad hoc sensor Networks. Sotiris E. Nikoletseas and José D.P. Rolim. Second International Workshop on Algorithmic Aspects of Wireless Sensor Networks, Jun 2006, Venice, Italy. Springer Berlin / Heidelberg, 4240, pp.83-94, 2006, LNCS. 〈10.1007/11963271_8〉. 〈inria-00158857〉

Partager

Métriques

Consultations de la notice

45