By Topic

Bandwidth Guaranteed 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
$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

4 Author(s)
Yuanyuan Zeng ; Sch. of Comput., Wuhan Univ. ; Bo Xi ; Ziming Zeng ; Hao Wang

The bandwidth problem is one of the most serious problems for wireless mesh networks due to the influence of interference. In this paper, we present a distributed interference-aware bandwidth guaranteed shortest path routing protocol in IEEE 802.11-based multichannel wireless mesh networks with admission control. We design an interference-free distributed TDMA schedule to guarantee enough link flow. The simulation results show our protocol achieves good performance that it can effectively provide bandwidth guaranteed path for connection request comparing with minimal hop-count routing protocol.

Published in:

Communications and Networking in China, 2006. ChinaCom '06. First International Conference on

Date of Conference:

25-27 Oct. 2006