Abstract
By eavesdropping on a user’s query in a sensor network, an adversary can deduce both the user’s location and his/her area of interest. In many domains it is desirable to guarantee privacy of both places. We propose an effective way to measure how well issuing a disperse set of k queries protects the user’s area of interest. However, issuing k queries instead of one facilitates the adversary determining the user’s location. To address that issue, we define a quantitative measure of how much information the k queries leak about the user’s location. Experiments reveal that how dispersed the k queries are has no effect on the privacy of the user’s location. However, smaller k, randomized routing, and non-broadcast transmission improve the user’s location privacy. We also show that compromising nodes in the user’s network yields no significant advantage to the adversary over an eavesdropping strategy.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Lopez, J.: Unleashing public-key cryptography in wireless sensor networks. Journal of Computer Security 14(5), 469–482 (2006)
Dingledine, R., Mathewson, N., Syverson, P.: Tor: The second-generation onion router. In: Proceedings of the 13th USENIX Security Symposium, pp. 303–320 (2004)
Misra, S., Xue, G.: Efficient anonymity schemes for clustered wireless sensor networks. International Journal of Sensor Networks 1(1/2), 50–63 (2006)
Ouyang, Y., Le, Z., Xu, Y., Triandopoulos, N., Zhang, S., Ford, J., Makedon, F.: Providing anonymity in wireless sensor networks. In: Proceedings of the IEEE International Conference on Pervasive Services, pp. 145–148 (2007)
Ozturk, C., Zhang, Y., Trappe, W.: Source-location privacy in energy-constrained sensor network routing. In: Proceedings of the 2nd ACM Workshop on Security of Ad Hoc and Sensor Networks, pp. 88–93 (2004)
Kamat, P., Zhang, Y., Trappe, W., Ozturk, C.: Enhancing source-location privacy in sensor network routing. In: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems, pp. 599–608 (2005)
Jian, Y., Chen, S., Zhang, Z., Zhang, L.: Protecting receiver-location privacy in wireless sensor networks. In: Proceedings of the 26th IEEE International Conference on Computer Communications, May 2007, pp. 1955–1963 (2007)
Sweeney, L.: k-anonymity: A model for protecting privacy. International Journal on Uncertainty, Fuzziness and Knowledge-Based Systems 10(5), 557–570 (2002)
Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudo-random number generator. SIAM Journal on Computing 15(2), 364–383 (1986)
Siegel, S., Castellan Jr., N.J.: Nonparametric Statistics for the Behavioral Sciences, 2nd edn. McGraw-Hill, New York (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vogt, R., Nascimento, M.A., Harms, J. (2009). On the Trade-Off between User-Location Privacy and Queried-Location Privacy in Wireless Sensor Networks. In: Ruiz, P.M., Garcia-Luna-Aceves, J.J. (eds) Ad-Hoc, Mobile and Wireless Networks. ADHOC-NOW 2009. Lecture Notes in Computer Science, vol 5793. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04383-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-642-04383-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04382-6
Online ISBN: 978-3-642-04383-3
eBook Packages: Computer ScienceComputer Science (R0)