Joint bandwidth guaranteed scheduling and shortest path routing algorithms in multi-channel wireless mesh networks

The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the influence of link interference. In this paper, we study joint problem of interference-aware bandwidth guaranteed scheduling and shortest path routing in IEEE 802.11-based multi-channel wi...

Full description

Saved in:
Bibliographic Details
Published in2010 2nd International Conference on Future Computer and Communication Vol. 3; pp. V3-544 - V3-548
Main Authors Kai Xiang, Yuanyuan Zeng, Tong Wang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.05.2010
Subjects
Bandwidth
Communication system traffic control
Dynamic scheduling
Interference
Routing
Scheduling algorithm
Spread spectrum communication
Time division multiple access
Traffic control
Wireless mesh networks
Online AccessGet full text
ISBN9781424458219
1424458218
DOI10.1109/ICFCC.2010.5497510

Cover

More Information
Summary:The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to the influence of link interference. In this paper, we study joint problem of interference-aware bandwidth guaranteed scheduling and shortest path routing in IEEE 802.11-based multi-channel wireless mesh networks with dynamic traffic. We present distributed bandwidth guaranteed TDMA scheduling for given flow requests, and we propose a bandwidth guaranteed shortest path routing algorithm based on k-shortest path approach and admission control. The simulation results show our algorithm achieves good performance, and it can effectively provide bandwidth guaranteed path for connection request comparing with minimal hop-count routing algorithm.
ISBN:9781424458219
1424458218
DOI:10.1109/ICFCC.2010.5497510