A Lightweight Anonymous On-demand Routing Scheme in Wireless Sensor Networks

In wireless sensor networks, all communications between any two sensor nodes occur in a shared and open wireless medium, which makes it easy for an adversary to eavesdrop on every message transmitted. While message encryption can protect the content exchanged between the nodes, routing information may reveal the identities of the communicating nodes and their relationships. For this purpose, the existing schemes used an onion packet, random walk, or storage migration to provide anonymity. These schemes incur high computation cost and communications cost. In this paper, we present a lightweight anonymous routing scheme to provide anonymous communications. In contrast to the existing schemes, we first use a Bloom filter to hide the identities of the sensor nodes, and thereafter, generate per-hop pseudo-link identifiers to accomplish routing and data packets forwarding tasks. This scheme not only conceals the node and the link identities in the data packets, but also helps to achieve traffic anonymity due to content analysis. In this paper, we describe not only the mechanisms to efficiently establish source routes and forward data packets anonymously, but also provide its proof of correctness.

[1]  Jehn-Ruey Jiang,et al.  An Anonymous Path Routing (APR) Protocol for Wireless Sensor Networks , 2011, J. Inf. Sci. Eng..

[2]  Ahmed Helmy,et al.  Rendezvous regions: a scalable architecture for service location and data-centric storage in large-scale wireless networks , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[3]  Phillip Rogaway,et al.  The Software Performance of Authenticated-Encryption Modes , 2011, FSE.

[4]  Rajendra V. Boppana,et al.  ACP: Anonymous communication protocol fo wireless sensor networks , 2011, 2011 IEEE Consumer Communications and Networking Conference (CCNC).

[5]  Azzedine Boukerche,et al.  ARMA: An Efficient Secure Ad Hoc Routing Protocol , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

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

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

[8]  Burton H. Bloom,et al.  Space/time trade-offs in hash coding with allowable errors , 1970, CACM.

[9]  Ian F. Akyildiz,et al.  Wireless sensor networks: a survey , 2002, Comput. Networks.

[10]  Suat Özdemir.  Functional Reputation Based Data Aggregation for Wireless Sensor Networks , 2008, WiMob.

[11]  Stefano Chessa,et al.  Dealing with Nonuniformity in Data Centric Storage for Wireless Sensor Networks , 2011, IEEE Transactions on Parallel and Distributed Systems.

[12]  Azzedine Boukerche,et al.  An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks , 2005, Comput. Commun..

[13]  Tal Rabin,et al.  Verifiable secret sharing and multiparty protocols with honest majority , 1989, STOC '89.

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

[15]  Denh Sy,et al.  On-Demand Anonymous Routing (ODAR) , 2009 .

[16]  A NezhadAlireza,et al.  Location privacy and anonymity preserving routing for wireless sensor networks , 2008 .

[17]  Denh Sy,et al.  ODAR: On-Demand Anonymous Routing in Ad Hoc Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[18]  Dimitrios Makrakis,et al.  Location privacy and anonymity preserving routing for wireless sensor networks , 2008, Comput. Networks.

[19]  Srdjan Capkun,et al.  Secure positioning of wireless devices with application to sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[21]  Roksana Boreli,et al.  TARo: Trusted Anonymous Routing for MANETs , 2010, 2010 IEEE/IFIP International Conference on Embedded and Ubiquitous Computing.

[22]  Wensheng Zhang,et al.  ElliPS: A Privacy Preserving Scheme for Sensor Data Storage and Query , 2009, IEEE INFOCOM 2009.

[23]  Paul F. Syverson,et al.  Anonymous connections and onion routing , 1997, Proceedings. 1997 IEEE Symposium on Security and Privacy (Cat. No.97CB36097).