Journal of Parallel and Distributed Computing
Self-stabilizing algorithms for {k}-domination
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
Randomized self-stabilizing algorithms for wireless sensor networks
IWSOS'06/EuroNGI'06 Proceedings of the First international conference, and Proceedings of the Third international conference on New Trends in Network Architectures and Services conference on Self-Organising Systems
ADC '13 Proceedings of the Twenty-Fourth Australasian Database Conference - Volume 137
Efficient self-stabilizing algorithms for minimal total k-dominating sets in graphs
Information Processing Letters
| Hi-index | 0.00 |
In a graph G = (V,E) a set S \subseteq V is said to be total dominating if every v \in V is adjacent to some member of S. When the graph represents a communication network, a total dominating set corresponds to a collection of servers having a certain desirable backup property, namely, that every server is adjacent to some other server. Self-stabilization, introduced by Dijkstra, is the most inclusive approach to fault tolerance in distributed systems. We propose a new self-stabilizing distributed algorithm for finding a minimal total dominating set in an arbitrary graph. We also show how the basic ideas behind the proposed protocol can be generalized to solve other related problems.