The Community for Technology Leaders
Green Image
The bandwidth-constrained routing problem (BCRP) asks for a route that has sufficient bandwidth for datatransmission. When BCRP is defined for wired networks, it can be solved in polynomial time. On the other hand, when it isdefined for wireless ad-hoc networks, it is NP-complete if the underlying MAC protocol is TDMA-based or CDMA-over-TDMAbased.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 isFIFO. 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.
Algorithm/protocol design and analysis, mobile communication systems, reducibility and completeness, routing protocols.
Eric Hsiao-Kuang Wu, Gen-Huey Chen, Chun-Yuan Chiu, Yu-Liang Kuo, "Bandwidth-Constrained Routing Problem in Wireless Ad Hoc Networks", IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 4-14, January 2008, doi:10.1109/TPDS.2007.70713
93 ms
(Ver 3.3 (11022016))