Skip to main content
Log in

SPREAD: Improving network security by multipath routing in mobile ad hoc networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

We propose and investigate the SPREAD scheme as a complementary mechanism to enhance secure data delivery in a mobile ad hoc network. The basic idea is to transform a secret message into multiple shares, and then deliver the shares via multiple paths to the destination so that even if a certain number of message shares are compromised, the secret message as a whole is not compromised. We present the overall system architecture and discuss three major design issues: the mathematical model for the generation and reconstruction of the secret message shares, the optimal allocation of the message shares onto multiple paths in terms of security, and the multipath discovery techniques in a mobile ad hoc network. Our extensive simulation results justify the feasibility and the effectiveness of the SPREAD approach.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8

Similar content being viewed by others

Notes

  1. Note that such path security information, p i , if made available, as we will discuss in the following section, is helpful in optimizing the secure path finding procedure. However, the unavailability or inaccuracy of such information does not diminish the effectiveness of SPREAD. In general, security can be improved by even blindly (e.g., assuming all the paths equally secure) spreading the traffic.

Reference

  1. W. Lou and Y. Fang, A survey on wireless security in mobile ad hoc networks: Challenges and available solutions, book chapter in: Ad Hoc Wireless Networking (Kluwer, May 2003).

    Google Scholar 

  2. L. Zhou and Z.J. Haas, Securing ad hoc networks, IEEE Network Magazine 13(6) (November/December 1999).

  3. J. Kong, P. Zerfos, H. Luo, S. Lu and L. Zhang, Providing robust and ubiquitous security support for manet, in: ICNP (2001)

  4. L. Eschenauer and V. Gligor, A key-management scheme for distributed sensor networks, in: ACM CCS 2002 (Washington, DC, 2002).

    Google Scholar 

  5. W. Du, J. Deng, Y. Han and P. Varshney, A pairwise key predistribution scheme for wireless sensor networks, in: ACM CCS 03 (2003).

  6. H. Chan, A. Perrig and D. Song, Randon key predistribution schemes for sensor networks, in: IEEE Symposium on Security and Privacy (SP’03) (Oakland, CA, May 2003).

  7. S. Zhu, S. Xu, S. Setia and S. Jajodia, Establishing pairwise keys for secure communication in ad hoc networks: A probabilistic approach, in: 11th IEEE Internationaal Conference on Network Protocols (ICNP’03) (Atlanta, GA, November 2003)

  8. Y. Zhang, W. Liu, W. Lou and Y. Fang, Location-based compromise-tolerant security mechanisms for wireless sensor networks, IEEE Journal on Selected Areas in Communications (Special Issue on Security in Wireless Ad Hoc Networks) 24(2), (February 2006) 247–260.

    Article  Google Scholar 

  9. K. Ren, W. Lou and Y. Zhang, LEDS: Providing location-aware end-to-end data security in wireless sensor networks, in: IEEE INFOCOM 2006 (Barcelona, Spain, April 2006).

    Google Scholar 

  10. Y.-C. Hu, D.B. Johnson and A. Perrig, SEAD: Secure efficient distance vector routing for mobile wireless ad hoc networks, in: WMCSA'02

  11. Y.-C. Hu, A. Perrig and D.B. Johnson, Ariadne: A secure on-demand routing protocol for ad hoc networks, in: MobiCom 2002 (September 2002).

  12. P. Papadimitratos and Z.J. Haas, Secure routing for mobile ad hoc networks, in: CNDS 2002 (San Antonio, TX, January 2002)

    Google Scholar 

  13. H. Yang, X. Meng and S. Lu, Self-organized network-layer security in mobile ad hoc networks, in: ACM WiSe'02 (September 2002).

  14. Y. Zhang, W. Lee and Y. Huang, Intrusion detection techniques for mobile wireless networks, ACM Wireless Networks Journal 9(5) (Sep. 2003).

  15. S. Marti, T. Giuli, K. Lai and M. Baker, Mitigating routing misbehavior in mobile ad hoc networks, in: MobiCom'00 (Boston, MA, USA, August 2000).

  16. P. Papadimitratos and Z. Haas, Secure data transmission in mobile ad hoc networks, in: WiSe’03 (San Diego, CA, September 2003).

  17. S.-J. Lee and M. Gerla, Split multipath routing with maximally disjoint paths in ad hoc networks, in: ICC’01.

  18. M.R. Pearlman, Z.J. Haas, P. Sholander and S.S. Tabrizi, On the impact of alternate path routing for load balancing in mobile ad hoc networks, in: MobiHOC (2000)

  19. K. Wu and J. Harms, Performance study of a multipath routing method for wireless mobile ad hoc networks, in: 9th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication System (2001)

  20. A. Tsirigos and Z.J. Haas, Analysis of multipath routing, part 1: The effect on the packet delivery ratio, IEEE Transactions on Wireless Communications 3(Issue 1) (Jan 2004) 138–146

    Article  Google Scholar 

  21. A. Tsirigos and Z.J. Haas, Analysis of multipath routing, part 2: Mitigation of the effects of frequently changing network topologies, IEEE Transactions on Wireless Communications 3(Issue 2) (March 2004) 500–511.

    Article  Google Scholar 

  22. P. Papadimitratos, Z.J. Haas and E.G. Sirer, Path set selection in mobile ad hoc networks, The ACM Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc’2002), EPFL Lausanne, Switzerland (June 2002).

  23. W. Lou and Y. Fang, A multipath routing approach for secure data delivery, in: IEEE Military Communications Conference (MILCOM 2001) (Mclean, VA, USA, Oct. 2001).

  24. W. Lou, W. Liu and Y. Fang, SPREAD: Improving network security by multipath routing, in: IEEE Military Communications Conference (MILCOM 2003) (Boston, M, Oct. 2003).

  25. W. Lou, W. Liu and Y. Fang, SPREAD: Enhancing data confidentiality in mobile ad hoc networks, in: IEEE INFOCOM 2004 (Hong Kong, China, Mar 2004).

    Google Scholar 

  26. A. Shamir, How to Share a Secret, Communications of the ACM 22(11) (Nov 1979) 612–613.

    Article  MATH  MathSciNet  Google Scholar 

  27. T.-C. Wu and T.-S. Wu, Cheating detection and cheater identification in secret sharing schemes, IEE Proc. Comput. Digit. Tech. 142(5) (September 1995).

  28. W. Lou and Y. Fang, Predictive caching strategy for on-demand routing protocols in ad hoc networks, Wireless Networks 8(6) (Nov 2002).

  29. T. Cormen, C. Leiserson and R. Rivest, Introduction to Algorithms (MIT Press, 1990).

    Google Scholar 

  30. Y. Sun, W. Yu, Z. Han and K.J.R. Liu, Information theoretic framework of trust modelling and evaluation for ad hoc networks, IEEE Journal on Selected Areas in Communications (Special Issue on Security in Wireless Ad Hoc Networks) 24(2) (February 2006) 305–317.

    Article  MATH  Google Scholar 

  31. S. Chen and K. Nahrstedt, An overview of quality of service routing for next-generation high-speed networks: problems and solutions, IEEE Networks 12(6) (November/December 1998) 64–79.

    Article  Google Scholar 

  32. R. Bhandari, Survivable Networks—Algorithms for Diverse Routing (Kluwer Academic Publisher, 1999).

    Google Scholar 

  33. J.W. Suurballe, Disjoint paths in a network, Networks 4 (1974) 125–145.

    Article  MATH  MathSciNet  Google Scholar 

  34. J.W. Suurballe and R.E. Tarjan, A quick method for finding shortest pairs of disjoint paths, Networks 14 (1984) 325–336.

    Article  MATH  MathSciNet  Google Scholar 

  35. http://www.opnet.com

  36. J.R. Douceur, The Sybil attack, in: 1st International Workshop on Peer-to-Peer Systems (IPTPS’02) (March 2002).

  37. C. Karlof and D. Wagner, Secure routing in wilress sensor networks: Attacks and countermeasures, in: 1st IEEE Interntaional Conference on Sensor Network Protocols and Applications (May 2003).

  38. J. Newsome, E. Shi, D. Song and A. Perrig, The Sybill attack in sensor networks: Analysis & defenses, in: IPSN’04 (Berkelwy, CA, April 2004).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuguang Fang.

Additional information

This work was supported in part by the US Office of Naval Research Young Investigator Award under grant N000140210464 and the US National Science Foundation under grants CNS-0626881, CNS-0626601 and ANI-0093241 (CAREER Award).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Lou, W., Liu, W., Zhang, Y. et al. SPREAD: Improving network security by multipath routing in mobile ad hoc networks. Wireless Netw 15, 279–294 (2009). https://doi.org/10.1007/s11276-007-0039-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-007-0039-4

Keywords

Navigation