• 中国精品科技期刊
  • 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]Cheng Haodong, Han Meng, Zhang Ni, Li Xiaojuan, Wang Le. Closed High Utility Itemsets Mining over Data Stream Based on Sliding Window Model[J]. Journal of Computer Research and Development, 2021, 58(11): 2500-2514. DOI: 10.7544/issn1000-1239.2021.20200554
    [2]Zhang Xiaojian, Wang Miao, Meng Xiaofeng. An Accurate Method for Mining top-k Frequent Pattern Under Differential Privacy[J]. Journal of Computer Research and Development, 2014, 51(1): 104-114.
    [3]Lei Xiangxin, Yang Zhiying, Huang Shaoyin, Hu Yunfa. Mining Frequent Subtree on Paging XML Data Stream[J]. Journal of Computer Research and Development, 2012, 49(9): 1926-1936.
    [4]Liao Guoqiong, Wu Lingqin, Wan Changxuan. Frequent Patterns Mining over Uncertain Data Streams Based on Probability Decay Window Model[J]. Journal of Computer Research and Development, 2012, 49(5): 1105-1115.
    [5]Zhu Ranwei, Wang Peng, and Liu Majin. Algorithm Based on Counting for Mining Frequent Items over Data Stream[J]. Journal of Computer Research and Development, 2011, 48(10): 1803-1811.
    [6]Tong Yongxin, Zhang Yuanyuan, Yuan Mei, Ma Shilong, Yu Dan, Zhao Li. An Efficient Algorithm for Mining Compressed Sequential Patterns[J]. Journal of Computer Research and Development, 2010, 47(1): 72-80.
    [7]Liu Xuejun, Xu Hongbing, Dong Yisheng, Qian Jiangbo, Wang Yongli. Mining Frequent Closed Patterns from a Sliding Window over Data Streams[J]. Journal of Computer Research and Development, 2006, 43(10): 1738-1743.
    [8]Liu Xuejun, Xu Hongbing, Dong Yisheng, Wang Yongli, Qian Jiangbo. Mining Frequent Patterns in Data Streams[J]. Journal of Computer Research and Development, 2005, 42(12): 2192-2198.
    [9]Ma Haibing, Zhang Chenghong, Zhang Jin, and Hu Yunfa. Mining Frequent Patterns Based on IS\++-Tree Model[J]. Journal of Computer Research and Development, 2005, 42(4): 588-593.
    [10]Wang Wei, Zhou Haofeng, Yuan Qingqing, Lou Yubo, and Sui Baile. Mining Frequent Patterns Based on Graph Theory[J]. Journal of Computer Research and Development, 2005, 42(2): 230-235.

Catalog

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

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return