Probabilistic-Based Energy Efficient Dynamic Route Discovery in MANET’s

The routing is able to send request message from source to destination hop through intermediate hops. The intermediate hops forward the received messages to its neighbours. The replicated copies of the request message will received at each hop. Each hop transmits the copy of message to its neighbours. In receiving and transmitting the messages, it consumes much of energy of hop, which can be saved by using selective hop forwarding approach. This paper proposed a model name as dynamic probabilistic broadcast for route discovery (DPBRD), which tries to reduce the replicated copies of control messages to save energy. This method determines the forward probability by consider extended area and hop density to forwards request messages to its neighbours. The performance of the proposed protocol has been evaluated and compared with AODV (Flooding), THPRD and DPBSC protocols across different performance metrics—Average received duplicate messages, saved percentage of forward messages, and energy consumption. The results demonstrate that the proposed DPBRD protocol outperforms other. NS-2 environment was used to simulate and analyse the proposed protocol.