Bandwidth-constrained routing problem in wireless Ad Hoc networks

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

研究成果: 雜誌貢獻期刊論文同行評審

27 引文 斯高帕斯(Scopus)


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.

頁(從 - 到)4-14
期刊IEEE Transactions on Parallel and Distributed Systems
出版狀態已出版 - 1月 2008


深入研究「Bandwidth-constrained routing problem in wireless Ad Hoc networks」主題。共同形成了獨特的指紋。