Skip to main content

Multi-path QoS Routing in TDMA/CDMA Ad Hoc Wireless Networks

  • Conference paper
Grid and Cooperative Computing - GCC 2004 Workshops (GCC 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3252))

Included in the following conference series:

Abstract

This paper investigates the issues of QoS routing in TDMA/CDMA ad hoc networks. Since the available bandwidth is very limited in ad hoc networks, a QoS request will be blocked if there does not exist a path that can meet the QoS requirements, even though there is enough free bandwidth in the whole system. In this paper, we propose a scheme of using multiple paths between two nodes as the route for a QoS call. The aggregate bandwidth of the multiple paths can meet the bandwidth requirement and the delays of these paths are within the required bound. We also propose three strategies for choosing proper paths, namely, SPF, LBF, and LHBF. Extensive simulations have been conducted. The simulation results show that the proposed multiple paths routing scheme significantly reduces the system blocking rates in various network environments, especially when the network load is heavy.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Camp, T., Boleng, J., Williams, B., Wilcox, L., Navidi, W.: Performance comparison of two location based routing protocols for ad hoc networks. In: Proceedings of IEEE INFOCOM, pp. 1678–1687 (2002)

    Google Scholar 

  2. Chen, Y.-S., Ko, Y.-W., Lin, T.-L.: A Lantern-Tree-Based QoS Multicast Protocol with Reliable Mechanism for Wireless Ad-Hoc Networks. In: Proceedings of IEEE ICCCN 2002, Miami, Florida, U.S.A., October 14-16 (2002)

    Google Scholar 

  3. Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. Computer Communications Review, 234–244 (October 1994)

    Google Scholar 

  4. Boppana, R.V., Konduru, S.P.: An Adaptive Distance Vector Routing Algorithm for Mobile, Ad Hoc Networks. Infocom 3, 1753–1762 (2001)

    Google Scholar 

  5. Perkins, C.E., Royer, E.M., Das, S.R.: Ad hoc On-Demand Distance Vector (AODV) Routing. IETF Internet Draft (January 2002) (work in progress), http://www.ietf.org/internet-drafts/draft-ietf-manet-aodv-10.txt

  6. Johnson, D.B., Maltz, D.A., Broch, J.: DSR: The Dynamic Source Routing Protocol for Multi-Hop Wireless Ad Hoc Networks. In: Perkins, C.E. (ed.) Ad Hoc Networking, vol. ch. 5, pp. 139–172. Addison-Wesley, Reading (2001)

    Google Scholar 

  7. Sivakumar, R., Sinha, P., Bharghavan, V.: CEDAR: a core-extraction distributed ad hoc routing algorithm. IEEE Journal on Selected Areas in Communication 17(8), 1454–1465 (1999)

    Article  Google Scholar 

  8. Sivakumar, R., Das, B., Bharghavan, V.: An improved spine-based infrastructure for routing in ad hoc networks. In: Proceedings of the International Symposium on Computers and Communications, ISCC 1998 (1998)

    Google Scholar 

  9. Cidon, I., Rom, R., Shavitt, Y.: Analysis of multi-path routing. IEEE/ACM Transactions on Networking 7, 885–896 (1999)

    Article  Google Scholar 

  10. Nasipuri, A., Das, S.R.: On-demand multi-path routing for mobile ad hoc networks. In: IEEE ICCCN 1999, pp. 64–70. IEEE, Los Alamitos (1999)

    Google Scholar 

  11. Lee, S.J., Gerla, M.: AODV-BR: Backup routing in ad hoc network. In: IEEE WCNC 2000, pp. 1311–1316. IEEE, Los Alamitos (2000)

    Google Scholar 

  12. Pham, P., Perreau, S.: Performance Analysis of Reactive Shortest Path and Multi-path Routing Mechanism with Load Balancing. In: IEEE INFOCOM 2003 (2003)

    Google Scholar 

  13. Lou, W., Liu, W., Fang, Y.: SPREAD: Enhancing Data Confidentiality in Mobile Ad Hoc Networks. In: IEEE INFOCOM 2004 (2004)

    Google Scholar 

  14. Ganjali, Y., Keshavarzian, A.: Load Balancing in Ad Hoc Networks: Single-path Routing vs. Multi-path Routing. In: IEEE INFOCOM 2004 (2004)

    Google Scholar 

  15. Lin, C.R.: Admission control in time-slotted multihop mobile networks. IEEE Journal on Selected Areas in Communications 19(10), 1974–1983 (2001)

    Article  Google Scholar 

  16. Lin, C.R.: On-Demand QoS Routing in Multihop Mobile Networks. In: Proceedings of IEEE INFOCOM 2001, pp.1735–1744 (2002)

    Google Scholar 

  17. Lin, C.R., Liu, J.S.: QoS Routing in ad hoc wireless networks. IEEE J. Select. Areas Commum. 17, 1426–1438 (1999)

    Article  Google Scholar 

  18. Hu, L.: Distributed Code Assignment for CDMA Packet Radio Networks. IEEE/ACM Transactions on Networking 1(6), 668–677 (1993)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wu, H., Huang, C., Jia, X., He, Y. (2004). Multi-path QoS Routing in TDMA/CDMA Ad Hoc Wireless Networks. In: Jin, H., Pan, Y., Xiao, N., Sun, J. (eds) Grid and Cooperative Computing - GCC 2004 Workshops. GCC 2004. Lecture Notes in Computer Science, vol 3252. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30207-0_75

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30207-0_75

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23578-1

  • Online ISBN: 978-3-540-30207-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics