Zone-Based Distributed Heuristic Approximation Algorithm for Minimum Connected Dominating Set
基于域的分布式最小连通支配集的启发式算法

With regard to the problem of slow progress and high overhead, when constructing a tree-like CDS in a fast-moving ad hoc networks, this paper puts forward a Zone-based distributed heuristic approximation algorithm for minimum connected dominating set(ZBCDS). ZBCDS defines the concept of potential-rank and candidate nodes, on the basis of calculating maximal independent set, optimizes the zone partition and the adjustment along the zone borders via nodes judging their own potential-rank, finally reaches the aim of rapidly and efficiently reconstructing CDS as topology change. Experimental results show that ZBCDS can rapidly and efficiently construct CDS, with smaller size of CDS and less time complexity.