A Heuristic for Minimum Connected Dominating Set with Local Repair for Wireless Sensor Networks

Connected dominating set (CDS) problem in unit disk graph has a significant impact on an efficient design of routing protocols in wireless sensor networks. In this paper, an algorithm is proposed for finding minimum connected dominating set (MCDS) using dominating set. Dominating sets are connected by using Steiner tree. The algorithm goes through three phases. In first phase dominating set is found, in second phase connectors are identified, connected through Steiner tree. In third phase the CDS obtained in second phase is pruned to obtain a MCDS. MCDS so constructed needs to adapt to the continual topology changes due to deactivation of a node due to exhaustion of battery power. These topological changes due to power constraints are taken care by a local repair algorithm that reconstructs the MCDS using only neighborhood information. Simulation results indicate both the heuristics are very efficient and result in near optimal MCDS.