Ibrahim Alameri1,*, Jitka Komarkova2, Tawfik Al-Hadhrami3, Abdulsamad Ebrahim Yahya4, Atef Gharbi5
CMES-Computer Modeling in Engineering & Sciences, Vol.141, No.1, pp. 787-807, 2024, DOI:10.32604/cmes.2024.052107
Abstract This study is trying to address the critical need for efficient routing in Mobile Ad Hoc Networks (MANETs) from dynamic topologies that pose great challenges because of the mobility of nodes. The main objective was to delve into and refine the application of the Dijkstra's algorithm in this context, a method conventionally esteemed for its efficiency in static networks. Thus, this paper has carried out a comparative theoretical analysis with the Bellman-Ford algorithm, considering adaptation to the dynamic network conditions that are typical for MANETs. This paper has shown through detailed algorithmic analysis that Dijkstra’s… More >
Login
Register
