Distributed construction of minimum Connected Dominating Set in wireless sensor network using two-hop information

In a Wireless Sensor Network (WSN), neither there is any fixed infrastructure nor any centralized control. Therefore, for efficient routing, some of the nodes are selected to form a virtual backbone. Minimum Connected Dominating Set (MCDS) can be used as a virtual backbone. However, MCDS construction is an NP-Hard problem. In this paper, we propose a novel distributed greedy approximation algorithm for CDS construction which reduces the CDS size effectively. The proposed method constructs the CDSs of smaller sizes with lower construction cost in comparison to existing CDS construction algorithms for both uniform and random distribution of nodes. The performance ratio of the proposed algorithm, which is the best at the current moment, is (4.8+ln5)|opt|+1.2, where |opt| is the size of an optimal CDS of the network. Its time complexity is O(D), where D is the diameter of the network. Its message complexity is O(nR) which is linear, where n is the network size and R is the maximum between number of rounds needed to construct the PDS and number of rounds needed to interconnect the PDS nodes. Our simulation shows that ours is the most size optimal distributed CDS construction algorithm.