Self-Stabilizing Small k-Dominating Sets

Stephane Devismes, Karel Heurtefeux, Yvan Rivierre, Ajoy K. Datta, Lawrence L. Larmore
2011 2011 Second International Conference on Networking and Computing  
A self-stabilizing algorithm, after transient faults hit the system and place it in some arbitrary global state, causes the system to recover in finite time without external (e.g., human) intervention. In this paper, we give 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 give a transformer that allows our algorithm to work under an unfair daemon, the weakest
more » ... assumption. The complexity of our solution is O(n) rounds and O(Dn 3 ) steps using O(log k + log n + k log N k ) bits per process, where D is the diameter of the network and N is an upper bound on n.
doi:10.1109/icnc.2011.15 dblp:conf/ic-nc/DevismesHRDL11 fatcat:smbuulljebaehcdrmw3fkilo2u