Bandwidth constrained routing problem in multi-hop wireless networks

Authors:
Chun-Yuan Chiu;Yu-Liang Kuo;Hsiao-Kuang Wu;Gen-Huey Chen
Affiliations:
National Taiwan University;National Taiwan University;National Central University;National Taiwan University
Venue:
Proceedings of the 9th ACM international symposium on Modeling analysis and simulation of wireless and mobile systems
Year:
2006

Citing 6
Cited 3

Ordered packet scheduling in wireless ad hoc networks: mechanisms and performance analysis

Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Bandwidth Reservation in Multihop Wireless Networks: Complexity and Mechanisms

ICDCSW '04 Proceedings of the 24th International Conference on Distributed Computing Systems Workshops - W7: EC (ICDCSW'04) - Volume 7
The capacity of wireless networks

IEEE Transactions on Information Theory
An on-demand, link-state, multi-path QoS routing in a wireless mobile ad-hoc network

Computer Communications
QoS routing in ad hoc wireless networks

IEEE Journal on Selected Areas in Communications
An overview of quality of service routing for next-generation high-speed networks: problems and solutions

IEEE Network: The Magazine of Global Internetworking

Interference and Congestion Aware Reservations in Wireless Multi-hop Networks

ADHOC-NOW '08 Proceedings of the 7th international conference on Ad-hoc, Mobile and Wireless Networks
Maximum Traffic Routing Problems in Wireless Mesh Networks

PCM '08 Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing
Application-centric routing for video streaming over multi-hop wireless networks

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Bandwidth-Constrained Routing Problem (BCRP) asks for a route that has sufficient bandwidth for data transmission. When BCRP is defined for wired networks, it can be solved in polynomial time. On the other hand, when it is defined for multi-hop wireless networks, it is NP-complete if the underlying MAC protocol is TDMA-based or CDMA-over-TDMA-based. In this paper, we show that BCRP is still NP-complete, even if CSMA-based or contention-based CDMA MAC protocols are used. Besides, we show that BCRP is polynomial-time solvable if the underlying MAC protocol adopts CDMA channel model and FIFO scheduling policy. In multi-hop wireless networks, no MAC protocol was designed before which would lead to a polynomial-time solution to BCRP. The results of this paper suggest a design principle for MAC protocols that can support QoS routing well.