REAL: A RECIPROCAL PROTOCOL FOR LOCATION PRIVACY IN WIRELESS SENSOR NETWORKS

ABSTRACT

 K -anonymity has been used to protect location privacy for location monitoring services in wireless sensor networks (WSNs), where sensor nodes work together to report k -anonymized aggregate locations to a server. Each k -anonymized aggregate location is a cloaked area that contains at least k persons. However, we identify an attack model to show that overlapping aggregate locations still pose privacy risks because an adversary can infer some overlapping areas with less than k persons that violates the k -anonymity privacy requirement. In this paper, we propose a reciprocal protocol for location privacy (REAL) in WSNs. In REAL, sensor nodes are required to autonomously organize their sensing areas into a set of non-overlapping and highly accurate k -anonymized aggregate locations. To confront the three key challenges in REAL, namely, self-organization, reciprocity property and high accuracy, we design a state transition process, a locking mechanism and a time delay mechanism, respectively. We compare the performance of REAL with current protocols through simulated experiments. The results show that REAL protects location privacy, provides more accurate query answers, and reduces communication and computational costs.

AIM

The aim of this paper in REAL, sensor nodes are required to autonomously organize their sensing areas into a set of non-overlapping and highly accurate k -anonymized aggregate locations

SCOPE

The scope of this paper is to show that REAL protects location privacy, provides more accurate query answers, and reduces communication and computational costs.

EXISTING SYSTEM

With the advancement of sensor and wireless communication technologies, location monitor- ing applications have been developed for surveillance and location systems. Basically, location monitoring applications use sensors to gather personal locations and provide location-based services. However, with an untrustworthy server, an adversary may abuse its received location information to infer personal sensitive information. As a result, monitor- ing personal locations poses privacy threats to the monitored individuals

DISADVANTAGES

1. Self-organization
2.  reciprocity property
3.  high accuracy

PROPOSED SYSTEM

In this paper, we propose a reciprocal protocol for location privacy (REAL) in WSNs. In REAL, sensor nodes are required to autonomously organize their sensing areas into a set of non-overlapping and highly accurate k -anonymized aggregate locations. To confront the three key challenges in REAL, namely, self-organization, reciprocity property and high accuracy, we design a state transition process, a locking mechanism and a time delay mechanism, respectively. 

ADVANTAGES

1.  The state transition process to accomplish self-organization among sensor nodes
2. The locking mechanism to guarantee the reciprocity property.
3. The delay mechanism to improve the accuracy of aggregate locations.

SYSTEM ARCHITECTURE

 

SYSTEM CONFIGURATION

HARDWARE REQUIREMENTS:-

·                Processor          -   Pentium –III

·                Speed                -    1.1 Ghz

·                RAM                 -    256 MB(min)

·                Hard Disk         -   20 GB

·                Floppy Drive    -    1.44 MB

·                Key Board                 -    Standard Windows Keyboard

·                Mouse               -    Two or Three Button Mouse

·                Monitor             -    SVGA

SOFTWARE REQUIREMENTS:-

·                Operating System      :Android OS             

·                Front End                  : JAVA

·                Database                  : SqLite

·                Tool                           :Eclipse

REFERENCE:

Jia-Dong Zhang, and Chi-Yin Chow, “REAL: A RECIPROCAL PROTOCOL FOR LOCATION PRIVACY IN WIRELESS SENSOR NETWORKS” IEEE Transactions on  Dependable and Secure Computing, Year: 2015, Volume: 12, Issue: 4