高级检索
    吴宣够, 王朋飞, 郑啸, 樊旭, 王小林. 基于路径上报的车联网轨迹隐私保护[J]. 计算机研究与发展, 2017, 54(11): 2467-2474. DOI: 10.7544/issn1000-1239.2017.20170371
    引用本文: 吴宣够, 王朋飞, 郑啸, 樊旭, 王小林. 基于路径上报的车联网轨迹隐私保护[J]. 计算机研究与发展, 2017, 54(11): 2467-2474. DOI: 10.7544/issn1000-1239.2017.20170371
    Wu Xuangou, Wang Pengfei, Zheng Xiao, Fan Xu, Wang Xiaolin. Trajectory Privacy Protection Based on Road Segment Report in VANETs[J]. Journal of Computer Research and Development, 2017, 54(11): 2467-2474. DOI: 10.7544/issn1000-1239.2017.20170371
    Citation: Wu Xuangou, Wang Pengfei, Zheng Xiao, Fan Xu, Wang Xiaolin. Trajectory Privacy Protection Based on Road Segment Report in VANETs[J]. Journal of Computer Research and Development, 2017, 54(11): 2467-2474. DOI: 10.7544/issn1000-1239.2017.20170371

    基于路径上报的车联网轨迹隐私保护

    Trajectory Privacy Protection Based on Road Segment Report in VANETs

    • 摘要: 车载自组织网络(vehicular ad hoc networks, VANETs)(也称车联网)数据收集与应用为智能交通、城市规划、降低车辆污染等问题提供有效的技术和数据保障. 在车联网数据收集中通常需要车载用户上报连续路段位置信息,这给车载用户个人轨迹隐私带来严重的威胁. 然而现有用户轨迹保护算法主要基于单点位置保护,不能有效保护基于路径上报的用户轨迹隐私.针对车联网中用户移动轨迹易泄露问题,提出一种基于路径隐私保护的位置信息上报方案. 该方案给出用户轨迹隐私保护定义和路径隐私限制下的问题模型,同时证明了该问题是NP-hard问题. 此外,还给出该问题的具体近似算法的实现. 仿真实验结果表明:提出的算法具有良好的车载用户隐私保护功能和数据收集覆盖性能.

       

      Abstract: Vehicular ad hoc networks (VANETs) provide the related techniques and solutions for intelligent transportation, urban planning, pollution reduction and other issues. VANET applications usually require vehicle users to report continuous road location information, which brings a serious threat to personal trajectory privacy. However, the existing trajectory protection techniques are mainly focused on location-based protection, which cannot be applied to road segment based trajectory privacy protection effectively. In this paper, we propose a new road segment data gathering framework with trajectory privacy protection consideration in VANETs. In our framework, we give the trajectory privacy protection definition, formulate the problem model of road segment based data report, and prove that the problem is a NP-hard problem. In addition, we also present approximated algorithms to solve the problem. The experimental results show that our algorithms have good performance in both user's trajectory protection and coverage rate of data gathering.

       

    /

    返回文章
    返回