Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2016 (2016), Article ID 7164126, 16 pages
http://dx.doi.org/10.1155/2016/7164126
Research Article

LPPS: A Distributed Cache Pushing Based K-Anonymity Location Privacy Preserving Scheme

1State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210046, China
2Institute of Computer Science, University of Göttingen, Göttingen, Germany
3School of Data and Computer Science, Sun Yat-Sen University, Guangzhou 510006, China
4School of Computer Science & Tecnology, Beijing Information Science & Technology University, Beijing 100192, China

Received 3 December 2015; Accepted 2 June 2016

Academic Editor: Juan C. Cano

Copyright © 2016 Ming Chen et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

Recent years have witnessed the rapid growth of location-based services (LBSs) for mobile social network applications. To enable location-based services, mobile users are required to report their location information to the LBS servers and receive answers of location-based queries. Location privacy leak happens when such servers are compromised, which has been a primary concern for information security. To address this issue, we propose the Location Privacy Preservation Scheme (LPPS) based on distributed cache pushing. Unlike existing solutions, LPPS deploys distributed cache proxies to cover users mostly visited locations and proactively push cache content to mobile users, which can reduce the risk of leaking users’ location information. The proposed LPPS includes three major process. First, we propose an algorithm to find the optimal deployment of proxies to cover popular locations. Second, we present cache strategies for location-based queries based on the Markov chain model and propose update and replacement strategies for cache content maintenance. Third, we introduce a privacy protection scheme which is proved to achieve -anonymity guarantee for location-based services. Extensive experiments illustrate that the proposed LPPS achieves decent service coverage ratio and cache hit ratio with lower communication overhead compared to existing solutions.