Tom and Jerry Based Multipath Routing with Optimal K-medoids for choosing Best Clusterhead in MANET

Abstract

Given the unpredictable nature of a MANET, routing has emerged as a major challenge in recent years. For effective routing in a MANET, it is necessary to establish both the route discovery and the best route selection from among many routes. The primary focus of this investigation is on finding the best path for data transmission in MANETs. In this research, we provide an efficient routing technique for minimising the time spent passing data between routers. Here, we employ a routing strategy based on Tom and Jerry Optimization (TJO) to find the best path via the MANET's routers, called Ad Hoc On-Demand Distance Vector (AODV). The AODV-TJO acronym stands for the suggested approach. This routing technique takes into account not just one but three goal functions: total number of hops. When a node or connection fails in a network, rerouting must be done. In order to prevent packet loss, the MANET employs this rerouting technique. Analyses of AODV-efficacy TJO's are conducted, and results are presented in terms of energy use, end-to-end latency, and bandwidth, as well as the proportion of living and dead nodes. Vortex Search Algorithm (VSO) and cuckoo search are compared to the AODV-TJO approach in terms of performance. Based on the findings, the AODV-TJO approach uses 580 J less energy than the Cuckoo search algorithm when used with 500 nodes.