k-Anonymity Location Privacy Algorithm Based on Clustering | Zendy

Lijuan Zheng | Zendy; Huanhuan Yue | Zendy; Zhaoxuan Li | Zendy; Xiao Pan | Zendy; Mei Wu | Zendy; Fan Yang | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

k-Anonymity Location Privacy Algorithm Based on Clustering

Author(s) -

Lijuan Zheng,

Huanhuan Yue,

Zhaoxuan Li,

Xiao Pan,

Mei Wu,

Fan Yang

Publication year - 2017

Publication title -

ieee access

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.587

H-Index - 127

ISSN - 2169-3536

DOI - 10.1109/access.2017.2780111

Subject(s) - aerospace , bioengineering , communication, networking and broadcast technologies , components, circuits, devices and systems , computing and processing , engineered materials, dielectrics and plasmas , engineering profession , fields, waves and electromagnetics , general topics for engineers , geoscience , nuclear engineering , photonics and electrooptics , power, energy and industry applications , robotics and control systems , signal processing and analysis , transportation

The accuracy of user location information is inversely proportional to the user's privacy preserving degree k, and is proportional to quality of query service. In order to balance the conflict between privacy preserving security and query quality caused by the accuracy of location information, a clustering algorithm aiming at eliminating outliers based on the k-anonymity location privacy preserving model is proposed, which is used to realize the establishment of anonymous group in the anonymous model. The distribution of user in the anonymous group is optimized. The idea of replacing the user location query by the center of the anonymous group is proposed. The number of repeated queries is reduced, and the quality of query service is improved on the premise of ensuring security through the experimental analysis and comparison with other schemes.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research