Abstract:

Considering the complexity of the nodes in Ad hoc network in actual situation, we propose a routing algorithm based on MWMCDS(Maximal Weight Minimum Connected Dominating Set). This approach takes account of the diversity and complexity of the nodes in the network, so it weights each node on its power or online time. In this way, we will make the weights as large as possible while finding the CDS(Connected Dominating Set)as little as possible. So that we can find a highly efficient and reliable communication route to manage other nodes in the network. The network simulation and performance comparison has also been made for the 3 kinds of routing protocols. The result shows that in the same simulation scenarios, the PDF(Packet Delivery Fraction) in both DSR(Dynamic Source Routing)and AODV(Ad Hoc On-Demand Distance Vector)can reach up to 94％, better than DSDV(Destination-Sequenced Distance Vector). Only the route which uses higher PDF can cause the broadcasting routing algorism of Ad hoc network more effective.

Key words: Ad Hoc network protocol, network simulation ,  packet delivery fraction  ,  ,  maximal weight minimum connected dominating set(MWMCDS)