By Topic

Bandwidth guaranteed routing for ad-hoc networks with interference consideration

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

4 Author(s)
Zhanfeng Jia ; Dept. of Electr. Eng. & Comput. Sci., California Univ., Berkeley, CA, USA ; Gupta, R. ; Walrand, J. ; Varaiya, P.

The problem of computing bandwidth guaranteed paths for given flow requests in an ad-hoc network is complicated because neighboring links share the medium. We define the path width on top of the conflict-graph based interference model, and present the ad-hoc shortest widest path (ASWP) routing problem in an ad-hoc network context. We propose a distributed algorithm to address the ASWP problem. Adopting the Bellman-Ford architecture and the k-shortest-path approach, the proposed algorithm achieves a performance close to the optimum. Numerical simulations demonstrate the performance of the algorithm, and also analyze gains achieved over prevalent shortest-path algorithms.

Published in:

Computers and Communications, 2005. ISCC 2005. Proceedings. 10th IEEE Symposium on

Date of Conference:

27-30 June 2005