A Routing Algorithm via Constructing the Weighted Minimum Connected Dominating Set in Mobile Adhoc Network

A mobile ad-hoc network (MANET) is made up of a group of mobile wireless nodes, which can be flexibly and quickly applied to many applications. The devices in MANET are often suffering from the issue of battery power since they cannot be charged in time. Then, as benefiting from the fact that the fewer nodes provide data forwarding support and the less energy will be consumed, many methods utilize the connecting dominate set (CDS) to prolong the network lifetime. However, constructing a smallest size of CDS is a NP-complete problem. In this paper, we propose a new greedy approach constructing a weighted CDS (Cgreedy-wMCDS) by integrating three factors such as energy, mobility and degree of nodes. The proposed method provides the whole network control and data forwarding support. This new method incorporates route stability into the routing algorithm to reduce the route path failures. The simulation results show that the approach of Cgreedy-wMCDS is superior to other methods in terms of prolonging the lifetime of MANET. The time complexity of our algorithm is (O D）, where D is the network diameter.