On multihop clusters in wireless sensor networks

Alexandre Delye de Clauzade de Mazieux (1, 2, 3) , Michel Marot (4, 1, 2, 3) , Monique Becker (4, 1, 2, 3)

1 TSP - RST - Département Réseaux et Services de Télécommunications
2 SAMOVAR - Services répartis, Architectures, MOdélisation, Validation, Administration des Réseaux
3 CNRS - Centre National de la Recherche Scientifique
4 METHODES-SAMOVAR - Méthodes et modèles pour les réseaux

d-dominating sets in graphs are very important in wireless hierarchical networks. In the first part, the paper simplifies and extends the heuristic proposed in [APVH00] and then proves the correctness of the extended heuristic which forms d-dominating sets. This clusterhead selection process has the advantage of being distributed and scalable. In the second part, the cluster formation process proposed in [APVH00] is extensively studied, by using the analysis mathematical framework developed in the first section. It is proved that the heuristic presented in [APVH00] is not always valid. This is a very important result since the Max-Min d-cluster formation is a well known heuristic and a very interesting one to select clusterheads under a given criterion

Domaines: Réseaux et télécommunications [cs.NI]

Alexandre Delye de Clauzade de Mazieux, Michel Marot, Monique Becker. On multihop clusters in wireless sensor networks. ASN 2008 : Autonomous and Spontaneous Networks Symposium, Nov 2008, Paris, France. pp.1 - 5. ⟨hal-01394357⟩