As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
Existing approaches to protecting the privacy of trajectories using k-anonymity when requesting LBSs. However, the problem of anonymization is even harder due to dependencies between consecutive queries. In order to solve problem, a novel trajectory privacy-preserving approach based on k-anonymity is used in this paper. By formulating a query region, a spatial index model of trajectory data is established that can be further used by continuous KNN (K Nearest Neighbor) method to compute a candidate set of trajectory that have the similar area with current trajectory. In order to find the optimal anonymity path from k trajectories, a heuristic based approach is proposed. Empirical results show that the proposed method significantly decreases information losses for the same privacy levels and that information distortion strongly depends on value of parameter k. The k-anonymity based approach can effectively solve the problem arose from dependencies between consecutive queries and strengthen the privacy of trajectory data.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.
This website uses cookies
We use cookies to provide you with the best possible experience. They also allow us to analyze user behavior in order to constantly improve the website for you. Info about the privacy policy of IOS Press.