首页> 外文期刊>Concurrency and computation: practice and experience >DALP: A demand-aware location privacy protection scheme in continuous location-based services
【24h】

DALP: A demand-aware location privacy protection scheme in continuous location-based services

机译:DALP:基于连续位置服务的需求感知位置隐私保护方案

获取原文
获取原文并翻译 | 示例

摘要

Location-based services (LBSs) via mobile handheld devices have been subject to major privacy concerns for users. Currently, most of the existing works concerning the continuous LBS queries mainly focus on users' privacy demands with little consideration of the service of quality (QoS). In this paper, we propose a demand-aware location protection scheme for continuous LBS requests, allowing a user to customize not only location privacy but also QoS requirement, while this results that in considerably many queries points, the privacy and QoS requirement cannot be met together, and the location privacy protection cannot be provided for the continuous LBS queries. We point out that its underlying reason is that in few LBS query regions, the footprints are sparse or the privacy requirements are set unreasonably high. Therefore, a maximum demands-aware query sequence algorithm is proposed in the scheme. Through identifying and restraining the queries in those regions, most of LBS queries are satisfied; thus, the longest LBS query sequence is obtained, which can satisfy a user's specific privacy and QoS requirements simultaneously. Furthermore, on the premise that the user's privacy requirement is met, in demand-aware location protection scheme, we propose two algorithms to minimize the constructed cloaking regions, reducing the query latency and the server's workload and providing better QoS for users. Extensive simulations on a large dataset prove the effectiveness of our approach under various location privacy and QoS demands. Copyright © 2015 John Wiley & Sons, Ltd.
机译:通过移动手持设备的基于位置的服务(LBS)已受到用户的主要隐私关注。当前,关于连续LBS查询的大多数现有工作主要集中在用户的隐私需求上,而很少考虑质量服务(QoS)。在本文中,我们提出了一种针对连续LBS请求的需求感知位置保护方案,使用户不仅可以自定义位置隐私,还可以自定义QoS要求,而这导致在很多查询点中,隐私和QoS要求无法得到满足一起使用,并且无法为连续的LBS查询提供位置隐私保护。我们指出其根本原因是,在很少的LBS查询区域中,足迹很少,或者隐私要求设置得过高。因此,该方案提出了一种最大需求感知的查询序列算法。通过识别和约束那些区域中的查询,可以满足大多数LBS查询;因此,获得了最长的LBS查询序列,可以同时满足用户的特定隐私和QoS要求。此外,在满足用户隐私要求的前提下,在需求感知位置保护方案中,我们提出了两种算法以最小化所构造的隐蔽区域,减少查询延迟和服务器工作量并为用户提供更好的QoS。在大型数据集上的大量仿真证明了我们的方法在各种位置隐私和QoS要求下的有效性。版权所有©2015 John Wiley&Sons,Ltd.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号