Location-based Services Routing in Networks

International Journal of Computer Trends and Technology (IJCTT)          
© May to June Issue 2011 by IJCTT Journal
Volume-1 Issue-2                          
Year of Publication : 2011
Authors : M.Krishnamoorthy, P.Ramyashri, M.S. Srinidhi.


M.Krishnamoorthy, P.Ramyashri, M.S. Srinidhi. "Location-based Services Routing in Networks"International Journal of Computer Trends and Technology (IJCTT),V1(2):228-233 May to June Issue 2011 .ISSN 2231-2803.www.ijcttjournal.org. Published by Seventh Sense Research Group.

Abstract: Due to the nature of spatial queries, an LBS needs the user position in order to pro- cess 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 location based services. We design location obfuscation techniques that (i) provide anonymous LBS access to the users, and (ii) 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. We will find out the best location based route.


[1] http://www.anonymizer.com/
[2] http://www.mailshell.com/.
[3] http://www.spamgourmet.com/.
[4] G. Aggarwal, M. Bawa, P. Ganesan, H. Garcia-Molina, K. Kenthapadi, N. Mishra, R. Motwani, U. Srivastava, D. Thomas, J. Widom, and Y. Xu. Vision Paper: Enabling Privacy for the Paranoids. In VLDB, 2004.
[5] R. Agrawal, J. Kiernan, R. Srikant, and Y. Xu. Hippocratic Databases. In VLDB, 2002.
[6] A. R. Beresford. Location privacy in ubiquitous computing. PhD thesis, Computer Laboratory, University of Cambridge, 2005.
[7] T. Brinkhoff. A Framework for Generating Network-based Moving Objects. GeoInformatica, 6(2):153–180, 2002.
[8] A. R. Butz. Alternative Algorithm for Hilbert’s Space-Filling Curve. IEEE Trans. Comput., C-20(4):424–426, 1971.
[9] C.-Y. Chow and M. F. Mokbel. Enabling private continuous queries for revealed user locations. In SSTD, 2007.
[10] C.-Y. Chow, M. F. Mokbel, and X. Liu. A peer-to-peer spatial cloaking algorithm for anonymous location-based service. In GIS, 2006.
[11] E. W. Dijkstra. A Note on Two Problems in Connection with Graphs. Numerische Mathematik, 1:269–271, 1959.
[12] M. Duckham and L. Kulik. A Formal Model of Obfuscation and Negotiation for Location Privacy. In PERVASIVE, 2005.
[13] J. Edmonds and E. Johnson. Matching, Euler Tours and the Chinese Postman. Mathematical Programming, 5:88–124, 1973.
[14] B. Gedik and L. Liu. Location Privacy in Mobile Systems: A Person- alized Anonymization Model. In ICDCS, 2005.
[15] G. Ghinita, P. Kalnis, A. Khoshgozaran, C. Shahabi, and K.-L. Tan. Private Queries in Location Based Services: Anonymizers are not Necessary. In SIGMOD, 2008.
[16] G. Ghinita, P. Kalnis, and S. Skiadopoulos. PRIVE: Anonymous Location-based Queries in Distributed Mobile Systems. In WWW, 2007.
[17] M. Gruteser and D. Grunwald. Anonymous Usage of Location-Based Services Through Spatial and Temporal Cloaking. In MobiSys, 2003.
[18] E. G. Hoel and H. Samet. Efficient Processing of Spatial Queries in Line Segment Databases. In SSD, 1991.
[19] X. Huang, C. S. Jensen, and S. Saltenis. The Islands Approach to Nearest Neighbor Querying in Spatial Networks. In SSTD, 2005.
[20] P. Indyk and D. Woodruff. Polylogarithmic Private Approximations and Efficient Matching. In Theory of Cryptography Conference, 2006.
[21] N. Jefferies, C. J. Mitchell, and M. Walker. A Proposed Architecture for Trusted Third Party Services. In CPA, 1995.
[22] N. Jing, Y. W. Huang, and E. A. Rundensteiner. Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation. IEEE TKDE, 10(3):409–432, 1998.
[23] P. Kalnis, G. Ghinita, K. Mouratidis, and D. Papadias. Preserving Location-based Identity Inference in Anonymous Spatial Queries. IEEE TKDE, 19(12), 2007.
[24] A. Khoshgozaran and C. Shahabi. Blind Evaluation of Nearest Neighbor Queries Using Space Transformation to Preserve Location Privacy. In SSTD, 2007.
[25] H. Kido, Y. Yanagisawa, and T. Satoh. An Anonymous Communication Technique using Dummies for Location-based Services. In ICPS, 2005.
[26] M. R. Kolahdouzan and C. Shahabi. Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In VLDB, 2004.
[27] T. J. Lehman and M. J. Carey. Query Processing in Main Memory Database Management Systems. In SIGMOD, 1986.
[28] M. F. Mokbel, C.-Y. Chow, and W. G. Aref. The New Casper: Query Processing for Location Services without Compromising Privacy. In VLDB, 2006.