首页> 外文期刊>Journal of Zhejiang university science >EDA: an enhanced dual-active algorithm for location privacy preservation in mobile P2P networks
【24h】

EDA: an enhanced dual-active algorithm for location privacy preservation in mobile P2P networks

机译:EDA:用于移动P2P网络中位置隐私保护的增强型双主动算法

获取原文
           

摘要

Various solutions have been proposed to enable mobile users to access location-based services while preserving their location privacy. Some of these solutions are based on a centralized architecture with the participation of a trustworthy third party, whereas some other approaches are based on a mobile peer-to-peer (P2P) architecture. The former approaches suffer from the scalability problem when networks grow large, while the latter have to endure either low anonymization success rates or high communication overheads. To address these issues, this paper deals with an enhanced dual-active spatial cloaking algorithm (EDA) for preserving location privacy in mobile P2P networks. The proposed EDA allows mobile users to collect and actively disseminate their location information to other users. Moreover, to deal with the challenging characteristics of mobile P2P networks, e.g., constrained network resources and user mobility, EDA enables users (1) to perform a negotiation process to minimize the number of duplicate locations to be shared so as to significantly reduce the communication overhead among users, (2) to predict user locations based on the latest available information so as to eliminate the inaccuracy problem introduced by using some out-of-date locations, and (3) to use a latest-record-highest-priority (LRHP) strategy to reduce the probability of broadcasting fewer useful locations. Extensive simulations are conducted for a range of P2P network scenarios to evaluate the performance of EDA in comparison with the existing solutions. Experimental results demonstrate that the proposed EDA can improve the performance in terms of anonymity and service time with minimized communication overhead.
机译:已经提出了各种解决方案,以使移动用户能够在保留其位置隐私的同时访问基于位置的服务。这些解决方案中的一些基于可信赖的第三方参与的集中式架构,而其他一些方法则基于移动对等(P2P)架构。当网络变大时,前一种方法会遇到可伸缩性问题,而后者则必须忍受较低的匿名成功率或较高的通信开销。为了解决这些问题,本文讨论了一种增强的双活动空间隐身算法(EDA),用于在移动P2P网络中保留位置隐私。提议的EDA允许移动用户收集并主动将其位置信息传播给其他用户。此外,为了应对移动P2P网络的挑战性特征,例如受约束的网络资源和用户移动性,EDA使用户(1)能够执行协商过程以最小化要共享的重复位置的数量,从而显着减少通信用户之间的开销;(2)根据最新的可用信息预测用户位置,以消除因使用某些过时的位置而引入的不准确问题;(3)使用最新记录的最高优先级( LRHP)策略,以减少广播较少的有用位置的可能性。针对各种P2P网络方案进行了广泛的仿真,以评估EDA与现有解决方案的性能。实验结果表明,提出的EDA可以在匿名性和服务时间方面提高性能,并最大程度地减少通信开销。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号