...
首页> 外文期刊>Ad hoc networks >Probability-based prediction query algorithm
【24h】

Probability-based prediction query algorithm

机译:基于概率的预测查询算法

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

获取外文期刊封面封底 >>

       

摘要

Advances in wireless communication and ubiquitous mobile networks have resulted in location-based services (LBSs) contributing significantly to entertainment services for mobile users by utilizing their location data. However, for the request of a mobile user with a limited time frame, such as "where is the gas station nearest to me? The anonymous server should return the optimal result to me within a few minutes," the anonymous server immediately generates the cloaking region based on the user's current location information and the k-anonymity requirement privacy level to ensure location privacy protection when receiving the LBS request in most existing approaches. Unfortunately, mobility by the mobile user could cause the smaller cloaking region generated by the server. The existing algorithm would return the sub-optimal cloaking region. This problem prompted us to develop a novel probability-based prediction query (PBPQ) algorithm. On the server side, our method firstly predicts the probability of the mobile user being on each road, followed the final probability of the user entering the cloaking region. Our proposed algorithm can generate the optimal cloaking region generated within the limited time required by users. The experimental results show that our PBPQ algorithm can predict the optimal cloaking region effectively at the highly successful rate of more than 90%. Thus, the PBPQ algorithm can decrease the size of the cloaking region considerably while maintaining good QoS. (C) 2017 Published by Elsevier B.V.
机译:无线通信和无处不在的移动网络的进步已经导致基于位置的服务(LBS)通过利用移动用户的位置数据为移动用户的娱乐服务做出了重要贡献。但是,对于有时间限制的移动用户的请求,例如“加油站离我最近的地方在哪里?匿名服务器应在几分钟之内将最佳结果返回给我”,匿名服务器立即生成隐瞒在大多数现有方法中,基于用户当前的位置信息和k-匿名要求隐私级别确定区域,以确保在接收LBS请求时保护位置隐私。不幸的是,移动用户的移动性可能导致服务器生成较小的隐身区域。现有算法将返回次优隐身区域。这个问题促使我们开发一种新颖的基于概率的预测查询(PBPQ)算法。在服务器端,我们的方法首先预测移动用户在每条道路上的概率,然后预测用户进入隐身区域的最终概率。我们提出的算法可以在用户要求的有限时间内生成最佳隐身区域。实验结果表明,我们的PBPQ算法可以以90%以上的高成功率有效地预测最佳隐身区域。因此,PBPQ算法可以在保持良好QoS的同时显着减小隐藏区域的大小。 (C)2017由Elsevier B.V.发布

著录项

  • 来源
    《Ad hoc networks》 |2017年第5期|52-65|共14页
  • 作者单位

    Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China;

    Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China;

    Xidian Univ, State Key Lab Integrated Serv Networks, Xian 710071, Peoples R China;

    Guilin Univ Elect Technol, Guangxi Coll & Univ Key Lab Cloud Comp & Complex, Guilin 541004, Peoples R China;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

    LBSs; PBPQ; Optimal cloaking region; QoS;

    机译:LBS;PBPQ;最佳隐身区域;QoS;

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号