A distributed greedy algorithm for construction of minimum connected dominating set in wireless sensor network

In the ad-hoc wireless network, there is no predefined infrastructure. So, nodes communicate with each other via peer communications. For effective communication, connected dominating set (CDS) can be used as a virtual backbone for the network. However, constructing a minimum connected dominating set is a NP-Complete problem. In the literature many approximation algorithms have been reported. In this paper, we propose a distributed three phase greedy approximation algorithm. In our algorithm, the nodes only store one hop neighborhood information to find the next dominators. We also propose a way to reduce the CDS size by downgrading some of the existing dominators after the construction of CDS. The simulation result shows that our CDS construction scheme outperforms all the existing CDS construction algorithms in terms of CDS size for randomly distributed nodes. Our algorithm retains the performance ratio of (4.8 + ln5)opt + 1.2 and time complexity of O(D), where opt being the size of the optimal CDS and D is the diameter of the network.