Protecting Location Privacy with Personalized k-anonymity
Meng Wu · Journal of Nanjing University of Posts and Telecommunications · 2012
This paper presents a new k-anonymity algorithm based on the personalized k-anonymity model.Increasing anonymous group of anonymous memory modules in the ordinary algorithm speeds up the anonymous speed.Simulation results show that when the user's requireements for high security situations,the proposed algorithm has faster anonymity speed compared to the ordinary anonymous algorithm,meanwhile the success rate of anonymity has also been improved.When users have the low security requirements,the proposed algorithm has slower anonymous speed than the normal algorithm,advantages of the success rate were not evident.