Optimizing Connections: Applied Shortest Path Algorithms for MANETs

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216275%3A25410%2F24%3A39922233" target="_blank" >RIV/00216275:25410/24:39922233 - isvavai.cz</a>

Výsledek na webu

<a href="https://www.techscience.com/CMES/v141n1/57693" target="_blank" >https://www.techscience.com/CMES/v141n1/57693</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.32604/cmes.2024.052107" target="_blank" >10.32604/cmes.2024.052107</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Optimizing Connections: Applied Shortest Path Algorithms for MANETs

Popis výsledku v původním jazyce

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&apos;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 BellmanFord algorithm, considering adaptation to the dynamic network conditions that are typical for MANETs. This paper has shown through detailed algorithmic analysis that Dijkstra&apos;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&apos;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&apos;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&apos;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.

Název v anglickém jazyce

Optimizing Connections: Applied Shortest Path Algorithms for MANETs

Popis výsledku anglicky

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&apos;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 BellmanFord algorithm, considering adaptation to the dynamic network conditions that are typical for MANETs. This paper has shown through detailed algorithmic analysis that Dijkstra&apos;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&apos;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&apos;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&apos;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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2024

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

CMES - Computer Modeling in Engineering and Sciences

ISSN

1526-1492

e-ISSN

1526-1506

Svazek periodika

141

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

21

Strana od-do

787-807

Kód UT WoS článku

001274943900001

EID výsledku v databázi Scopus

2-s2.0-85201789764