Title :
Bandwidth Guaranteed Scheduling and Shortest Path Routing in Wireless Mesh Networks
Author :
Zeng Ziming ; Zhang Liyi
Author_Institution :
Sch. of Inf. Manage., Wuhan Univ., Wuhan
Abstract :
The bandwidth problem is one of the most serious problems for multi-hop wireless mesh networks (WMNs) due to interference. We study joint problem of interference-aware bandwidth guaranteed scheduling and shortest path routing in IEEE 802.11-based multi-channel wireless mesh networks. We present distributed bandwidth guaranteed TDMA scheduling for given flow requests, and propose a shortest path routing based on k-shortest path with admission control. The results show our algorithm achieves good performance, and it effectively provides bandwidth guaranteed path for connection request.
Keywords :
bandwidth allocation; interference; radio networks; scheduling; telecommunication network routing; time division multiple access; IEEE 802.11; TDMA scheduling; admission control; interference-aware bandwidth guaranteed scheduling; k-shortest path routing; multihop wireless mesh networks; Admission control; Algorithm design and analysis; Bandwidth; Information management; Interference constraints; Routing; Scheduling algorithm; Spread spectrum communication; Time division multiple access; Wireless mesh networks;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2007. WiCom 2007. International Conference on
Conference_Location :
Shanghai
Print_ISBN :
978-1-4244-1311-9
DOI :
10.1109/WICOM.2007.429
