Research Area:  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.

Keywords:  

Author(s) Name:  Jia-Dong Zhang and Chi-Yin Chow

Publisher name:  IEEE

DOI:   10.1109/TDSC.2014.2366467

Volume Information:  Volume: 12, Issue: 4, July-Aug. 1 2015,Page(s): 458 - 471

Paper Link:   https://ieeexplore.ieee.org/document/6942208