A dynamic clustering construction for wireless sensor networks - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

A dynamic clustering construction for wireless sensor networks

Résumé

Research in sensor networks has focused on development of energy efficient and secure infrastructures. In this article, we introduce a new approach to organize sensor networks in clusters in order to reduce energy dissipation. Our contribution is an heuristic to define the number of clusters and also an efficient manner to choose cluster heads by minimizing the distance between the cluster heads and its cluster nodes. Inspired from LEACH, a well-known TDMA cluster-based sensor network architecture, we introduce a new method for building and maintaining clusters using the paradigm of a soccer team. In this work, a new algorithm called OH-Kmeans, based on the Kmeans algorithm, is used to find dynamically the number of clusters and form them guaranteeing direct transmission between the cluster heads and cluster nodes.
Fichier principal
Vignette du fichier
pccmgf09_ip.pdf (437.88 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00563304 , version 1 (04-02-2011)

Identifiants

  • HAL Id : hal-00563304 , version 1

Citer

Pamba Capo-Chichi Eugène, David Martins, Hervé Guyennet, Violeta Felea. A dynamic clustering construction for wireless sensor networks. CTS'09, int. symposium on Collaborative Technologies and Systems, 2009, United States. pp.565--570. ⟨hal-00563304⟩
32 Consultations
257 Téléchargements

Partager

Gmail Facebook X LinkedIn More