The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2008 vol.19)
pp: 4-14
ABSTRACT
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.
INDEX TERMS
Algorithm/protocol design and analysis, mobile communication systems, reducibility and completeness, routing protocols.
CITATION
Chun-Yuan Chiu, Yu-Liang Kuo, Eric Hsiao-Kuang Wu, Gen-Huey Chen, "Bandwidth-Constrained Routing Problem in Wireless Ad Hoc Networks", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 1, pp. 4-14, January 2008, doi:10.1109/TPDS.2007.70713
REFERENCES
[1] C. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM '94, pp. 233-244, 1994.
[2] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. INFOCOM '97, pp. 1405-1413, 1997.
[3] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in Ad-Hoc Wireless Networks,” Mobile Computing, vol. 5, pp. 153-181, 1996.
[4] C.E. Perkins and E.M. Royer, “Ad-Hoc on-Demand Distance Vector Routing,” Proc. IEEE Workshop Mobile Computing Systems and Applications (WMCSA '99), pp. 25-26, 1999.
[5] W.C. Lee, M.G. Hluchyi, and P.A. Humblet, “Routing Subject to Quality of Service Constraints in Integrated Communication Networks,” IEEE Network, vol. 9, pp. 46-55, 1995.
[6] S. Chen and K. Nahrstedt, “An Overview of Quality-of-Service Routing for the Next Generation High-Speed Networks: Problems and Solutions,” IEEE Network, special issue on transmission and distribution of digital video, vol. 12, pp. 64-79, 1998.
[7] C. Zhu and M.S. Corson, “QoS Routing for Mobile Ad Hoc Networks,” Proc. INFOCOM '02, pp. 958-967, 2002.
[8] M.R. Garey and D.S. Johnson, Computers and Intractability. Freeman, 1979.
[9] W.H. Liao, Y.C. Tseng, and K.P. Shih, “A TDMA-Based Bandwidth Reservation Protocol for QoS Routing in a Wireless Mobile Ad Hoc Network,” Proc. IEEE Int'l Conf. Comm. (ICC '02), pp. 3186-3190, 2002.
[10] K.P. Shih, C.Y. Chang, Y.D. Chen, and T.H. Chuang, “Dynamic Bandwidth Allocation for QoS Routing in TDMA-Based Mobile Ad Hoc Networks,” Computer Comm., vol. 29, pp. 1316-1329, 2006.
[11] C.R. Lin and J.S. Liu, “QoS Routing in Ad Hoc Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, pp. 1426-1438, 1999.
[12] Y.S. Chen, Y.C. Tseng, J.P. Sheu, and P.H. Kuo, “An On-Demand, Link-State, Multi-Path QoS Routing in a Wireless Mobile Ad-Hoc Network,” Computer Comm., vol. 27, pp. 27-40, 2004.
[13] L. Georgiadis, P. Jacquet, and B. Mans, “Bandwidth Reservation in Multihop Wireless Networks: Complexity, Mechanisms,” Proc. IEEE Int'l Conf. Distributed Computing Systems Workshops (ICDCSW '04), pp. 762-767, 2004.
[14] Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE 802.11 Working Group, IEEE Standard 802.11, Sept. 1999.
[15] M. Joa-Ng and I. Lu, “Spread Spectrum Medium Access Protocol with Collision Avoidance in Mobile Ad-Hoc Wireless Network,” Proc. INFOCOM '99, pp. 776-783, 1999.
[16] R. Sivakumar, P. Sinha, and V. Bharghavan, “CEDAR: A Core-Extraction Distributed Ad Hoc Routing Algorithm,” IEEE J.Selected Areas in Comm., vol. 17, pp. 1454-1465, 1999.
[17] Q. Xue and A. Ganz, “Ad Hoc QoS On-Demand Routing (AQOR) in Mobile Ad Hoc Networks,” J. Parallel and Distributed Computing, vol. 63, pp. 154-165, 2003.
[18] C.H. Hsu, Y.L. Kuo, H.K. Wu, and G.H. Chen, “QoS Routing in Mobile Ad Hoc Networks Based on the Enhanced Distributed Coordination Function,” Proc. IEEE Vehicular Technology Conf. (VTC '04), pp. 2663-2667, 2004.
[19] L. Chen and W.B. Heinzelman, “QoS-Aware Routing Based on Bandwidth Estimation for Mobile Ad Hoc Networks,” IEEE J.Selected Areas in Comm., vol. 23, pp. 561-572, 2005.
[20] Z. Jia, R. Gupta, J. Walrand, and P. Varaiya, “Bandwidth Guaranteed Routing for Ad-Hoc Networks with Interference Consideration,” Proc. IEEE Symp. Computer and Comm. (ISCC '05), pp. 3-9, 2005.
[21] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, pp. 388-404, 2000.
[22] H.N. Gabow, S.N. Maheshwari, and L.J. Osterweil, “On Two Problems in the Generation of Program Test Paths,” IEEE Trans. Software Eng., vol. 2, pp. 227-231, 1976.
[23] A. Muqattash and M. Kru, “CDMA-Based MAC Protocol for Wireless Ad Hoc Networks,” Proc. MobiHoc '03, pp. 153-164, 2003.
[24] X. Yang and G.D. Veciana, “Inducing Spatial Clustering in MAC Contention for Spread Spectrum Ad Hoc Networks,” Proc. MobiHoc '05, pp. 121-132, 2005.
[25] Y. Kanodia, C. Li, A. Sabharwal, B. Sadeghi, and E. Knightly, “Ordered Packet Scheduling in Wireless Ad Hoc Networks: Mechanisms and Performance Analysis,” Proc. MobiHoc '02, pp.58-70, 2002.
[26] M. Kodialam and T. Nandagopal, “Characterizing the Achievable Rates in Multihop Wireless Networks: The Joint Routing and Scheduling Problem,” Proc. MobiHoc '03, pp. 42-54, 2003.
[27] K. Jain, J. Padhye, V.N. Padmanabhan, and L. Qiu, “Impact of Interference on Multi-Hop Wireless Network Performance,” Proc. MobiHoc '03, pp. 66-80, 2003.
55 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool