Skip to main content

Locally Multipath Adaptive Routing Protocol Resilient to Selfishness and Wormholes

  • Conference paper
Book cover Information Security, Practice and Experience (ISPEC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 6047))

Abstract

Locally multipath adaptive routing (LMAR) protocol, classified as a new reactive distance vector routing protocol for MANETs is proposed in this paper. LMAR can find an ad-hoc path without selfish nodes and wormholes using a random search algorithm in polynomial-time. Also when the primary path fails, it discovers an alternative safe path if network graph remains connected after eliminating selfish/malicious nodes. The main feature of LMAR to seek safe route free of selfish and malicious nodes in polynomial time is its searching algorithm and flooding stage that its generated traffic is equiloaded compared to single-path routing protocols but its ability to bypass the attacks is much better than the other multi-path routing protocols. LMAR concept is introduced to provide the security feature known as availability and a simulator has been developed to analyze its behavior. Efficiency of the route discovery stage is analyzed and compared with the previous algorithms.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Perkins, C.E., Bhagwat, P.: Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers. In: Proc. of the ACM SIGCOMM (1994)

    Google Scholar 

  2. Perkins, C.E., Royer, E.M., Das, S.R.: Ad-hoc On-demand Distance Vector (AODV) routing. In: IETF MANET Group (Janaury 2002)

    Google Scholar 

  3. Johnson, D.B., Maltz, D.A., Hu, Y.C., Jetcheva, J.G.: The Dynamic Source Routing Protocol for Mobile Ad-hoc Networks. In: IETF MANET Group (February 2002)

    Google Scholar 

  4. Clausen, T., Jacquet, P.: RFC 3626: Optimized link state routing protocol OLSR (October 2003)

    Google Scholar 

  5. Balasubramanian, C., Garcia-Luna-Aceves, J.J.: Shortest Multipath Routing Using Labeled Distances. In: Proc. of 1st IEEE MASS (October 2004)

    Google Scholar 

  6. Marina, M.K., Das, S.R.: On-Demand multipath distance vector routing in ad hoc networks. In: Proc. IEEE ICNP (2001)

    Google Scholar 

  7. Nasipuri, A., Castaneda, R., Das, S.R.: Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks. In: ACM/Kluwer Mobile Networks and Applications MONET (2001)

    Google Scholar 

  8. Valera, A., Seah, W., Rao, S.V.: Cooperative packet caching and shortest multipath routing in mobile ad hoc networks. In: Proc. IEEE INFOCOM (2003)

    Google Scholar 

  9. Park, V.D., Corson, M.S.: A highly adaptive distributed routing algorithm for mobile wireless networks. In: Proc. IEEE INFOCOM (1997)

    Google Scholar 

  10. Lee, S., Gerla, M.: Split Multipath routing with maximally disjoint paths in ad hoc networks. In: Proc. IEEE ICC (2001)

    Google Scholar 

  11. Raju, J., Garcia-Luna-Aceves, J.J.: A new approach to on-demand loop-free multipath routing. In: Proc. IC3N (1999)

    Google Scholar 

  12. Michiardi, P., Molva, R.: Simulation-based Analysis of Security Exposures in Mobile Ad Hoc Networks. In: Proc. European Wireless Conference (2002)

    Google Scholar 

  13. Buttyan, L., Hubaux, J.-P.: Nuglets: a virtual currency to stimulate cooperation in self-organized ad hoc networks, Technical Report DSC/2001/001 (2001)

    Google Scholar 

  14. Buchegger, S., Le Boudec, J.-Y.: Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks. In: 10th Euro-micro Workshop on Parallel, Distributed and Network-based Processing

    Google Scholar 

  15. Michiardi, P., Molva, R.: CORE: A Collaborative Reputation mechanism to enforce node cooperation in Mobile Ad Hoc Networks. In: IFIP - Communication and Multimedia Security Conference (2002)

    Google Scholar 

  16. Yang, H., Meng, X., Lu, S.: Self-Organized Network-Layer Security in MANETs

    Google Scholar 

  17. Perrig, A., Hu, Y.-C., Johnson, D.B.: Wormhole Protection in Wireless Ad Hoc Networks. Technical Report TR01-384, Dep. of Computer Science, Rice University

    Google Scholar 

  18. Hu, Y.-C., Perrig, A., Johnson, D.B.: Packet Leashes: A Defense against Wormhole Attacks in Wireless Ad Hoc Networks. In: Proc. of INFOCOM 2003 (April 2003)

    Google Scholar 

  19. Hu, L., Evans, D.: Using Directional Antennas to Prevent Wormhole Attacks. In: Network and Distributed System Security Symposium (NDSS), San Diego (February 2004)

    Google Scholar 

  20. Lazos, L., Poovendran, R., Meadows, C., Syverson, P., Chang, L.W.: Preventing Wormhole Attacks on Wireless Ad-hoc Networks: A Graph Theoretic Approach. In: IEEE Wireless Communications and Networking Conference (2005)

    Google Scholar 

  21. Song, N., Qian, L., Li, X.: Wormhole Attacks Detection in Wireless Ad-hoc Networks: A Statistical Analysis Approach. In: IPDPS. IEEE, Los Alamitos (2005)

    Google Scholar 

  22. Wang, B., Soltani, S., Shapiro, J., Tan, P.: Local detection of selfish routing behavior in ad hoc networks. In: ISPAN. IEEE, Los Alamitos (2005)

    Google Scholar 

  23. Khabbazian, M., Mercier, H., Bhargava, V.K.: Wormhole Attack in Wireless Ad Hoc Networks: Analysis and Countermeasure. In: Global Telecommunications Conference. IEEE, Los Alamitos (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Farhat, F., Pakravan, MR., Salmasizadeh, M., Aref, MR. (2010). Locally Multipath Adaptive Routing Protocol Resilient to Selfishness and Wormholes. In: Kwak, J., Deng, R.H., Won, Y., Wang, G. (eds) Information Security, Practice and Experience. ISPEC 2010. Lecture Notes in Computer Science, vol 6047. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12827-1_14

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-12827-1_14

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-12826-4

  • Online ISBN: 978-3-642-12827-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics