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...
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: | |
Online Access: | https://joe.uobaghdad.edu.iq/index.php/main/article/view/1998 |
Similar Items
-
Comparison Analysis of Graph Theory Algorithms for Shortest Path Problem
by: Yosefina Finsensia Riti, et al.
Published: (2023-11-01) -
Comparison of Dijkstra dan Floyd-Warshall Algorithm to Determine the Best Route of Train
by: Tri Setya Dermawan
Published: (2019-01-01) -
Evaluation of Shortest Paths in Road Network
by: Farrukh Shehzad, et al.
Published: (2009-06-01) -
Heuristic Greedy-Gradient Route Search Method for Finding an Optimal Traffic Distribution in Telecommunication Networks
by: Konstantin Gaipov, et al.
Published: (2023-12-01) -
A Game for Learning How to Model in Graph Theory
by: Alicia Cordero, et al.
Published: (2022-06-01)