Secure message transmission in mobile ad hoc networks
2003, Ad Hoc Networks
https://doi.org/10.1016/S1570-8705(03)00018-0Abstract
The vision of nomadic computing with its ubiquitous access has stimulated much interest in the mobile ad hoc networking (MANET) technology. However, its proliferation strongly depends on the availability of security provisions, among other factors. In the open, collaborative MANET environment, practically any node can maliciously or selfishly disrupt and deny communication of other nodes. In this paper, we propose the secure message transmission (SMT) protocol to safeguard the data transmission against arbitrary malicious behavior of network nodes. SMT is a lightweight, yet very effective, protocol that can operate solely in an end-to-end manner. It exploits the redundancy of multi-path routing and adapts its operation to remain efficient and effective even in highly adverse environments. SMT is capable of delivering up to 83% more data messages than a protocol that does not secure the data transmission. Moreover, SMT achieves up to 65% lower end-to-end delays and up to 80% lower delay variability, compared with an alternative single-path protocol--a secure data forwarding protocol, which we term secure single path (SSP) protocol. Thus, SMT is better suited to support quality of service for real-time communications in the ad hoc networking environment. The security of data transmission is achieved without restrictive assumptions on the network nodesÕ trust and network membership, without the use of intrusion detection schemes, and at the expense of moderate multi-path transmission overhead only.
References (24)
- P. Papadimitratos, Z.J. Haas, Secure routing for mobile ad hoc networks, in: Proceedings of the SCS Communica- tion Networks and Distributed Systems Modeling and Simulation Conference (CNDS 2002), San Antonio, TX, January 27-31, 2002.
- P. Papadimitratos, Z.J. Haas, P. Samar, The secure routing protocol (SRP) for ad hoc networks, Internet Draft, draft- papadimitratos-secure-routing-protocol-00.txt, December 2002.
- M.O. Rabin, Efficient dispersal of information for security, load balancing, and fault tolerance, J. ACM 36 (2) (1989) 335-348.
- H. Krawczyk, M. Bellare, R. Canetti, HMAC: Keyed- hashing for message authentication, RFC 2104, February 1997.
- P. Papadimitratos, Z.J. Haas, Secure link state routing for mobile ad hoc networks, in: Proceedings of the IEEE CS Workshop on Security and Assurance in Ad hoc Networks, in conjunction with the 2003 International Symposium on Applications and the Internet, Orlando, FL, January 2003.
- A. Tsirigos, Z.J. Haas, Multipath routing in the presence of frequent topological changes, IEEE Comm. Mag. (No- vember) (2001) 132-138.
- J. Broch, D.A. Maltz, D.B. Johnson, Y-C. Hu, J. Jetcheva, A Performance comparison of multi-hop wireless ad hoc network routing protocols, in: Proceedings of the 4th International Conference on Mobile Computing (Mobi- comÕ98), 1998.
- S. Kent, R. Atkinson, Security architecture for the Internet protocol, IETF RFC 2401, November 1998.
- S. Kent, R. Atkinson, IP authentication header, IETF FC 2402, November 1998.
- S. Kent, R. Atkinson, IP Encapsulating security payload, IETF FC 2406, November 1998.
- D. Maughan, M. Schertler, M. Schneider, J. Turner, Internet security association and key management proto- col, IETF RFC 2408, November 1998.
- Bluetooth Special Interest Group, Specifications of the bluetooth system, http://www.blutooth.com.
- R. Stewart et al., Stream control transmission protocol, IETF RFC 2960, October 2000.
- A. Bestavros, G. Kim, TCP-Boston: A fragmentation- tolerant TCP protocol for ATM networks, in: Proceedings of the IEEE InfocomÕ97, Kobe, Japan, April 1997.
- S. Marti, T.J. Giuli, K. Lai, M. Baker, Mitigating routing misbehavior in mobile ad hoc networks, in: Proceedings of the 6th MobiCom, Boston, MA, August 2000.
- L. Buttyan, J.P. Hubaux, Enforcing service availability in mobile ad hoc WANs, in: Proceedings of the 1st MobiHoc, Boston, MA, August 2000.
- W. Diffie, M.E. Hellman, New directions in cryptography, IEEE Trans. Inf. Theory 22 (1976).
- M.O. Rabin, Probabilistic algorithms in finite fields, SIAM J. Comput. 9 (1980).
- R. Zucceratto, C. Adams, Using elliptic curve Diffie- Hellman in the SPKM GSS-API, IETF Internet Draft, August 1999.
- S. Buchegger, J.Y. LeBoudec, Performance evaluation of the CONFIDANT protocol, in: Proceedings of the Third ACM Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc 2002), Lausanne, Switzerland, June 2002.
- B. Awerbuch, D. Holmer, C. Nita-Rotaru, H. Rubens, An on-demand secure routing protocol resilent to byzantine failures, in: Proceedings of the ACM WiSe 2002, Atlanta, GA, September 2002.
- R.K. Ahuja, T.L. Magnati, J.B. Olin, Network Flows, Prentice Hall, Upper Saddle River, NJ, 1993.
- C. Bettstetter, On the minimum node degree and connec- tivity of a wireless multihop network, in: Proceedings of the Third ACM Symposium on Mobile Ad Hoc Networking & Computing (MobiHoc 2002), Lausanne, Switzerland, June 2002.
- Y.-C. Hu, A. Perrig, D.B. Johnson, Ariadne: a secure on- demand routing protocol for ad hoc networks, in: Pro- ceedings of the 8th ACM International Conference on