Title :
Joint bandwidth guaranteed scheduling and shortest path routing algorithms in multi-channel wireless mesh networks
Author :
Xiang, Kai ; Zeng, Yuanyuan ; Wang, Tong
Author_Institution :
Sch. of Comput., Hubei Univ. of Econ., Wuhan, China
Abstract :
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.
Keywords :
radiofrequency interference; scheduling; telecommunication congestion control; telecommunication network routing; time division multiple access; wireless LAN; wireless mesh networks; IEEE 802.11; WMN; admission control; connection request; distributed bandwidth guaranteed TDMA scheduling; dynamic traffic; interference-aware bandwidth guaranteed scheduling algorithm; k-shortest path approach; link interference; minimal hop-count routing algorithm; multichannel wireless mesh networks; multihop wireless mesh networks; shortest path routing algorithm; Bandwidth; Communication system traffic control; Dynamic scheduling; Interference; Routing; Scheduling algorithm; Spread spectrum communication; Time division multiple access; Traffic control; Wireless mesh networks;
Conference_Titel :
Future Computer and Communication (ICFCC), 2010 2nd International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-5821-9
DOI :
10.1109/ICFCC.2010.5497510
