Comparative Evaluation of Dijkstra's Algorithm and Shortest Path Strategies in Mobile Ad Hoc Networks (MANETs)

Under broad application, the shortest path problem in graph-based network environments is generally treated with the use of Dijkstra's Algorithm. Due to the accelerating development of network technologies and the increasing need for real-time routing support, pathfinding algorithms have been confronted with continuously mounting challenges as far back as the late 1980s in areas of performance, scalability, and responsiveness. This research offers a comparative analysis of Dijkstra's Algorithm for contemporary networking environments, with the network size, topology, and implementation structure being considered. It first presents the theoretical background behind Dijkstra's Algorithm and then examines its real-world efficiency through the use of case studies for computer networks, Mobile Ad Hoc Networks (MANETs), and Internet of Things (IoT) systems. Important performance metrics are time complexity, memory usage, and running speed in varying implementations, including array-based, binary heap, and Fibonacci heap formats. In addition, the paper presents a more comprehensive view by comparing Dijkstra's Algorithm with other popular shortest path algorithms, including A*, Bellman-Ford, and Floyd-Warshall. Experimental simulations conducted on real-world and synthetic network datasets evaluate its scalability at higher node density and network size.