Performance evaluation of an anonymity providing protocol for wireless ad hoc networks

Malicious nodes in a mobile and wireless ad hoc network can be a threat to the security and/or anonymity of the exchanged data. While data encryption can protect the content exchanged between nodes, routing information may reveal the identities of communicating nodes and their relationships. This paper describes our effort to provide anonymous communication services in mobile and wireless ad hoc networks and proposes an anonymous routing protocol. Our protocol includes a mechanism to establish a trust among mobile nodes while avoiding untrustworthy nodes during the route discovery process. The major objective of our protocol is to allow only trustworthy intermediate nodes to participate in the routing protocol without jeopardizing the anonymity of the communicating nodes. We first present our scheme, and then report on its performance using an extensive set of simulation experiments using an ns-2 simulator. Compared to the non-secure DSR ad hoc routing protocol, our results indicate clearly that anonymity can be achieved in mobile ad hoc networks, and the additional overhead of our scheme is reasonably low.

[1]  Nitin H. Vaidya,et al.  A dynamic mix method for wireless ad hoc networks , 2001, 2001 MILCOM Proceedings Communications for Network-Centric Operations: Creating the Information Force (Cat. No.01CH37277).

[2]  U. Chatterjee,et al.  Effect of unconventional feeds on production cost, growth performance and expression of quantitative genes in growing pigs , 2022, Journal of the Indonesian Tropical Animal Agriculture.

[3]  David Chaum,et al.  The dining cryptographers problem: Unconditional sender and recipient untraceability , 1988, Journal of Cryptology.

[4]  David A. Maltz,et al.  DSR: the dynamic source routing protocol for multihop wireless ad hoc networks , 2001 .

[5]  Jing Liu,et al.  Secure Routing for Mobile Ad Hoc Networks , 2007, Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing (SNPD 2007).

[6]  Robert Tappan Morris,et al.  Tarzan: a peer-to-peer anonymizing network layer , 2002, CCS '02.

[7]  Tomasz Imielinski,et al.  Mobile Computing , 1996 .

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

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

[10]  Svein Haavik,et al.  Spread Spectrum in Mobile Communication , 1998 .

[11]  Nitin H. Vaidya,et al.  Preventing traffic analysis in packet radio networks , 2001, Proceedings DARPA Information Survivability Conference and Exposition II. DISCEX'01.

[12]  Christopher Allen,et al.  The TLS Protocol Version 1.0 , 1999, RFC.

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

[14]  Robert Tappan Morris,et al.  Introducing Tarzan, a Peer-to-Peer Anonymizing Network Layer , 2002, IPTPS.

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

[16]  Donal O'Mahony,et al.  Secure routing for mobile ad hoc networks , 2005, IEEE Communications Surveys & Tutorials.

[17]  Michael K. Reiter,et al.  Crowds: anonymity for Web transactions , 1998, TSEC.

[18]  Azzedine Boukerche Handbook of Algorithms for Wireless Networking and Mobile Computing , 2005 .

[19]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

[20]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[21]  Ram Ramanathan,et al.  On the performance of ad hoc networks with beamforming antennas , 2001, MobiHoc '01.

[22]  Randall J. Atkinson,et al.  Security Architecture for the Internet Protocol , 1995, RFC.

[23]  Robin Kravets,et al.  Security-aware ad hoc routing for wireless networks , 2001, MobiHoc '01.

[24]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[25]  Hugo Krawczyk,et al.  A Security Architecture for the Internet Protocol , 1999, IBM Syst. J..

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

[27]  Ram Ramanathan,et al.  Ad hoc networking with directional antennas: a complete system solution , 2004, IEEE Journal on Selected Areas in Communications.

[28]  Brian Neil Levine,et al.  A protocol for anonymous communication over the Internet , 2000, CCS.

[29]  Dharma P. Agrawal,et al.  Strategies for enhancing routing security in protocols for mobile ad hoc networks , 2003, J. Parallel Distributed Comput..

[30]  Bernhard Plattner,et al.  Introducing MorphMix: peer-to-peer based anonymous Internet usage with collusion detection , 2002, WPES '02.

[31]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1998, IEEE J. Sel. Areas Commun..

[32]  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..

[33]  J. J. Garcia-Luna-Aceves,et al.  Secure hierarchical multicast routing and multicast internet anonymity , 1999 .

[34]  H Deng,et al.  ROUTING SECURITY IN AD HOC NETWORKS , 2002 .

[35]  Charles E. Perkins,et al.  Ad Hoc Networking , 2001 .

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

[37]  Janne Lundberg Routing Security in Ad Hoc Networks , 2000 .