The Community for Technology Leaders
Reliable Distributed Systems, IEEE Symposium on (2009)
Niagara Falls, New York
Sept. 27, 2009 to Sept. 30, 2009
ISSN: 1060-9857
ISBN: 978-0-7695-3826-6
pp: 147-155
Given an arbitrary network $G$ of {\ndes} with unique IDs and no designated leader,and given a $k$-dominating set $I\subseteq G$, we propose a silent self-stabilizing distributed algorithm that computes a subset $D$ of $I$ which is a minimal $k$-dominating set of $G$.Using $D$ as the set of cluster heads, a partition of $G$ into clusters, each of radius $k$, follows.The algorithm is comparison-based, requires $O(\log n)$space per {\nde}, converges in $O(n)$ rounds and $O(n^2)$ steps,where $n$ is the size of the network, and works under an unfair scheduler.
K-dominating set, K-clustering, self-stabilization, silent, unfair scheduler

L. L. Larmore, S. Devismes and A. K. Datta, "A Self-Stabilizing O(n)-Round k-Clustering Algorithm," Reliable Distributed Systems, IEEE Symposium on(SRDS), Niagara Falls, New York, 2009, pp. 147-155.
81 ms
(Ver 3.3 (11022016))