A Comparative Analysis of Dijkstra, Bellman-Ford and AODV Algorithms with Applications in Modern Navigation Systems

Abstract

Background and Objective: This study aimed to examine and compare the theoretical foundations, computational characteristics and practical applications of three fundamental routing algorithms-Dijkstra’s Algorithm, the Bellman–Ford Algorithm and the Ad hoc On-Demand Distance Vector (AODV) Routing Protocol. Particular emphasis was placed on their relevance to contemporary satellite navigation (SatNav) and digital mapping systems.

Materials and Methods: A systematic review of scholarly literature and technical documentation was conducted to analyze the operational principles, strengths and limitations of each algorithm. Comparative assessment focused on deterministic shortest-path computation, distributed routing behavior and reactive route discovery. Algorithmic evolution toward hybrid models incorporating heuristics and real-time traffic data was also examined.

Results: The analysis showed that deterministic algorithms such as Dijkstra’s have undergone significant optimization, enabling their integration into large-scale navigation platforms including Google Maps, Waze and Apple Maps. Bellman-Ford demonstrated advantages in distributed environments, while AODV exhibited strong adaptability in highly dynamic, infrastructure-less networks. Each algorithm displayed distinct performance characteristics with respect to scalability, routing overhead and responsiveness to network changes.

Conclusion: The findings indicate that Dijkstra’s algorithm and its variants (particularly heuristic-enhanced forms such as A*) remain the most efficient and scalable solutions for SatNav applications requiring real-time routing updates. In contrast, AODV continues to be better suited for ad hoc and vehicular network scenarios where dynamic topology and decentralized route discovery are critical.