Skip to main content

A Secure Routing Algorithm for MANET

  • Conference paper
Advances in Computation and Intelligence (ISICA 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5821))

Included in the following conference series:

  • 1360 Accesses

Abstract

Mobile ad hoc networking (MANET) bring great challenges in security due to its high dynamics, link vulnerability and complete decentralization. With routing being a critical aspect for MANETs, existing routing protocols however are not sufficient for security requirements. In this paper, we present a route discovery algorithm that mitigates the detrimental effects of malicious behavior, as to provide correct connectivity information. Our algorithm guarantees that fabricated, compromised, or replayed route replies would either be rejected or never reach back the querying node. Furthermore, the algorithm responsiveness is safeguarded under different types of attacks that exploit the routing algorithm itself. The sole requirement of the proposed scheme is the existence of a security association between the node initiating the query and the sought destination. Specifically, no assumption is made regarding the intermediate nodes, which may exhibit arbitrary and malicious behavior. The scheme is robust in the presence of a number of non-colluding nodes, and provides accurate routing information in a timely manner.

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. Johnson, D.B., et al.: The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks, Internet Draft, March 2. IETF MANET Working Group (2001)

    Google Scholar 

  2. Haas, Z.J., Perlman, M., Samar, P.: The Interzone Routing Protocol (IERP) for Ad Hoc Networks, June 1. IETF MANET Working Group (2001), draft-ietf-manetzone-ierp-01.txt

    Google Scholar 

  3. Haas, Z.J., Perlman, M.: The Performance of Query Control Schemes of the Zone Routing Protocol. IEEE/ACM Transactions on Networking 9(4), 427–438 (2001)

    Article  Google Scholar 

  4. Toh, C.K.: Associativity-Based Routing for Ad-Hoc Mobile Networks. Wireless Personal Communications 4(2), 1–36 (2007)

    Google Scholar 

  5. Gong, L., Needham, R., Yahalom, R.: Reasoning about Belief in Cryptographic Protocols. In: Proceedings of the 2000 IEEE Symposium on Research in Security and Privacy, pp. 234–248. IEEE Computer Society Press, Los Alamitos (2000)

    Google Scholar 

  6. Burrows, M., Abadi, M., Needham, R.: A Logic of Authentication. In: Proceedings of the 12th ACM Symposium on Operating Systems Principles, Arizona (December 2006); ACM Operating System Review  23(5), 1-13 (December 2006); Full version: DEC SRC Report No 39, CA (February 2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shi, S. (2009). A Secure Routing Algorithm for MANET. In: Cai, Z., Li, Z., Kang, Z., Liu, Y. (eds) Advances in Computation and Intelligence. ISICA 2009. Lecture Notes in Computer Science, vol 5821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04843-2_52

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04843-2_52

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04842-5

  • Online ISBN: 978-3-642-04843-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics