Bandwidth-Constrained Routing Problem in Wireless Ad Hoc Networks

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

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on parallel and distributed systems 2008-01, Vol.19 (1), p.4-14
Hauptverfasser: Chun-Yuan Chiu, Yu-Liang Kuo, Wu, E.H.-K., Gen-Huey Chen
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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 prot.ocols are used. 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 for MAC protocols that can support QoS routing well.
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2007.70713