BdHCO-tree: integrating location privacy protection algorithms for frequent updates of moving objects

  • Authors:

  • Tran Khanh Dang;Dinh Long Vu;Van Nghiem Nguyen

  • Affiliations:

  • HCMC University of Technology, Ho Chi Minh City, Vietnam;University of Transport, Ho Chi Minh City, Vietnam;Vocational College, Dong Nai, Vietnam

  • Venue:
  • Proceedings of the 8th International Conference on Ubiquitous Information Management and Communication
  • Year:
  • 2014

Quantified Score

Hi-index 0.00

Visualization

Abstract

Together with the rapid development of location-based services (LBS), the problem of privacy-preserving has gained much attention. Many techniques aiming at protecting user's privacy have been introduced such as obfuscation-based technique, k-anonymity. Although existing solutions integrate location privacy protection algorithms into the indexed spatio-temporal data as Bob-tree and Bob+-tree, they do not conform to moving objects and naturally frequent updates. On the other hand, because of using the static order Hilbert curve, these indices usually have large size, and so decreasing query and update performance. To overcome such disadvantages, in this paper, we propose a BdHCO-tree that combines BdH-tree index, Hilbert Cloaking algorithm and obfuscation-based technique to enhance the performance of basic operations and increase the privacy protection. Besides, our solution is also integrated into spatio-temporal data index structure so that it can be used for commercial Database Management Systems transparently.