A Self-Stabilizing K-Clustering Algorithm Using an Arbitrary Metric (Revised Version of RR2008-31)

Abstract : Mobile ad hoc networks as well as grid platforms are distributed, changing, and error prone environments. Communication costs within such infrastructure can be improved, or at least bounded, by using k-clustering. A k-clustering of a graph, is a partition of the nodes into disjoint sets, called clusters, in which every node is distance at most k from a designated node in its cluster, called the clusterhead. A self-stabilizing asynchronous distributed algorithm is given for constructing a k-clustering of a connected network of processes with unique IDs and weighted edges. The algorithm is comparison-based, takes O(nk) time, and uses O(log n + log k) space per process, where n is the size of the network. This is the first distributed solution to the k-clustering problem on weighted graphs.
Type de document :
Pré-publication, Document de travail
RRLIP2009-33. 32 pages. 2009
Liste complète des métadonnées

Littérature citée [18 références]  Voir  Masquer  Télécharger

Contributeur : Benjamin Depardon <>
Soumis le : jeudi 10 décembre 2009 - 09:59:01
Dernière modification le : mardi 24 avril 2018 - 13:52:32
Document(s) archivé(s) le : jeudi 18 octobre 2012 - 10:35:38


Fichiers produits par l'(les) auteur(s)


  • HAL Id : ensl-00440266, version 1



Eddy Caron, Ajoy Datta, Benjamin Depardon, Lawrence Larmore. A Self-Stabilizing K-Clustering Algorithm Using an Arbitrary Metric (Revised Version of RR2008-31). RRLIP2009-33. 32 pages. 2009. 〈ensl-00440266〉



Consultations de la notice


Téléchargements de fichiers