• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Pan Xiao, Wu Lei, Hu Zhaojun. A Privacy Protection Algorithm Based on Network Voronoi Graph over Road Networks[J]. Journal of Computer Research and Development, 2015, 52(12): 2750-2763. DOI: 10.7544/issn1000-1239.2015.20140602
Citation: Pan Xiao, Wu Lei, Hu Zhaojun. A Privacy Protection Algorithm Based on Network Voronoi Graph over Road Networks[J]. Journal of Computer Research and Development, 2015, 52(12): 2750-2763. DOI: 10.7544/issn1000-1239.2015.20140602

A Privacy Protection Algorithm Based on Network Voronoi Graph over Road Networks

More Information
  • Published Date: November 30, 2015
  • With advances in wireless communication and mobile positioning technologies, location-based services (LBSs) have seen wide-spread adoption. The academia and industry have pay attention to location privacy preserving in LBSs for about ten years. Most existing location cloaking algorithms over road networks are based on DFS-based or BFS-based graph traversal algorithms. However, the main drawback of these approaches is the repetitive global road network traversal, which results in the low efficiency and high communication cost. In order to resolve the problem, we propose a network Voronoi-based location anonymization algorithm NVLA on road networks. Under the help of network Voronoi diagram (NVD), the road network is divided into several network Voronoi cells offline. Then, we reduce the problem of anonymization over the global road network into finding cloaking sets in local network Voronoi cells (NVC). Next, according to the number of road segments and the number of users in a cell, network Voronoi cells are classified to unsafe, safe-medium and safe-large cells. Finally, according to the features of the different network Voronoi cells, different cloaking algorithms are proposed. We design and conduct a series of experiments, and the experimental results validate the efficiency and effectiveness of the proposed algorithm. The average cloaking time is only 0.4 ms and the cloaking success rate is about 100%. On the other hand, only 0.01% of the query cost is sacrificed.
  • Related Articles

    [1]Zhang Chunyun, Zhao Hongyan, Deng Jiqin, Cui Chaoran, Dong Xiaolin, Chen Zhumin. Category Adversarial Joint Learning Method for Cross-Prompt Automated Essay Scoring[J]. Journal of Computer Research and Development, 2025, 62(5): 1190-1204. DOI: 10.7544/issn1000-1239.202440266
    [2]Lu Feng, Li Wei, Gu Lin, Liu Shuai, Wang Runheng, Ren Yufei, Dai Xiaohai, Liao Xiaofei, Jin Hai. Selection of Reputable Medical Participants Based on an Iterative Collaborative Learning Framework[J]. Journal of Computer Research and Development, 2024, 61(9): 2347-2363. DOI: 10.7544/issn1000-1239.202330270
    [3]Lu Yuxuan, Kong Lanju, Zhang Baochen, Min Xinping. MC-RHotStuff: Multi-Chain Oriented HotStuff Consensus Mechanism Based on Reputation[J]. Journal of Computer Research and Development, 2024, 61(6): 1559-1572. DOI: 10.7544/issn1000-1239.202330195
    [4]Zheng Susu, Fu Xiaodong, Yue Kun, Liu Li, Liu Lijun, Feng Yong. Online Service Reputation Measurement Method Based on Kendall tau Distance[J]. Journal of Computer Research and Development, 2019, 56(4): 884-894. DOI: 10.7544/issn1000-1239.2019.20180034
    [5]Ma Haiyan, Liang Yongquan, Ji Shujuan, Li Da. A Trust-Distrust Based Reputation Attacks Defending Strategy and Its Stability Analysis[J]. Journal of Computer Research and Development, 2018, 55(12): 2685-2702. DOI: 10.7544/issn1000-1239.2018.20170587
    [6]Zhang Yuanpeng, Deng Zhaohong, Chung Fu-lai, Hang Wenlong, Wang Shitong. Fast Self-Adaptive Clustering Algorithm Based on Exemplar Score Strategy[J]. Journal of Computer Research and Development, 2018, 55(1): 163-178. DOI: 10.7544/issn1000-1239.2018.20160937
    [7]Lin Hui, Ma Jianfeng, Xu Li. A Secure Routing Protocol for MWNs Based on Cross-Layer Dynamic Reputation Mechanism[J]. Journal of Computer Research and Development, 2014, 51(7): 1486-1496.
    [8]Ma Shouming, Wang Ruchuan, Ye Ning. Secure Data Aggregation Algorithm Based on Reputations Set Pair Analysis in Wireless Sensor Networks[J]. Journal of Computer Research and Development, 2011, 48(9): 1652-1658.
    [9]Zhao Xiang, Huang Houkuan, Dong Xingye, and He Lijian. A Trust and Reputation System Model for Open Multi-Agent System[J]. Journal of Computer Research and Development, 2009, 46(9): 1480-1487.
    [10]He Lijian, Huang Houkuan, Zhang Wei. A Survey of Trust and Reputation Systems in Multi Agent Systems[J]. Journal of Computer Research and Development, 2008, 45(7).

Catalog

    Article views (1456) PDF downloads (690) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return