Anonymous Query Processing in Road Networks

被引:46
作者
Mouratidis, Kyriakos [1 ]
Yiu, Man Lung [2 ]
机构
[1] Singapore Management Univ, Sch Informat Syst, Singapore 178902, Singapore
[2] Hong Kong Polytech Univ, Dept Comp, Kowloon, Hong Kong, Peoples R China
关键词
Spatial databases; road networks; location privacy; spatial anonymity; query processing; location-based services; MODEL;
D O I
10.1109/TKDE.2009.48
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
The increasing availability of location-aware mobile devices has given rise to a flurry of location-based services (LBSs). Due to the nature of spatial queries, an LBS needs the user position in order to process her requests. On the other hand, revealing exact user locations to a (potentially untrusted) LBS may pinpoint their identities and breach their privacy. To address this issue, spatial anonymity techniques obfuscate user locations, forwarding to the LBS a sufficiently large region instead. Existing methods explicitly target processing in the euclidean space and do not apply when proximity to the users is defined according to network distance (e. g., driving time through the roads of a city). In this paper, we propose a framework for anonymous query processing in road networks. We design location obfuscation techniques that: 1) provide anonymous LBS access to the users and 2) allow efficient query processing at the LBS side. Our techniques exploit existing network database infrastructure, requiring no specialized storage schemes or functionalities. We experimentally compare alternative designs in real road networks and demonstrate the effectiveness of our techniques.
引用
收藏
页码:2 / 15
页数:14
相关论文
共 33 条
[1]  
AGGARWAL G, 2004, P INT C VER LARG DAT
[2]  
AGRAWAL R, 2002, P INT C VER LARG DAT
[3]  
Beresford AR, 2005, THESIS U CAMBRIDGE
[4]   A framework for generating network-based moving objects [J].
Brinkhoff, T .
GEOINFORMATICA, 2002, 6 (02) :153-180
[5]   ALTERNATIVE ALGORITHM FOR HILBERTS SPACE-FILLING CURVE [J].
BUTZ, AR .
IEEE TRANSACTIONS ON COMPUTERS, 1971, C 20 (04) :424-&
[6]  
CHOW CY, 2006, P ANN INT S ADV GEOG
[7]  
CHOW CY, 2007, P INT S SPAT TEMP DA
[8]  
Dijkstra E. W., 1959, Numerische Mathematik, V1, P269, DOI [10.1007/BF01386390, DOI 10.1007/BF01386390]
[9]  
DUCKHAM M, 2005, P INT P PERV COMP PE
[10]  
Edmonds J., 1973, Mathematical Programming, V5, P88, DOI 10.1007/BF01580113