Distributed construction of connected dominating sets based on maximum independent sets

Constructing connected dominating sets (CDS) plays an important role in improving broadcast efficiency, simplifying routing and avoiding collision for wireless ad hoc networks. In this paper, a distributed algorithm called DCDS for constructing CDS based on maximum independent sets (MIS) was put forward. In this algorithm, each node only needs to know its 2-hop neighbors rather than all nodes in network. DCDS algorithm consists of three steps including neighbor discovery, MIS construction and MIS interconnection. The theoretical analysis showed that the message complexity of DCDS was O(n), the time complexity was O(Δ) at most, and the approximation factor was 8. Simulation result confirmed the validity of DCDS algorithm. © 2013 IFSA.