Improvement of K-Anonymity Location Privacy Protection Algorithm Based on Hierarchy Clustering

Article Preview

Abstract:

The k anonymity was one of the first algorithms applied for privacy protection in location-based service(LBS).The k anonymity exhibits its disadvantages gradually, such as being easily attacked by continuous queries attacking algorithm, the larger k value for higher security level lead to more pointless cost of bandwidth and load of LBS server. This article analyzes the causes of the problems, and proposes a new idea based on clustering algorithm to improve the k anonymity algorithm.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1553-1557

Citation:

Online since:

August 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Lin Xin, Li Shan-ping, Yang Zhao-hui. Attacking Algorithms Against Continuous Queries in LBS and Anonymity Measurement[J]. Journal of Software, Vol. 20, No. 4, April 2009, p.1058−1068.

Google Scholar

[2] He Kang. The Research and Implementation of Personalized k-anonymous Location Privacy Protection Technology Based on The Internet of Things[D]. Nanjing University of Posts and Telecommunications, (2012).

Google Scholar

[3] Wu Su-hui, Cheng Ying, Zheng Yan-ning, Pan Yun-tao. Survey on K-means Algorithm[J]. New Technology of Library and Information Service, 2011, 05: 28-35.

Google Scholar