A Synchronous Self-stabilizing Minimal Domination Protocol in an Arbitrary Network Graph

摘要

In this paper we propose a new self-stabilizing distributed algorithm for minimal domination protocol in an arbitrary network graph using the synchronous model; the proposed protocol is general in the sense that it can stabilize with every possible minimal dominating set of the graph.