Modified Reactive Routing Protocol with Shortest path Algorithm for MANETs

Mobile Ad-hoc Networks (MANET) are one of the most popular study topics in recent years due to the world's natural problems. Every day, MANET encounters numerous significant issues in society; in this regard, link failure, packet loss, energy consumption, and retransmission are the most prevalent concerns. My goal in this article is to reduce packet loss while using the least amount of energy possible as a first step in my research. Using two distinct shortest route algorithms (SPA), Bellman Ford and Dijkstra's algorithms, this technical research study examined the On-demand Routing Protocol (AODV) technique with multiple topologies and three sets of nodes. This work's major objective is to use five steps to increase remaining energy and decrease packet dropping. All active nodes are flooded with route requests (i), all node IDs from our network group are tested (ii), the minimal weighted route is found (iv), the utilization energy of finding the route is calculated (v), and communication begins from source to destination. Use Network Simulator 2, one of the most widely used and user-friendly programs, to analyze a variety of characteristics, including packet delivery ratio, routing overhead, end-to-end delay, and throughput (NS2). Ultimately, it's evident that SPA employs protocols that are superior to conventional routing protocols in every way.