| Summary: | 碩士 === 國立高雄大學 === 資訊工程學系碩士班 === 101 === In certain applications of distributed systems, some nodes are designated among others that play the roles of servers which provide desired service to other client nodes. If we want to find a set of nodes that cover all other nodes not in the set, the problem becomes identifying a dominating set. Formally, every node not in a dominating set should be adjacent to at least one node in the set. To increase the durability of service, researchers further consider k-dominating set problem, where every node not in a k-dominating set should be adjacent to at least k nodes in the set, where k >= 1 is an integer. This problem can be further extended to multi-dominating set problem, where the domination requirement k for every node can be different. A multi-dominating set is minimal if it does not contain any proper subset that is also a valid multi-dominating set. This thesis proposes a self-stabilizing distributed algorithm that finds a minimal dominating set under a central daemon. The correctness of this algorithm has been proven. We study the performance of the proposed algorithm and compare it with those of existing approaches under several representative topologies. Simulation results show that the proposed approach generally find a smaller set when compared with prior methods.
|
|---|
