Towards trajectory anonymisation using multi-dimensional index structures
by Ahmed Almasrahi; Heechang Shin; Haibing Lu
International Journal of Business Continuity and Risk Management (IJBCRM), Vol. 6, No. 4, 2016

Abstract: Trajectory datasets are increasingly available due to the technological advances in location-sensing devices, wireless technologies, and hand-held devices. However, the datasets also causes consumer privacy concerns. This paper addresses the privacy issues by using the internal structure of R-tree, a multi-dimensional index structure. The benefit of using R-tree is that it clusters trajectories in a way that their bounding spatiotemporal extension is minimised, thus achieving better quality in the anonymised database. This is a desirable property of the resulting anonymised database. In order to improve the quality of service requirements, a novel algorithm has been proposed.

Online publication date: Sun, 01-Jan-2017

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Continuity and Risk Management (IJBCRM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com