PDAU: a new exploitation of routing strategy in adhoc network

Generally, routing is the process of selecting a path for traffic in a network, or across multiple networks. The routing strategy usually struck with the issue of shortest path routing (SPR). A number of routing models is already in progress but, still the challenges rise with some real-world applications. This routing strategy impresses to focus on solving these issues by considering delay, energy and total fitness. This paper introduces a new routing algorithm for solving the issues faced in route establishment and route recovery as well. This paper also uses neural network (NN) model to predict the node movements in adhoc network. More importantly, the major optimal route selection problem is solved here by introducing a new hybrid algorithm. The proposed model, probability-based dragonfly (DA) with artificial bee colony (ABC) update (PDAU) compares its performance over other conventional methods in terms of delay, energy and total fitness.