On Performance Cost of On-demand Anonymous Routing Protocols in Mobile Ad Hoc Networks

[1]  Gregory A. Hansen,et al.  The Optimized Link State Routing Protocol , 2003 .

[2]  Andreas Pfitzmann,et al.  Networks Without User Observability: Design Options , 1985, EUROCRYPT.

[3]  Xiaoyan Hong,et al.  Mobility changes anonymity: new passive threats in mobile ad hoc networks , 2006, Wirel. Commun. Mob. Comput..

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

[5]  Alfred Menezes,et al.  PGP in Constrained Wireless Devices , 2000, USENIX Security Symposium.

[6]  Stamatios V. Kartalopoulos Asynchronous Transfer Mode , 1999 .

[7]  Helen J. Wang,et al.  A Framework for Location Privacy in Wireless Networks , 2005 .

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

[9]  Yongguang Zhang,et al.  Security in Mobile Ad-Hoc Networks , 2005 .

[10]  Wade Trappe,et al.  Source-location privacy in energy-constrained sensor network routing , 2004, SASN '04.

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

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

[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]  Frederic P. Miller,et al.  Advanced Encryption Standard , 2009 .

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

[16]  Birgit Pfitzmann,et al.  Real-time mixes: a bandwidth-efficient anonymity protocol , 1998, IEEE J. Sel. Areas Commun..

[17]  N. Asokan,et al.  Untraceability in mobile networks , 1995, MobiCom '95.

[18]  Wei Shyy,et al.  Flexible-wing-based Micro Air Vehicles , 2002 .

[19]  G. S. Vernam,et al.  Cipher Printing Telegraph Systems For Secret Wire and Radio Telegraphic Communications , 1926, Transactions of the American Institute of Electrical Engineers.

[20]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[21]  Rolf Blom,et al.  An Optimal Class of Symmetric Key Generation Systems , 1985, EUROCRYPT.

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

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

[24]  Hugo Krawczyk,et al.  Untraceable mobility or how to travel incognito , 1999, Comput. Networks.

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

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

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

[28]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

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

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

[31]  Daniel R. Simon,et al.  Cryptographic defense against traffic analysis , 1993, STOC.

[32]  Frank Stajano,et al.  Location Privacy in Pervasive Computing , 2003, IEEE Pervasive Comput..

[33]  Ying Zhang,et al.  Localization from mere connectivity , 2003, MobiHoc '03.

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

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

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

[37]  Shivakant Mishra,et al.  Intrusion tolerance and anti-traffic analysis strategies for wireless sensor networks , 2004, International Conference on Dependable Systems and Networks, 2004.

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

[39]  Marco Gruteser,et al.  USENIX Association , 1992 .

[40]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.

[41]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.

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

[43]  Xiaoyan Hong,et al.  An Identity-Free and On-Demand Routing Scheme against Anonymity Threats in Mobile Ad Hoc Networks , 2007, IEEE Transactions on Mobile Computing.

[44]  Xiaoyan Hong,et al.  A new set of passive routing attacks in mobile ad hoc networks , 2003, IEEE Military Communications Conference, 2003. MILCOM 2003..

[45]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[46]  Qi He,et al.  The quest for personal control over mobile location privacy , 2004, IEEE Communications Magazine.

[47]  M. Gerla,et al.  Anonymous and untraceable communications in mobile wireless networks , 2004 .

[48]  Markus Jakobsson,et al.  Discount Anonymous On Demand Routing for Mobile Ad hoc Networks , 2006, 2006 Securecomm and Workshops.

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

[50]  Fred L. Templin,et al.  Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) , 2004, RFC.

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