Dynamic Shortest Path Routing In Mobile Adhoc Networks Using Modified Artificial Bee Colony Optimization Algorithm

Abstract — The Mobile Adhoc Networks (MANETs) is always self-organization, decentralization and infrastructure-less network of mobile devices connected without wires. The most necessary characteristic in mobile adhoc networks is topology transformation. Finding the shortest path for the routing problem in Mobile Adhoc Networks (MANETs) will become a dynamic optimization problem. The Modified Artificial Bee Colony Optimization (MABCO) algorithmic techniques are used to find the global optimum value in a given space. The Modified Artificial Bee Colony Optimization (MABCO) algorithm has shown to be a good technique for identifying multiple stable paths between source and destination nodes