Bandwidth Guaranteed Routing for Ad Hoc Networks with Interference Consideration

Authors:
Jean Walrand
Affiliations:
University of California at Berkeley
Venue:
ISCC '05 Proceedings of the 10th IEEE Symposium on Computers and Communications
Year:
2005

Citing 0
Cited 9

Sufficient rate constraints for QoS flows in ad-hoc networks

Ad Hoc Networks
Bandwidth-Constrained Routing Problem in Wireless Ad Hoc Networks

IEEE Transactions on Parallel and Distributed Systems
Interference aware cooperative routing for wireless ad hoc networks

Ad Hoc Networks
Interference aware multipath selection for video streaming in wireless ad hoc networks

IEEE Transactions on Circuits and Systems for Video Technology
Interference-aware QoS routing for multi-rate multi-radio multi-channel IEEE 802.11 wireless mesh networks

IEEE Transactions on Wireless Communications
An upper bound on multi-hop wireless network performance

ITC20'07 Proceedings of the 20th international teletraffic conference on Managing traffic performance in converged networks
Quality of Service in mobile ad hoc networks: a survey

International Journal of Ad Hoc and Ubiquitous Computing
An efficient joint channel assignment and QoS routing protocol for IEEE 802.11 multi-radio multi-channel wireless mesh networks

Journal of Network and Computer Applications
Coding- and interference-aware routing protocol in wireless networks

Computer Communications

Quantified Score

Hi-index	0.01

Visualization

Abstract

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 thek-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.