位置隐私保护下的连续最近邻查询  

Continous Nearest-Neighbor Query in Location Privacy Preserving

作　　者：王勇[1] 董一鸿[1] 钱江波[1] 陈华辉[1] WANG Yong DONG Yi-hong QIAN Jiang-bo CHEN Hua-hui(College of Information Science and Engineering, Ningbo University, Zhejiang Ningbo 315211, China)

机构地区：[1]宁波大学信息科学与工程学院,浙江宁波315211

出　　处：《北京邮电大学学报》2016年第5期83-88,共6页Journal of Beijing University of Posts and Telecommunications

基　　金：国家自然科学基金项目(61472194);浙江省自然科学基金项目(LY16F020003)

摘　　要：已有的位置隐私保护下的连续最近邻查询往往采用snapshot方式进行,导致较高的中央处理器开销.为此,研究了基于位置隐私的连续最近邻查询,提出了基于重用技术的位置隐私保护的连续最近邻查询算法.该算法利用相邻时刻查询结果集的相似性来减少计算成本,从而实现答案集的快速更新,可大大加快系统响应时间.实验结果表明了该算法的有效性.Enjoying the location-based service（ LBS）,the mobile subscribers may threaten the disclosure of location privacy. To protect location privacy,an effective method for location privacy preserving was proposed to cloak the user＇s exact coordinates into a spatial region and turn the location-based query into region-based query. Existing continuous nearest-neighbor query algorithms with privacy-aware are based on snapshot,which incur higher central processing unit（ CPU） cost. The location privacy-based continuous nearest-neighbor query was studied and an algorithm named reusing-based location privacypreserving continuous nearest-neighbor query（ RLPCNN） which is based on reusing technique query updating was proposed. The algorithm can reduce the cost of computation by using the similarity between the two adjacent time and make the answer set updated quickly,which can quicken the response time markedly. The experiments show that the algorithm is effective and efficient.

关 键 词：位置服务 位置隐私 最近邻查询 连续查询 重用技术 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]