Efficient route discovery using stable connected Dominating Set for mobile ad hoc networks

Ad hoc Networks are wireless networks without any fixed infrastructure. The conventional on demand route discovery employ simple flooding method. To send a datagram, a source host broadcasts a route request (RREQ) packet to the network. All neighboring nodes receiving this packet rebroadcast it, until it reaches the destination. It has a large flooding overhead, poor network performance and undesirable battery power consumption. The connecting Dominating Set (CDS) is a promising approach to the broadcasting storm problem. The proposed algorithm selects a node with the highest weight value to be a dominator node that is stronger and more stable. The weight value is to be calculated based on the rate of change of displacement and signal strength. The dominator nodes are connected using the Steiner tree. The CDS is constructed after connecting the dominators and pruning. To improve the network performance, we have designed an algorithm for finding the Minimum Connected Dominating Set (MCDS), using the Dominating Set for mobile ad hoc networks, based on weight values. The simulation results show that our algorithm has better performance, especially in the packet delivery rate and flooding overhead, when compared to other similar algorithms.