296 0

A Hierarchical Clustering-Based Spatial Cloaking Algorithm for Location-Based Services

Title
A Hierarchical Clustering-Based Spatial Cloaking Algorithm for Location-Based Services
Author
박용수
Keywords
Privacy; Location-Based services; Homeland security; Hierarchical clustering
Issue Date
2012-07
Publisher
The Journal of the Korea Institute of Electronic Communication Sciences
Citation
Journal of Internet Technology, 2012, 13(4), P.645~653
Abstract
The rapid growth of smart phones has made locationbased services (LBS) widely available. LBS can be used to enhance ”Homeland Security.” Since the use of LBS can raise privacy issues, users want to prevent government agencies from tracking their locations. To avoid such a situation, some kind of location privacy mechanism should be provided. Most of the studies for location privacy try to preserve location privacy by achieving what is known as location K-anonymity. However, location K-anonymity can be compromised even when there are always more than K users in the anonymizing spatial regions (ASR). A reciprocity property is introduced as a sufficient condition for location K-anonymity. In this paper, we propose a hierarchical clustering-based spatial cloaking algorithm for LBS. Our spatial cloaking algorithm satisfies the reciprocity property. The experimental results show, in terms of the ASR size, that the proposed algorithm is better than Hilbert Cloak and comparable to RC-AR. In terms of the ASR generation time, the proposed algorithm is much better in its performance than RC-AR and similar in performance to Hilbert Cloak.
URI
http://www.airitilibrary.com/Publication/alDetailedMesh?DocID=16079264-201207-201207300003-201207300003-645-653http://hdl.handle.net/20.500.11754/67240
ISSN
1607-9264
DOI
10.6138/JIT.2012.13.4.12
Appears in Collections:
COLLEGE OF ENGINEERING[S](공과대학) > COMPUTER SCIENCE(컴퓨터소프트웨어학부) > Articles
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML


qrcode

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

BROWSE