Self-Stabilizing Small k-Dominating Sets

@article{Datta2011SelfStabilizingSK,
  title={Self-Stabilizing Small k-Dominating Sets},
  author={A. Datta and L. Larmore and St{\'e}phane Devismes and Karel Heurtefeux and Yvan Rivierre},
  journal={2011 Second International Conference on Networking and Computing},
  year={2011},
  pages={30-39}
}
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… Expand
Fast self-stabilizing k-independent dominating set construction ?
A Self-Stabilizing Minimal k-Grouping Algorithm
Competitive Self-Stabilizing k-Clustering
Self-stabilizing silent disjunction in an anonymous network
Competitive Self-Stabilizing k-Clustering
Scalable fault-containing self-stabilization in dynamic networks
Fast, silent self-stabilizing distance-k independent dominating set construction
  • C. Johnen
  • Computer Science, Mathematics
  • Inf. Process. Lett.
  • 2014
...
1
2
3
4
...

References

SHOWING 1-10 OF 50 REFERENCES
A Self-Stabilizing O(k)-Time k-Clustering Algorithm
Self-Stabilization with r-Operators revisited
Self-stabilization with r-Operators Revisited
When graph theory helps self-stabilization
Energy Optimisation in Resilient Self-Stabilizing Processes
  • Adrian Kosowski, L. Kuszner
  • Computer Science
  • International Symposium on Parallel Computing in Electrical Engineering (PARELEC'06)
  • 2006
A self-stabilizing k-clustering algorithm for weighted graphs
Memory requirements for silent stabilization
A distributed algorithm to find k-dominating sets
...
1
2
3
4
5
...