A self-stabilizing algorithm for two disjoint minimal dominating sets in an arbitrary graph

Authors:
Gongbing Hong;Pradip K. Srimani
Affiliations:
Clemson University, Clemson, SC;Clemson University, Clemson, SC
Venue:
Proceedings of the 49th Annual Southeast Regional Conference
Year:
2011

Citing 3
Cited 0

Next century challenges: scalable coordination in sensor networks

MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Distributed computing: fundamentals, simulations and advanced topics

Distributed computing: fundamentals, simulations and advanced topics
Self-stabilization of dynamic systems assuming only read/write atomicity

Distributed Computing - Special issue: Self-stabilization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we present a self-stabilizing algorithm that concurrently finds two disjoint minimal dominating sets in an arbitrary network graph without any isolated node. The worst case convergence time of the algorithm from any arbitrary initial state is O(n4) where n is the number of nodes in the network.