By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Kai Xiang ; Sch. of Comput., Hubei Univ. of Econ., Wuhan, China ; Yuanyuan Zeng ; Tong Wang

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.

Published in:

Future Computer and Communication (ICFCC), 2010 2nd International Conference on  (Volume:3 )

Date of Conference:

21-24 May 2010