Skip to main content

Voronoi-Based Spatial Cloaking Algorithm over Road Network

  • Conference paper
Database and Expert Systems Applications (DEXA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 8645))

Included in the following conference series:

  • 1425 Accesses

Abstract

Privacy preservation has recently received considerable attention in location-based services. A large number of location cloaking algorithms have been proposed for protecting the location privacy of mobile users over road networks. However, most existing cloaking approaches traverse the entire road network repetitively, which has a significant negative impact over the communication and anonymization efficiency. To address this problem, we propose a network Voronoi-based location anonymization algorithm. We employ the network Voronoi diagram to pre-divide the road network into network Voronoi cells. The problem of anonymization over global road networks is reduced to finding cloaking sets in local network Voronoi cells. Experimental results validate the efficiency and effectiveness of the proposed algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chow, C., Mokbel, M.F., Bao, J., Liu, X.: Query-aware Location Anonymization for Road Networks. Geoinformatical 15(3), 571–607 (2010)

    Article  Google Scholar 

  2. Erwig, M., Hagen, F.: The Graph voronoi Diagram with Applications. Journal of Networks 36(3), 156–163 (2000)

    Article  MATH  Google Scholar 

  3. Ku, W.S., Zimmermann, R., Peng, W.C., Shroff, S.: Privacy Protected Query Processing on Spatial Networks. In: IEEE ICDEW (2007)

    Google Scholar 

  4. Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On Trip Planning Queries in Spatial Databases. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273–290. Springer, Heidelberg (2005)

    Google Scholar 

  5. Mouratidis, K., Yiu, M.L.: Anonymous Query Processing in Road Networks. TKDE 22(1), 2–15 (2009)

    Google Scholar 

  6. Mouratidis, K., Yiu, M.L.: Shortest Path Computation with No Information Leakage. In: 38th International Conference on Very Large Data Bases (2012)

    Google Scholar 

  7. Palanisamy, B., Liu, L., Lee, K., Singh, A., Tang, Y.: Location Privacy with Road network Mix-zones. In: MSN (2012)

    Google Scholar 

  8. Yigitoglu, E., Damiani, M.L., Abul, O.: Privacy-preserving Sharing of Sensitive Semantic Locations under Road-network Constraints. In: MDM (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Pan, X., Wu, L., Hu, Z., Huo, Z. (2014). Voronoi-Based Spatial Cloaking Algorithm over Road Network. In: Decker, H., Lhotská, L., Link, S., Spies, M., Wagner, R.R. (eds) Database and Expert Systems Applications. DEXA 2014. Lecture Notes in Computer Science, vol 8645. Springer, Cham. https://doi.org/10.1007/978-3-319-10085-2_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-10085-2_25

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-10084-5

  • Online ISBN: 978-3-319-10085-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics