ARMA: a scalable secure routing protocol with privacy protection for mobile ad hoc networks

With the rapidly growing popularity of mobile ad hoc networks (MANETs), many security concerns have arisen from this type of network. In particular, malicious nodes will jeopardize the security of mobile networks if the issues of secure data exchange are not handled properly. Encryption cannot fully protect the data communicated between nodes, as routing information may expose the identities of the communicating nodes and put their relationships at risk. In this paper, we propose an efficient anonymous routing protocol that uses a mobile agent paradigm for MANETs, which we refer to as ARMA. In our protocol, we take advantage of a trust system to prevent effectively the misbehavior of malicious nodes so that only trustworthy nodes are allowed to participate in communications. Furthermore, we present the Malicious Encryption and Malicious ID attacks, as well as other attacks, and note how our scheme is robust to them. Through the proof of protocol correctness, our protocol is analyzed to show how it offers provable security properties. Finally, we provide its performance evaluation based on simulation experiments implemented in an ns-2 simulator. Compared to the secure distributed route construction protocol (SDAR) protocol, our experimental results demonstrate that our scheme not only achieves the necessary anonymity in wireless and mobile networks, but also provides more security with reasonably little additional overhead. Copyright © 2009 John Wiley & Sons, Ltd. Malicious nodes will jeopardize the security of mobile ad hoc networks (MANETs) if the issues of secure data exchange are not handled properly, as routing information may expose the identities of the communicating nodes and put their relationships at risk. The proposed anonymous routing protocol employs a mobile agent paradigm for MANETs and a trust system to prevent effectively the misbehavior of malicious nodes so that only trustworthy nodes are allowed to participate in communications.

[1]  Azzedine Boukerche,et al.  Performance evaluation of an anonymity providing protocol for wireless ad hoc networks , 2006, Perform. Evaluation.

[2]  Ronggong Song,et al.  Anonymous Communications for Mobile Agents , 2002, MATA.

[3]  Nael B. Abu-Ghazaleh,et al.  Location verification and trust management for resilient geographic routing , 2007, J. Parallel Distributed Comput..

[4]  Levente Buttyán,et al.  Provably Secure On-Demand Source Routing in Mobile Ad Hoc Networks , 2006, IEEE Transactions on Mobile Computing.

[5]  Stefan Schlott,et al.  Secure Dynamic Source Routing , 2005, Proceedings of the 38th Annual Hawaii International Conference on System Sciences.

[6]  Danny B. Lange,et al.  Seven good reasons for mobile agents , 1999, CACM.

[7]  Yih-Chun Hu,et al.  Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks , 2005, Wirel. Networks.

[8]  Xiaoyan Hong,et al.  ANODR: anonymous on demand routing with untraceable routes for mobile ad-hoc networks , 2003, MobiHoc '03.

[9]  J. J. Garcia-Luna-Aceves,et al.  Securing distance-vector routing protocols , 1997, Proceedings of SNDSS '97: Internet Society 1997 Symposium on Network and Distributed System Security.

[10]  Azzedine Boukerche,et al.  A novel solution based on mobile agent for anonymity in wireless and mobile ad hoc networks , 2007, Q2SWinet '07.

[11]  Li Gong,et al.  Reasoning about belief in cryptographic protocols , 1990, Proceedings. 1990 IEEE Computer Society Symposium on Research in Security and Privacy.

[12]  Azzedine Boukerche,et al.  Algorithms and Protocols for Wireless and Mobile Ad Hoc Networks: Boukerche/Mobile , 2008 .

[13]  Wenjing Lou,et al.  Anonymous communications in mobile ad hoc networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Manel Guerrero Zapata Secure Ad hoc On-Demand Distance Vector (SAODV) Routing , 2006 .

[15]  Paul F. Syverson,et al.  Proxies for anonymous routing , 1996, Proceedings 12th Annual Computer Security Applications Conference.

[16]  Yih-Chun Hu,et al.  SEAD: secure efficient distance vector routing for mobile wireless ad hoc networks , 2002, Proceedings Fourth IEEE Workshop on Mobile Computing Systems and Applications.

[17]  David Chaum,et al.  Untraceable electronic mail, return addresses, and digital pseudonyms , 1981, CACM.

[18]  Azzedine Boukerche,et al.  Performance Evaluation of Routing Protocols for Ad Hoc Wireless Networks , 2004, Mob. Networks Appl..

[19]  Luciano Bononi,et al.  A Wireless Intrusion Detection System for Secure Clustering and Routing in Ad Hoc Networks , 2006, ISC.

[20]  Elizabeth M. Belding-Royer,et al.  A secure routing protocol for ad hoc networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[21]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[22]  Azzedine Boukerche,et al.  Performance Evaluation of an Anonymous Routing Protocol using Mobile Agents for Wireless Ad hoc Networks , 2007, 32nd IEEE Conference on Local Computer Networks (LCN 2007).

[23]  Panagiotis Papadimitratos,et al.  Secure Routing for Mobile Ad Hoc Networks , 2002 .

[24]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[25]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[26]  Martín Abadi,et al.  A logic of authentication , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.