loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
10th IEEE Symposium on Computers and Communications (ISCC'05)
Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
Cartagena, Murcia, Spain
June 27-June 30
ISBN: 0-7695-2373-0
ASCII Text
x 
 
Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya, "Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration," Computers and Communications, IEEE Symposium on, pp. 3-9, 10th IEEE Symposium on Computers and Communications (ISCC'05), 2005.
 
 
BibTex
x
 
@article{ 10.1109/ISCC.2005.37,
author = {Zhanfeng Jia and Rajarshi Gupta and Jean Walrand and Pravin Varaiya},
title = {Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration},
journal ={Computers and Communications, IEEE Symposium on},
volume = {0},
year = {2005},
issn = {1530-1346},
pages = {3-9},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISCC.2005.37},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computers and Communications, IEEE Symposium on
TI - Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration
SN - 1530-1346
SP3
EP9
A1 - Zhanfeng Jia,
A1 - Rajarshi Gupta,
A1 - Jean Walrand,
A1 - Pravin Varaiya,
PY - 2005
KW - null
VL - 0
JA - Computers and Communications, IEEE Symposium on
ER -
 
Zhanfeng Jia, University of California at Berkeley
Rajarshi Gupta, University of California at Berkeley
Jean Walrand, University of California at Berkeley
Pravin Varaiya, University of California at Berkeley
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.
Citation:
Zhanfeng Jia, Rajarshi Gupta, Jean Walrand, Pravin Varaiya, "Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration," iscc, pp.3-9, 10th IEEE Symposium on Computers and Communications (ISCC'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.