A Comparative Study of Single-Constraint Routing in Wireless Mesh Networks Using Different Dynamic Programming Algorithms

A Comparative Study of Single-Constraint Routing in Wireless Mesh Networks Using Different Dynamic Programming Algorithms

Finding the shortest route in wireless mesh networks is an important aspect. Many techniques are used to solve this problem like dynamic programming, evolutionary algorithms, weighted-sum techniques, and others. In this paper, we use dynamic programming techniques to find the shortest path in wirel...

Full description

Bibliographic Details
Main Authors: Sabreen Mahmood Shukr, Nuha Abdul Sahib Alwan, Ibraheem Kassim Ibraheem
Format: Article
Language:English
Published: University of Baghdad 2023-05-01
Series:Journal of Engineering
Subjects:
wireless mesh networks; dynamic programming; single-constraint optimization; Dijkstra algorithm; Bellman-Ford algorithm; floyd-warshall algorithm; MRA.
Online Access:https://joe.uobaghdad.edu.iq/index.php/main/article/view/1998

Internet

https://joe.uobaghdad.edu.iq/index.php/main/article/view/1998

Similar Items