The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2010 vol.22)
pp: 404-419
Haibo Hu , Hong Kong Baptist University, Hong Kong
Jianliang Xu , Hong Kong Baptist University, Kowloon
Dik Lun Lee , Hong Kong University of Science and Technology, Hong Kong
ABSTRACT
Efficiency and privacy are two fundamental issues in moving object monitoring. This paper proposes a privacy-aware monitoring (PAM) framework that addresses both issues. The framework distinguishes itself from the existing work by being the first to holistically address the issues of location updating in terms of monitoring accuracy, efficiency, and privacy, particularly, when and how mobile clients should send location updates to the server. Based on the notions of safe region and most probable result, PAM performs location updates only when they would likely alter the query results. Furthermore, by designing various client update strategies, the framework is flexible and able to optimize accuracy, privacy, or efficiency. We develop efficient query evaluation/reevaluation and safe region computation algorithms in the framework. The experimental results show that PAM substantially outperforms traditional schemes in terms of monitoring accuracy, CPU cost, and scalability while achieving close-to-optimal communication cost.
INDEX TERMS
Spatial databases, location-dependent and sensitive, mobile applications.
CITATION
Haibo Hu, Jianliang Xu, Dik Lun Lee, "PAM: An Efficient and Privacy-Aware Monitoring Framework for Continuously Moving Objects", IEEE Transactions on Knowledge & Data Engineering, vol.22, no. 3, pp. 404-419, March 2010, doi:10.1109/TKDE.2009.86
REFERENCES
[1] S. Babu and J. Widom, “Continuous Queries over Data Streams,” Proc. ACM SIGMOD, 2001.
[2] N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD, pp. 322-331, 1990.
[3] R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis, “Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects,” Proc. Int'l Database Eng. and Applications Symp. (IDEAS), 2002.
[4] A. Beresford and F. Stajano, “Location Privacy in Pervasive Computing,” IEEE Pervasive Computing, vol. 2, no. 1, pp. 46-55, Jan.-Mar. 2003.
[5] J. Broch, D.A. Maltz, D. Johnson, Y.-C. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM/IEEE MobiCom, pp. 85-97, 1998.
[6] Y. Cai, K.A. Hua, and G. Cao, “Processing Range-Monitoring Queries on Heterogeneous Mobile Objects,” Proc. IEEE Int'l Conf. Mobile Data Management (MDM), 2004.
[7] J. Chen and R. Cheng, “Efficient Evaluation of Imprecise Location-Dependent Queries,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), pp.586-595, 2007.
[8] J. Chen, D. DeWitt, F. Tian, and Y. Wang, “NiagaraCQ: A Scalable Continuous Query System for Internet Databases,” Proc. ACM SIGMOD, 2000.
[9] R. Cheng, D.V. Kalashnikov, and S. Prabhakar, “Querying Imprecise Data in Moving Object Environments,” IEEE Trans. Knowledge and Data Eng., vol. 16, no. 9, pp. 1112- 1127, Sept. 2004.
[10] H.D. Chon, D. Agrawal, and A.E. Abbadi, “Range and kNN Query Processing for Moving Objects in Grid Model,” ACM/Kluwer MONET, vol. 8, no. 4, pp. 401-412, 2003.
[11] C.-Y. Chow, M.F. Mokbel, and X. Liu, “A Peer-to-Peer Spatial Cloaking Algorithm for Anonymous Location-Based Services,” Proc. ACM Int'l Symp. Geographic Information Systems (GIS), pp.171-178, 2006.
[12] D. Pfoser and C.S. Jensen, “Capturing the Uncertainty of Moving-Objects Representations,” Proc. Int'l Conf. Scientific and Statistical Database Management (SSDBM), 1999.
[13] B. Gedik and L. Liu, “MobiEyes: Distributed Processing of Continuously Moving Queries on Moving Objects in a Mobile System,” Proc. Int'l Conf. Extending DataBase Technology (EDBT), 2004.
[14] B. Gedik and L. Liu, “Location Privacy in Mobile Systems: A Personalized Anonymization Model,” Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS), pp. 620-629, 2005.
[15] B. Gedik and L. Liu, “Protecting Location Privacy with Personalized k-Anonymity: Architecture and Algorithms,” IEEE Trans. Mobile Computing, vol. 7, no. 1, pp. 1-18, Jan. 2008.
[16] G. Ghinita, P. Kalnis, and S. Skiadopoulos, “Mobihide: A Mobile Peer-to-Peer System for Anonymous Location-Based Queries,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), 2007.
[17] G. Ghinita, P. Kalnis, and S. Skiadopoulos, “Prive: Anonymous Location-Based Queries in Distributed Mobile Systems,” Proc. Int'l World Wide Web Conf. (WWW '07), pp. 371-380, 2007.
[18] M. Gruteser and D. Grunwald, “Anonymous Usage of Location-Based Services through Spatial and Temporal Cloaking,” Proc. MobiSys, 2003.
[19] A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching,” Proc. ACM SIGMOD, 1984.
[20] G.R. Hjaltason and H. Samet, “Distance Browsing in Spatial Databases,” ACM Trans. Database Systems, vol. 24, no. 2, pp. 265-318, 1999.
[21] H. Hu, J. Xu, and D.L. Lee, “A Generic Framework for Monitoring Continuous Spatial Queries over Moving Objects,” Proc. ACM SIGMOD, pp. 479-490, 2005.
[22] G. Iwerks, H. Samet, and K. Smith, “Continuous k-Nearest Neighbor Queries for Continuously Moving Points with Updates,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2003.
[23] G.S. Iwerks, H. Samet, and K. Smith, “Maintenance of Spatial Semijoin Queries on Moving Points,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[24] C.S. Jensen, D. Lin, and B.C. Ooi, “Query and Update Efficient B+-Tree Based Indexing of Moving Objects,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2004.
[25] D.V. Kalashnikov, S. Prabhakar, and S.E. Hambrusch, “Main Memory Evaluation of Monitoring Queries over Moving Objects,” Distributed Parallel Databases, vol. 15, no. 2, pp. 117-135, 2004.
[26] P. Kalnis, G. Ghinita, K. Mouratidis, and D. Papadias, “Preventing Location-Based Identity Inference in Anonymous Spatial Queries,” IEEE Trans. Knowledge and Data Eng., vol. 19, no. 12, pp. 1719-1733, Dec. 2007.
[27] A. Khoshgozaran and C. Shahabi, “Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy,” Proc. Int'l Symp. Spatial and Temporal Databases (SSTD), 2007.
[28] H. Kido, Y. Yanagisawa, and T. Satoh, “An Anonymous Communication Technique Using Dummies for Location-Based Services,” Proc. Second Int'l Conf. Pervasive Services (ICPS), 2005.
[29] M.-L. Lee, W. Hsu, C.S. Jensen, B. Cui, and K.L. Teo, “Supporting Frequent Updates in R-Trees: A Bottom-Up Approach,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2003.
[30] S.R. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, “TAG: A Tiny Aggregation Service for Ad-Hoc Sensor Networks,” Proc. USENIX Symp. Operating Systems Design and Implementation (OSDI), 2002.
[31] M.F. Mokbel, C.-Y. Chow, and W.G. Aref, “The New Casper: Query Processing for Location Services without Compromising Privacy,” Proc. Int'l Conf. Very Large Data Bases (VLDB), pp. 763-774, 2006.
[32] M.F. Mokbel, X. Xiong, and W.G. Aref, “SINA: Scalable Incremental Processing of Continuous Queries in Spatio-Temporal Databases,” Proc. ACM SIGMOD, 2004.
[33] G. Myles, A. Friday, and N. Davies, “Preserving Privacy in Environments with Location-Based Applications,” Pervasive Computing, vol. 2, no. 1, pp. 56-64, 2003.
[34] J.M. Patel, Y. Chen, and V.P. Chakka, “STRIPES: An Efficient Index for Predicted Trajectories,” Proc. ACM SIGMOD, 2004.
[35] S. Prabhakar, Y. Xia, D.V. Kalashnikov, W.G. Aref, and S.E. Hambrusch, “Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1124-1140, Oct. 2002.
[36] K. Raptopoulou, A. Papadopoulos, and Y. Manolopoulos, “Fast Nearest-Neighbor Query Processing in Moving Object Databases,” GeoInfomatica, vol. 7, no. 2, pp. 113-137, 2003.
[37] N. Roussopoulos, S. Kelley, and F. Vincent, “Nearest Neighbor Queries,” Proc. ACM SIGMOD, 1995.
[38] S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez, “Indexing the Positions of Continuously Moving Objects,” Proc. ACM SIGMOD, 2000.
[39] Y. Tao, C. Faloutsos, D. Papadias, and B. Liu, “Prediction and Indexing of Moving Objects with Unknown Motion Patterns,” Proc. ACM SIGMOD, 2004.
[40] Y. Tao, D. Papadias, and Q. Shen, “Continuous Nearest Neighbor Search,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2002.
[41] Y. Tao, D. Papadias, and J. Sun, “The TPR*-Tree: An Optimized Spatio-Temporal Access Method for Predictive Queries,” Proc. Int'l Conf. Very Large Data Bases (VLDB), 2003.
[42] W. Wu, W. Guo, and K.-L. Tan, “Distributed Processing of Moving k-Nearest-Neighbor Query on Moving Objects,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2007.
[43] X. Xiong, M.F. Mokbel, and W.G. Aref, “SEA-CNN: Scalable Processing of Continuous k-Nearest Neighbor Queries in Spatio-Temporal Databases,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2005.
[44] J. Xu, X. Tang, and D.L. Lee, “Performance Analysis of Location-Dependent Cache Invalidation Schemes for Mobile Environments,” IEEE Trans. Knowledge and Data Eng., vol. 15, no. 2, pp.474-488, Mar./Apr. 2003.
[45] M.L. Yiu, C.S. Jensen, X. Huang, and H. Lu, “Spacetwist: Managing the Trade Offs among Location Privacy, Query Performance, and Query Accuracy in Mobile Services,” Proc. IEEE Int'l Conf. Data Eng. (ICDE '08), 2008.
[46] T.-H. You, W.-C. Peng, and W.-C. Lee, “Protect Moving Trajectories with Dummies,” Proc. Int'l Workshop Privacy-Aware Location-Based Mobile Services, 2007.
[47] X. Yu, K.Q. Pu, and N. Koudas, “Monitoring k-Nearest Neighbor Queries over Moving Objects,” Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2005.
[48] J. Zhang, M. Zhu, D. Papadias, Y. Tao, and D.L. Lee, “Location-Based Spatial Queries,” Proc. ACM SIGMOD, 2003.
13 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool