Smart City Gnosys

Smart city article details

Title A Comparative Analysis Of Optimized Routing Protocols For High-Performance Mobile Ad Hoc Networks
ID_Doc 767
Authors Pranav A.; Jain A.; Ali M.M.; Raj M.; Gupta U.
Year 2024
Published Lecture Notes in Networks and Systems, 917
DOI http://dx.doi.org/10.1007/978-981-97-0892-5_7
Abstract 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. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.
Author Keywords Battery capacity; Bellman-Ford; Dijkstra; Genetic algorithm; High bandwidth; Low mobility; Mobile Ad Hoc Networks (MANETs); Network health; NS-2 simulation; Packet loss; Performance metrics; Routing algorithms; Transmission power


Similar Articles


Id Similarity Authors Title Published
54332 View0.877Alameri I.; Komarkova J.; Al-Hadhrami T.; Lotfi A.Systematic Review On Modification To The Ad-Hoc On-Demand Distance Vector Routing Discovery MechanicsPeerJ Computer Science, 8 (2022)
47088 View0.875Quy V.K.; Nam V.H.; Linh D.M.; Ngoc L.A.Routing Algorithms For Manet-Iot Networks: A Comprehensive SurveyWireless Personal Communications, 125, 4 (2022)
8202 View0.862Sharma V.; Sukhroop P.; Rani R.; Kumar S.An Hybrid Approach To Manet Routing: Leveraging Optical Networks And Next-Gen InnovationsJournal of Optical Communications (2025)
47098 View0.854Min K.T.; Jeyanthi N.Routing Performances In Wireless Sensor Networks: Determining Shortest Path Algorithms EffectivenessInternational Journal of Computer Networks and Communications, 16, 6 (2024)
8279 View0.852Quy V.K.; Chuan P.M.; Ngoc L.A.An Improved Performance Routing Protocol Based On Delay For Manets In Smart CitiesInternational Journal of Electrical and Computer Engineering, 12, 1 (2022)