Performance evaluation of anonymous routing protocols in MANETs

Mobile ad hoc networks require anonymous communications in order to thwart new wireless passive attacks; and to protect new assets of information such as nodes' locations, motion patterns, network topology and traffic patterns in addition to conventional identity and message privacy. In particular, in wireless ad hoc networks mobile nodes must rely on ad hoc routing to keep network functional for communication. The transmitted routing messages and cached active routing entries leave plenty of opportunities for eavesdroppers. To address the new challenges, several anonymous routing schemes have been proposed recently. However, in various network scenarios, how the different cryptographic operations impact the routing performance remains unclear. In this paper we investigate the impact from cryptographic operations needed for the anonymous features. The overhead considered includes both increased control packet size and prolonged processing delay. The protocols taken into account include ANODR, AnonDSR, ASR, MASK, and SDAR. We present results based on extensive simulation study. We use the standard/unprotected on-demand scheme AODV in the comparison to show how much cost is paid by each anonymous on-demand scheme. Our simulation study shows that various design choices in anonymous routing indeed trade performance with anonymity protection. We conclude that extensive performance study is needed to evaluate the practicality of any enhancement of these proposed schemes and any new anonymous routing schemes

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

[2]  Andreas Pfitzmann,et al.  Anonymity, Unobservability, and Pseudonymity - A Proposal for Terminology , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[3]  Douglas Stebila,et al.  Performance analysis of elliptic curve cryptography for SSL , 2002, WiSE '02.

[4]  Mingyan Liu,et al.  Sound mobility models , 2003, MobiCom '03.

[5]  Azzedine Boukerche,et al.  SDAR: a secure distributed anonymous routing protocol for wireless and mobile ad hoc networks , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[6]  Dogan Kesdogan,et al.  Stop-and-Go-MIXes Providing Probabilistic Anonymity in an Open System , 1998, Information Hiding.

[7]  Xiaoyan Hong,et al.  Mobility changes anonymity: mobile ad hoc networks need efficient anonymous routing , 2005, 10th IEEE Symposium on Computers and Communications (ISCC'05).

[8]  Yunghsiang Sam Han,et al.  A pairwise key pre-distribution scheme for wireless sensor networks , 2003, CCS '03.

[9]  Silvio Micali,et al.  Probabilistic Encryption , 1984, J. Comput. Syst. Sci..

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

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

[12]  Birgit Pfitzmann,et al.  ISDN-MIXes: Untraceable Communication with Small Bandwidth Overhead , 1991, Kommunikation in Verteilten Systemen.

[13]  Hannes Federrath,et al.  Web MIXes: A System for Anonymous and Unobservable Internet Access , 2000, Workshop on Design Issues in Anonymity and Unobservability.

[14]  Ronggong Song,et al.  AnonDSR: efficient anonymous dynamic source routing for mobile ad-hoc networks , 2005, SASN '05.

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

[16]  Los Angeles,et al.  Anonymous and Untraceable Communications in Mobile Wireless Networks , 2004 .

[17]  Yunghsiang Sam Han,et al.  A pairwise key predistribution scheme for wireless sensor networks , 2005, TSEC.

[18]  Mohan S. Kankanhalli,et al.  Anonymous secure routing in mobile ad-hoc networks , 2004, 29th Annual IEEE International Conference on Local Computer Networks.

[19]  Mingyan Liu,et al.  A general framework to construct stationary mobility models for the simulation of mobile networks , 2006, IEEE Transactions on Mobile Computing.

[20]  Diana K. Smetters,et al.  Secret handshakes from pairing-based key agreements , 2003, 2003 Symposium on Security and Privacy, 2003..