A Self-Stabilizing O(n)-Round k-Clustering Algorithm

• Published in: 2009 28th IEEE International Symposium on Reliable Distributed Systems pp. 147 - 155
• Main Authors: Datta, A.K., Devismes, S., Larmore, L.L.
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01-09-2009
• Subjects: Algorithm design and analysis; Clustering algorithms; Computer networks; Computer science; Distributed algorithms; Distributed computing; Intrusion detection; K-clustering; K-dominating set; Partitioning algorithms; Scheduling algorithm; self-stabilization; silent; unfair scheduler; USA Councils
• ISBN: 0769538266; 9780769538266
• ISSN: 1060-9857; 2575-8462
• DOI: 10.1109/SRDS.2009.13

Given an arbitrary network G of processes with unique IDs and no designated leader, and given a k-dominating set I C 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 process, converges in O(n) rounds and O(n 2 ) steps, where n is the size of the network, and works under an unfair scheduler.