Skip to Main content Skip to Navigation

A Self-Stabilizing K-Clustering Algorithm Using an Arbitrary Metric

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.
Complete list of metadata

Cited literature [50 references]  Display  Hide  Download
Contributor : Benjamin Depardon Connect in order to contact the contributor
Submitted on : Thursday, December 10, 2009 - 9:56:53 AM
Last modification on : Saturday, September 11, 2021 - 3:17:04 AM


  • HAL Id : inria-00440276, version 1



Eddy Caron, Ajoy Datta, Benjamin Depardon, Lawrence Larmore. A Self-Stabilizing K-Clustering Algorithm Using an Arbitrary Metric. [Research Report] RR-7146, LIP RR-2008-31, INRIA, LIP. 2009, pp.41. ⟨inria-00440276⟩



Record views


Files downloads