Differential Evolution Based Probabilistic Model to Support Quality Aware Best Path Routing Scheme for Mobile Ad-Hoc Networks

Abstract

The mobile ad hoc networks have made the source and the influenced shortest path routing extremely challenging owing to their unstable and dynamic topology. Even though the nodes keep moving and this increases the packets and their retransmission and this brings down the delivery ratio. The Ad hoc networks with their quick deployment and minimal configuration are well-suited for these emergency situations such as disasters that are human-induced, medical situations or emergency, military conflicts and so on. Every mobile node found in a Mobile Ad hoc Network (MANET) can perform a routing function to establish some communication among various nodes, their "death" and also of some nodes owing to the exhaustion of energy that can disrupt service of the whole network. The ad hoc on-demand distance vector routing (AODV) is that routing protocol which gets established at a time there is a demand for another new route. It is found to be similar to the energy and the other parameters of Quality of Service that includes throughput, security, jitter and end-to-end delay. For this work, there is a probabilistic routing scheme which is quality aware for enhancing and improving the mobile ad hoc network and its throughput and this is known as a Differential Evolution (DE). As opposed to looking out for a path that is the shortest, this heuristic has proposed the best path to ensure that there is an overall quality of service that is ensured. This algorithm which is based on the DE has improved the chances of selecting the ideal route for data transmission.