首页 | 本学科首页   官方微博 | 高级检索  
     

基于用户分布感知的移动P2P快速位置匿名算法
引用本文:许明艳,赵华,季新生,申涓.基于用户分布感知的移动P2P快速位置匿名算法[J].软件学报,2018,29(7):1852-1862.
作者姓名:许明艳  赵华  季新生  申涓
作者单位:国家数字交换系统工程技术研究中心, 河南 郑州 450002;移动互联网安全技术国家工程实验室, 北京 100876,国家数字交换系统工程技术研究中心, 河南 郑州 450002;移动互联网安全技术国家工程实验室, 北京 100876,国家数字交换系统工程技术研究中心, 河南 郑州 450002;移动互联网安全技术国家工程实验室, 北京 100876,国家数字交换系统工程技术研究中心, 河南 郑州 450002
基金项目:国家自然科学基金“网络空间拟态防御基础理论研究”资助项目(No.61521003)
摘    要:针对移动点对点(P2P)结构下位置隐私保护匿名区形成存在着通信开销大、匿名效率低以及成功率低等问题,提出了一种移动P2P结构下用户分布感知方案,用户在邻域内共享邻域加权密度参数,获取邻域用户实时分布信息,根据用户分布特征为用户推荐隐私参数及候选用户查找半径,帮助用户快速形成匿名区。仿真结果表明,该算法通信开销小,在满足移动P2P网络移动设备节能需求的同时,匿名区生成时间平均在500ms以下,平均成功率达到92%以上。

关 键 词:位置隐私  移动P2P网络  k-匿名  用户分布感知  隐私参数推荐
收稿时间:2017/5/18 0:00:00
修稿时间:2017/7/13 0:00:00

Distribution-Perceptive-Based Spatial Cloaking Algorithm for Location Privacy in Mobile Peer-to-Peer Enviroments
XU Ming-Yan,ZHAO Hu,JI Xin-Sheng and SHEN Juan.Distribution-Perceptive-Based Spatial Cloaking Algorithm for Location Privacy in Mobile Peer-to-Peer Enviroments[J].Journal of Software,2018,29(7):1852-1862.
Authors:XU Ming-Yan  ZHAO Hu  JI Xin-Sheng and SHEN Juan
Affiliation:China National Digital Switching System Engineering and Technological R & D Center, Zhengzhou 450002, China;National Engineering Laboratory for Mobile Network Security, Beijing 100876, China,China National Digital Switching System Engineering and Technological R & D Center, Zhengzhou 450002, China;National Engineering Laboratory for Mobile Network Security, Beijing 100876, China,China National Digital Switching System Engineering and Technological R & D Center, Zhengzhou 450002, China;National Engineering Laboratory for Mobile Network Security, Beijing 100876, China and China National Digital Switching System Engineering and Technological R & D Center, Zhengzhou 450002, China
Abstract:The mobile peer-to-peer environment is easier to implement in location privacy preserving research. The mobile users cooperate through P2P multi-hop routing to blur their accurate locations into a spatial cloaking region but most existing spatial cloaking algorithm cannot work well because of the high communication overhead, time consumption and the lower success rate. This paper proposes an algorithm that can recommend user''s privacy requirements based on getting user''s weighed density information in neighborhood and therefore help mobile users find enough collaborative users quickly. The approach shows great anonymization success rate by 92% through extensive simulation experiments for a range of P2P enviorment scenarios. It needs lower communication cost and less searching time than 500ms at the same time.
Keywords:location privacy  mobile peer-to-peer network  k-anonymity  user-distribution-perceptive  recommendation of privacy parameters
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号