摘要
针对查询K近邻兴趣点方法多基于欧氏空间的不实用问题,提出了适用于路网环境下的查询方法。利用四叉树索引划分路网节点,用户基于划分结果,计算所在路段指向的路网顶点,以该顶点为出发点查询路网距离下的K近邻目标兴趣点。用户构造包含这K个目标兴趣点的匿名框并注入虚假兴趣点查询请求,LBS服务器只返回匿名框内的兴趣点查询结果。该方法在控制通信开销的同时,能够保护用户的位置隐私和查询内容隐私。
The current K nearest neighbor（KNN） query methods using cloaking region based on Euclidean space ,which were not applicable to the actual road networks. This paper proposed a KNN query method based on the distribution of places of in- terest （PoI） in road networks. LBS server organized the nodes in road networks into a lightweight and hierarchical grid struc- ture with quadtree index. Then, using the grid structure, a user computed the coming node based on his current location and ve- locity vector, and searched the KNN PoIs in road networks starting from the coming node. Finally, the user constructed a cloa- king region covered the K PoIs and injected fake queries into the query request, LBS server only returned the results in the cloaking region. The experiments show that the communication cost of this method is lower, the users＇ location privacy and que- ry content privacy are protected well, and the performance of this method is good.
出处
《计算机应用研究》
CSCD
北大核心
2016年第1期262-265,共4页
Application Research of Computers
基金
国家自然科学基金资助项目(61472097
61170241)
中央高校基础科研业务费重大专项资助项目(HEUCFZ1105)
高等学校博士学科点专项科研基金资助项目(20132304110017)
黑龙江省杰出青年基金资助项目(JC201117)
黑龙江省教育厅科学技术项目(12541788)
关键词
基于位置的服务
隐私保护
匿名框
K近邻查询
location-based service
privacy preserving
cloaking region
K nearest neighbor query
