Approximate minimal connected cover dominate set in sensor networks based on Cartesian code

As a kind of wireless ad hoc network model, Sensor network has broad application prospects in environment, Military control, the Prediction of earthquake and climate and so on. Based on the functional of density control of Sensor Networks, a construction algorithm called Connected Cover Dominate Set has been proposed. In the new algorithm, the Sink node set up Cartesian code first, and then broadcast the obtained information to all sensor nodes in the network, then, sensor nodes in the network exchange information through periodic and the adjacent nodes, to construct approximate minimal Connected Cover Dominate Set in the target region. Analysis and simulation results show that the algorithm which compared with the existing similar algorithms, the new algorithm in Connected Cover Dominate Set has better performance.