Using Data Mules to Preserve Source Location Privacy in Wireless Sensor Networks

Wireless sensor networks (WSNs) have many promising applications for monitoring critical regions, such as in military surveillance and target tracking. In such applications, privacy of the location of the source sensor is of utmost importance as its compromise may reveal the location of the object being monitored. Traditional security mechanisms, like encryption, have proven to be ineffective as location of the source can also be revealed by analysis of the direction of traffic flow in the network. In this paper, we investigate the source-location privacy issue. We first propose a semi-global eavesdropping attack model which we show as being more realistic than the local or global eavesdropping attack model discussed in literature. In this model, we use a linear-regression based traffic analysis technique and show that it is effective in inferring the location of the data source under an existing source-location preserving technique. To measure source location privacy against this semi-global eavesdropping, we define an α-angle anonymity model. Additionally, we adapt the conventional function of data mules to design a new protocol for securing source location privacy, called the Mules-Saving-Source (MSS) protocol, which provides α-angle anonymity. We analyze the delay incurred by using data mules in our protocol and examine the association between privacy preservation and data delay in our protocol through simulation.

[1]  Jian Ren,et al.  Routing-based source-location privacy protection in wireless sensor networks , 2009, 2009 IEEE International Conference on Electro/Information Technology.

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

[3]  Sajal K. Das,et al.  Privacy preservation in wireless sensor networks: A state-of-the-art survey , 2009, Ad Hoc Networks.

[4]  Liang Zhang,et al.  Organizational memory: reducing source-sink distance , 1997, Proceedings of the Thirtieth Hawaii International Conference on System Sciences.

[5]  Chip Reinhardt,et al.  Taxi Cab Geometry: History and Applications! , 2005, The Mathematics Enthusiast.

[6]  Fillia Makedon,et al.  Entrapping adversaries for source protection in sensor networks , 2006, 2006 International Symposium on a World of Wireless, Mobile and Multimedia Networks(WoWMoM'06).

[7]  Donggang Liu,et al.  Location Privacy in Sensor Networks Against a Global Eavesdropper , 2007, 2007 IEEE International Conference on Network Protocols.

[8]  Hannes Hartenstein,et al.  Stochastic Properties of the Random Waypoint Mobility Model , 2004, Wirel. Networks.

[9]  Sencun Zhu,et al.  Towards event source unobservability with minimum network traffic in sensor networks , 2008, WiSec '08.

[10]  Feng Zhao,et al.  Information-Driven Dynamic Sensor Collaboration for Tracking Applications , 2002 .

[11]  Jian Ren,et al.  Mixing Ring-Based Source-Location Privacy in Wireless Sensor Networks , 2009, 2009 Proceedings of 18th International Conference on Computer Communications and Networks.

[12]  Sheldon M. Ross Introductory Statistics , 1995 .

[13]  Stephen A. McGuire,et al.  Introductory Statistics , 2007, Technometrics.

[14]  Feng Zhao,et al.  Information-driven dynamic sensor collaboration , 2002, IEEE Signal Process. Mag..

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

[16]  Jian Ren,et al.  Source-Location Privacy through Dynamic Routing in Wireless Sensor Networks , 2010, 2010 Proceedings IEEE INFOCOM.

[17]  B. Nordstrom FINITE MARKOV CHAINS , 2005 .

[18]  Wenbo Yang,et al.  Protecting Source Location Privacy in Wireless Sensor Networks with Data Aggregation , 2010, UIC.

[19]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.