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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
