当前位置: X-MOL 学术Imaging Sci. J. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Optimal anonymous location privacy protection algorithm based on grid user density
The Imaging Science Journal ( IF 0.871 ) Pub Date : 2020-04-02 , DOI: 10.1080/13682199.2020.1781406
Yalin Miao 1 , Huanhuan Jia 1 , Yang Zhang 1 , Xuemin Liu 1 , Tiantian Ji 1
Affiliation  

ABSTRACT The existing location anonymity algorithms do not consider the distribution of user density in the region. The area of anonymous domain is not the most appropriate and the query workload is redundant. To solve this problem, this paper proposes optimal anonymous location privacy protection algorithm based on grid user density. Taking the user density of the regional grid as the core and using reasonable dynamic shrinkage and expansion rules to find the most suitable anonymous domain, and reduces the anonymous domain as much as possible to meet the user privacy parameter configuration, thereby improving LBS service quality. This paper builds simulation dataset based on road network moving objects, and simulation experiments are performed on location privacy protection method, which proves the effectiveness of this method. At the same time, the real road network floating vehicle data is selected for the application of algorithm, which proves the feasibility of this method.

中文翻译:

基于网格用户密度的最优匿名位置隐私保护算法

摘要 现有的位置匿名算法没有考虑区域内用户密度的分布。匿名域的区域不是最合适的,查询工作量是多余的。针对这一问题,本文提出了基于网格用户密度的最优匿名位置隐私保护算法。以区域网格的用户密度为核心,利用合理的动态缩扩规则寻找最合适的匿名域,并尽可能减少匿名域以满足用户隐私参数配置,从而提高LBS服务质量。本文建立了基于路网移动对象的仿真数据集,并针对位置隐私保护方法进行了仿真实验,证明了该方法的有效性。同时,
更新日期:2020-04-02
down
wechat
bug