2011 Second International Conference on Networking and Computing (2011)

Osaka, Japan

Nov. 30, 2011 to Dec. 2, 2011

ISBN: 978-0-7695-4569-1

pp: 30-39

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICNC.2011.15

ABSTRACT

A self-stabilizing algorithm, after transient faults hit the system and place it in some arbitrary global state, recovers in finite time without external (e.g., human) intervention. In this paper, we propose a distributed asynchronous silent self-stabilizing algorithm for finding a minimal k-dominating set of at most n/(k+1) processes in an arbitrary identified network of size n. We propose a transformer that allows our algorithm work under an unfair daemon (the weakest scheduling assumption). The complexity of our solution is in O(n) rounds and O(D n²) steps using O(log n + k log n) bits per process where D is the diameter of the network.

INDEX TERMS

distributed systems, self-stabilization, k-dominating sets, k-clustering

CITATION

Y. Rivierre, S. Devismes, K. Heurtefeux, L. L. Larmore and A. K. Datta, "Self-Stabilizing Small k-Dominating Sets,"

*2011 Second International Conference on Networking and Computing(ICNC)*, Osaka, Japan, 2011, pp. 30-39.

doi:10.1109/ICNC.2011.15