A Comparative Analysis of Optimized Routing Protocols for High-Performance Mobile Ad Hoc Networks

Mobile ad hoc networks (MANETs) let wireless devices interact without a fixed infrastructure, yet routing algorithms are still crucial. MANETs are used in disaster relief, military operations, and smart cities. This study compares MANET Bellman-Ford, Dijkstra, and Genetic routing algorithms. These methods use hop count and connection cost to find the fastest paths between nodes. The report evaluates routing algorithms using six criteria (bandwidth, mobility, transmission power, battery capacity, packet loss, and health). We run numerous simulations with different parameter settings and statistically analyze the results. The paper offers a battery capacity and transmission power-based network node health measure. Many MANET routing methods are tailored for specific performance metrics and simulated conditions. Simulations show that the recommended measure is particularly beneficial for analyzing MANET network node status. The study also finds that certain routing methods perform better in low packet loss and high battery capacity. These findings underscore the need to consider performance indicators and simulated scenarios when choosing a MANET routing algorithm. This research provides insights into enhancing MANET routing algorithms with 90% accuracy and performance dependent on performance measurements and network factors. The findings show the merits and weaknesses of each algorithm, helping choose MANET routing solutions.