Performance Analysis of Dijkstra-Based Weighted Sum Minimization Routing Algorithm for Wireless Mesh Networks
Multiobjective optimization methods for routing in static wireless mesh networks (WMNs), with more than one QoS measure to be optimized, are highly challenging. To optimize the performance for a given end-to-end route in a static network, the most common metrics that need to be optimized or bounded...
Main Author: | Nuha A. S. Alwan |
---|---|
Format: | Article |
Language: | English |
Published: |
Hindawi Limited
2014-01-01
|
Series: | Modelling and Simulation in Engineering |
Online Access: | http://dx.doi.org/10.1155/2014/658408 |
Similar Items
-
Delivery Route Management based on Dijkstra Algorithm
by: Ng Lih Sheng, et al.
Published: (2021-03-01) -
AIS Based Shipping Routes Using the Dijkstra Algorithm
by: Pedro Silveira, et al.
Published: (2019-09-01) -
ACO-based routing algorithms for wireless mesh networks
by: Yuan, Chen
Published: (2009) -
Exploring a New Adaptive Routing Based on the Dijkstra Algorithm in Optical Networks-on-Chip
by: Yan-Li Zheng, et al.
Published: (2021-01-01) -
A MST-based Routing Algorithm for Wireless Mesh Networks
by: Wei - Chih Lin, et al.
Published: (2004)