Abstract
Continued advances in positioning technologies and mobile devices have increased the demand for location-based services (LBSs) in distributed sensor networks. Every LBS provider requires the sensor nodes to report their location information as the quality of service strongly depends on the information.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
In this chapter, the set of points inside or on the circle \(C(O,r)\) is called the ball of center \(O\) and radius \(r\) and represented by \(B(O,r)\).
- 2.
The line segment between points \(A\in \mathbb {R}^2\) and \(B\in \mathbb {R}^2\) is represented by symbol \(\overline{AB}\).
- 3.
The line passing through points \(A,B\in \mathbb {R}^2\) is denoted by symbol \(\overleftrightarrow {AB}\).
- 4.
Permutation \(\pi \) on set \(M\) is a total, one-to-one function in the form \(\pi :\{1,2,\ldots ,|M|\}\mapsto M\) such that \(\pi _i\) denotes the member of \(M\) corresponding to integer \(i\le |M|\).
- 5.
Although it is possible that the three lines meet each other in one point, the probability of such event is zero. Henceforth, we do not consider such case.
- 6.
As the basic polygon is convex for every \(i\ge i_0\), its edges have at most two intersecting points with a straight line.
- 7.
Radius of the circumscribed circle.
- 8.
Running maximum \(M_t\) of the Brownian motion process \(B_t\) is a random process which has the following cumulative density function at the arbitrary time \(t>0\) (\(\sigma ^2\) represents the variance of process \(B_t\)): \(F_{M_t}(m)=\text{ erf }(\frac{m}{\sqrt{2t\sigma ^2}})\) for every \(m\ge 0\).
References
R. Dewri, Location privacy and attacker knowledge: who are we fighting against? Lecture notes of the institute for computer sciences. Social Informatics and Telecommunications Engineering, vol. 96 (2012), pp. 96–115
M. Li, S. Salinas, A. Thapa, P. Li, n-CD: A Geometric Approach to Preserving Location Privacy in Location-Based Services, in Proceedings of IEEE INFOCOM (2013)
M. Gruteser, D. Grunwald, Anonymous usage of location-based services through spatial and temporal cloaking, in ACM Mobisys’03, May 2003
B. Gedik, L. Liu, Protecting location privacy with personalized kanonymity: architecture and algorithms. IEEE Trans. Mobile Comput. 7(1), 118 (2008)
J. Meyerowitz, R.R. Choudhury, Hiding stars with fireworks: location privacy through camouflage, in Proceedings of ACM MobiCom (Beijing, China, Sept 2009)
M.F. Mokbel, C.Y. Chow, W.G. Aref, The new casper: query processing for location services without compromising privacy, in Proceedings of VLDB, 2006
P. Kalnis, G. Ghinita, K. Mouratidis, D. Papadia, Preventing location-based identity inference in anonymous spatial queries. IEEE Trans. Knowl. Data Eng. 19(12), 1719–1733 (2007)
B. Gedik, L. Liu, Location privacy in mobile systems: a personalized anonymization model, in Proceedings of IEEE ICDCS (Columbus, Ohio, June 2005)
C.-Y. Chow, M.F. Mokbel, X. Liu, A peer-to-peer spatial cloaking algorithm for anonymous location-based service, in Proceedings of ACM GIS (Arlington, Virginia, Nov 2006)
A. Beresford, F. Stajano, Location privacy in pervasive computing. IEEE Pervasive Comput. 2(1), 4655 (2003)
B. Hoh, M. Gruteser, H. Xiong, A. Alrabady, Preserving privacy in GPS traces via uncertainty-aware path cloaking, in Proceedings of ACM CCS 2007 (Alexandria, US, Jan 2007)
H. Kido, Y. Yanagisawa, T. Satoh, An anonymous communication technique using dummies for location-based services, in Proceedings of IEEE ICPS (Santorini, Greece, July 2006)
H. Lu, C.S. Jensen, M.L. Yiu, Pad: privacy-area aware, dummy-based location privacy in mobile services, in Proceedings of ACM MobiDE (Vancouver, Canada, June 2008)
M. Duckham, L. Kulik, A formal model of obfuscation and negotiation for location privacy, in Proceedings of international conference on pervasive computing (Munich, Germany, May 2005)
C.A. Ardagna, M. Cremonini, S.D.C. di Vimercati, P. Samarati, An obfuscation-based approach for protecting location privacy. IEEE Trans. Dependable Secure Comput. 8(1), 1327 (2011)
A. Pingley, W. Yu, N. Zhang, X. Fu, W. Zhao, Cap: a context-aware privacy protection system for location-based services, in Proceedings of IEEE ICDCS (Montreal, Canada, June 2009)
M. Damiani, E. Bertino, C. Silvestri, Probe: an obfuscation system for the protection of sensitive location information in lbs, Technical Report 2001–145, CERIAS, 2008
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this chapter
Cite this chapter
Iyengar, S.S., Boroojeni, K.G., Balakrishnan, N. (2014). A Stochastic Preserving Scheme of Location Privacy. In: Mathematical Theories of Distributed Sensor Networks. Springer, New York, NY. https://doi.org/10.1007/978-1-4419-8420-3_6
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8420-3_6
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-8419-7
Online ISBN: 978-1-4419-8420-3
eBook Packages: EngineeringEngineering (R0)