A Near-Optimail Distributed QoS Constrained Routing Algorithm for Multichannel Wireless Mesh Networks
Date Issued
2009
Date
2009
Author(s)
Hsieh, Yu-Jen
Abstract
Wireless mesh networks (WMNs) are considered as a solution to providing last-mile broadband Internet access. Employing multiple channels into WMN is shown to be an efficient way to conquer the degradation of capacity due to the interferences. For each user, it is desirable to choose the route with low interference and minimum delay to access the Internet; however, this is suboptimal for the whole system. In this thesis, we propose a simple channel assignment heuristic algorithm which is easy for implementation and makes each node have locally maximal parallel transmission. We also propose a distributed QoS (Quality-of-Service) constrained routing algorithm which takes “system perspective” and “user perspective” into consideration; to achieve the goal, we define a routing metric which is composed of link mean delay and the derivative of queue length, and is derived from a Lagrangean Relaxation based problem formulation. We use link-state routing protocol for distributed routing and provide both K shortest paths and K fastest paths for each Origin-Destination pair, so that, this algorithm can be suitable for much more scenarios by the admission control heuristic algorithm we proposed. Finally, we evaluate the performance of Near-Optimal Distributed QoS Constrained (NODQC) routing algorithm via simulations. The simulation results show that our routing algorithm outperforms others in terms of average end-to-end delay, delay jitter and system throughput with QoS satisfaction in large-scale networks.
Subjects
Wireless Mesh Networks
Distributed Routing Algorithm
Link-State Routing Protocol
QoS Constrained Routing Algorithm
Lagrangean Relaxation
File(s)![Thumbnail Image]()
Loading...
Name
ntu-98-R96725005-1.pdf
Size
23.32 KB
Format
Adobe PDF
Checksum
(MD5):2ee790c33c9c9beb74d823a0953cb5ea