Robust Self-Stabilizing Clustering Algorithm

Abstract : Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists in partitioning network nodes into groups called clusters, giving a hierarchical organization of the network. A self-stabilizing algorithm, regardless of the initial system configuration, converges to legitimates configurations without external intervention. Due to this property, self-stabilizing algorithms tolerate transient faults. In this paper we present a robust self-stabilizing clustering algorithm for ad hoc network. The robustness property guarantees that, starting from an arbitrary configuration, in one round, network is partitioned into clusters. After that, the network stays partitioned during the convergence phase toward a legitimate configuration where the clusters partition ensures that any neighborhood has at most k clusterheads (k is a given parameter).
Type de document :
Communication dans un congrès
Alexander A. Shvartsman. 10th International Conference Principles of Distributed Systems, Dec 2006, Bordeaux, France. Springer-Verlag New York Inc, 4305, pp.410-424, 2006, LNCS. 〈10.1007/11945529_29〉
Liste complète des métadonnées

https://hal.inria.fr/inria-00158856
Contributeur : Colette Johnen <>
Soumis le : vendredi 29 juin 2007 - 19:44:02
Dernière modification le : mardi 24 avril 2018 - 13:51:40

Identifiants

Collections

Citation

Colette Johnen, Le Huy Nguyen. Robust Self-Stabilizing Clustering Algorithm. Alexander A. Shvartsman. 10th International Conference Principles of Distributed Systems, Dec 2006, Bordeaux, France. Springer-Verlag New York Inc, 4305, pp.410-424, 2006, LNCS. 〈10.1007/11945529_29〉. 〈inria-00158856〉

Partager

Métriques

Consultations de la notice

116