Optimizing connections: applied shortest path algorithms for MANETs

Tools

Alameri, I, Komarkova, J, Al-Hadhrami, T ORCID: https://orcid.org/0000-0001-7441-604X, Yahya, AE and Gharbi, A, 2024. Optimizing connections: applied shortest path algorithms for MANETs. Computer Modeling in Engineering and Sciences. ISSN 1526-1492

Full text not available from this repository.

Official URL: https://doi.org/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 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.

Item Type:	Journal article
Publication Title:	Computer Modeling in Engineering and Sciences
Creators:	Alameri, I., Komarkova, J., Al-Hadhrami, T., Yahya, A.E. and Gharbi, A.
Publisher:	Tech Science Press
Date:	2024
ISSN:	1526-1492
Identifiers:	Number Type 10.32604/cmes.2024.052107 DOI 2179208 Other
Rights:	This work is licensed under a Creative Commons Attribution 4.0 International License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Divisions:	Schools > School of Science and Technology
Record created by:	Jeremy Silvester
Date Added:	26 Jul 2024 08:35
Last Modified:	26 Jul 2024 08:35
URI:	https://irep.ntu.ac.uk/id/eprint/51830