By Topic

Bandwidth Guaranteed Scheduling and Shortest Path Routing in 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
$33 $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

2 Author(s)
Ziming Zeng ; Sch. of Inf. Manage., Wuhan Univ., Wuhan ; Liyi Zhang

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.

Published in:

2007 International Conference on Wireless Communications, Networking and Mobile Computing

Date of Conference:

21-25 Sept. 2007