Constructing Minimum Connected Dominating Sets with Constant Update Time in Wireless Ad-Hoc Sensor Networks

A Connected Dominating Set (CDS) is a subset V' of V for the graph G(V, E) and induces a connected sub graph, such that each node in V - V' is at least adjacent to one node in V'. CDSs have been proposed to formulate virtual backbones in wireless ad-hoc sensor networks to design routing protocols for alleviating the serious broadcast storms problem. It is not easy to construct the Minimum Connected Dominating Set (MCDS) due to the NP-hard nature of the problem. In this paper, we present an effective distributed algorithm to approach the MCDS. We first find an Maximal Independent Set (MIS) and then adds new nodes to the MIS to let sub graph induced by these nodes be connected. The dominators are selected into MIS based on effective degree. Default event is triggered to recalculate and update the node's effective degree after a predetermined amount of time. Many proposed algorithms suffers from high message complexity, thus, which confines the algorithms applied in large scale network. For our algorithm, we prove that it has a good performance in terms of message complexity with message complexity of O(Δ · n). We also analyse some other useful structural properties of CDS generated by our algorithm. Extensive simulations are also implemented to further evaluate the performance of the algorithm.