@INPROCEEDINGS{6131791,
author={Devismes, S. and Heurtefeux, K. and Rivierre, Y. and Datta, A.K. and Larmore, L.L.},
booktitle={Networking and Computing (ICNC), 2011 Second International Conference on}, title={Self-Stabilizing Small k-Dominating Sets},
year={2011},
month={30 2011-dec. 2},
volume={},
number={},
pages={30 -39},
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(Dn2) steps using O(log n + k log n/k) bits per process where D is the diameter of the network.},
keywords={distributed asynchronous silent algorithm;minimal k-dominating set;self-stabilizing small k-dominating sets;transient fault;computational complexity;graph theory;set theory;},
doi={10.1109/ICNC.2011.15},
ISSN={},}