Bandwidth-constrained routing problem in wireless Ad Hoc networks

Chun Yuan Chiu, Yu Liang Kuo, Eric Hsia Kuang Wu, Gen Huey Chen

Research output: Contribution to journalArticlepeer-review

27 Scopus citations

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 wireless ad-hoc 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 areused. Besides, we show that BCRP is polynomial-time solvable if the channel model is collision-free and the scheduling policy is FIFO. In wireless ad-hoc 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.

Original languageEnglish
Pages (from-to)4-14
Number of pages11
JournalIEEE Transactions on Parallel and Distributed Systems
Volume19
Issue number1
DOIs
StatePublished - Jan 2008

Keywords

  • Algorithm/protocol design and analysis
  • Mobile communication systems
  • Reducibility and completeness
  • Routing protocols

Fingerprint

Dive into the research topics of 'Bandwidth-constrained routing problem in wireless Ad Hoc networks'. Together they form a unique fingerprint.

Cite this