Optimizing Connections:Applied Shortest Path Algorithms for MANETs  

作　　者：Ibrahim Alameri Jitka Komarkova Tawfik Al-Hadhrami Abdulsamad Ebrahim Yahya Atef Gharbi 

机构地区：[1]Faculty of Medical Sciences,Jabir Ibn Hayyan Medical University,Alkufa,Najaf,54001,Iraq [2]Faculty of Economics and Administration,University of Pardubice,Studentska,Pardubice,53210,Czech Republic [3]Computer Science Department,School of Science and Technology,Nottingham Trent University,Nottingham,NG118NS,UK [4]Department of Information Technology,College of Computing and Information Technology,Northern Border University,Arar,91431,Saudi Arabia [5]Department of Information System,College of Computing and Information Technology,Northern Border University,Arar,91431,Saudi Arabia

出　　处：《Computer Modeling in Engineering & Sciences》2024年第10期787-807,共21页工程与科学中的计算机建模（英文）

基　　金：supported by Northern Border University,Arar,Kingdom of Saudi Arabia,through the Project Number“NBU-FFR-2024-2248-03”.

摘　　要：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.Themain 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 algorithm,when adapted for dynamic updates,yields a very workable solution to the problem of real-time routing in MANETs.The results indicate that with these changes,Dijkstra’s algorithm performs much better computationally and 30%better in routing optimization than Bellman-Ford when working with configurations of sparse networks.The theoretical framework adapted,with the adaptation of the Dijkstra’s algorithm for dynamically changing network topologies,is novel in this work and quite different from any traditional application.The adaptation should offer more efficient routing and less computational overhead,most apt in the limited resource environment of MANETs.Thus,from these findings,one may derive a conclusion that the proposed version of Dijkstra’s algorithm is the best and most feasible choice of the routing protocol for MANETs given all pertinent key performance and resource consumption indicators and further that the proposed method offers a marked improvement over traditional methods.This paper,therefore,operationalizes the theoretical model into practical scenarios and also further research with empirical simulations to understand more about its operational effectiveness.

关 键 词：Dijkstra’s algorithm optimization complexity analysis shortest path first comparative algorithm analysis nondeterministic polynomial(NP)-complete 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]