Minimum Connected Dominating Set Algorithm with Weight in Wireless Sensor Networks

Routing based on a Minimum Connected Dominating Set(MCDS) is a promising approach, where the search space for a route is reduced to nodes in the set (also called gateway nodes). This paper introduces a simple and efficient algorithm for calculating minimum connected dominating set with weight(WMCDS) in the topology graph G of a wireless sensor network. The maximum of the weight-based choice of gateway nodes guarantee that the most suitable nodes have been chosen for the role of gateway nodes so that they can properly coordinate all the other nodes in the network. As a result, it can keep stability of the WMCDS, provide a high effective communication base for broadcast and routing operation in the whole network and prolong the life span of the whole network Our simulation results show that the proposed approach can ensure the fewer dominators but with higher weight to form the connected dominating set. So the scheme can be potentially used in designing efficient routing algorithms based on a WMCDS.