Abstract
Wireless sensor networks (WSN) have been widely used in many areas for unattended event monitoring. Mainly due to lack of a protected physical boundary, wireless communications are vulnerable to unauthorized detection, interception and and even node capture. Privacy is becoming one of the major issues that jeopardize the successful deployment and survivability of wireless sensor networks. While confidentiality of the message can be ensured through content encryption, it is much more difficult to adequately address the source-location privacy. For WSN, source-location privacy service is further complicated by the fact that the sensor nodes consist of low-cost and low-power radio devices, computationally intensive cryptographic algorithms (such as public-key cryptosystems) and large scale broadcasting-based protocols are not suitable for WSN. In this paper, we propose a two-step routing strategy for the messages to be routed from the actual source node to the SINK node through either a single, or multiple, randomly selected intermediate node(s) away from the source node so that it is to make it infeasible for the adversaries to trace back to the source node through hop-by-hop routing analysis. In the first protocol, the messages will be routed to a single intermediate node. This scheme can provide very good local source-location privacy. We also propose routing through multiple randomly selected intermediate nodes based on angle and quadrant to further improve the performance and security. While providing source-location privacy for WSN, our simulation results demonstrate that the proposed schemes are very efficient in energy consumption, and transmission latency. The proposed schemes can also assurance high message delivery ratio. Therefore, they can be used for many practical applications.
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
Chaum, D.: Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM 24 (February 1981)
Chaum, D.: The dinning cryptographer problem: Unconditional sender and recipient untraceability. Journal of Cryptology 1(1), 65–75 (1988)
Ahn, L., Bortz, A., Hopper, N.: k-anonymous message transmission. In: Proceedings of the 10th ACM conference on Computer and Communications Security, Washington D.C., USA, pp. 122–130 (2003)
Beimel, A., Dolev, S.: Buses for anonymous message delivery. J. Cryptology 16, 25–39 (2003)
Golle, P., Juels, A.: Dining cryptographers revisited. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 456–473. Springer, Heidelberg (2004)
Goel, S., Robson, M., Polte, M., Sirer, E.G.: Herbivore: A Scalable and Efficient Protocol for Anonymous Communication. Tech. Rep. 2003-1890, Cornell University, Ithaca, NY (February 2003)
Reed, M., Syverson, P., Goldschlag, D.: Anonymous connections and onion routing. IEEE J. on Selected Areas in Coomunications, Special Issue on Copyrigh and Privacy Protection 16(4), 482–494 (1998)
Reiter, M.K., Rubin, A.D.: Crowds: anonymity for web transaction. ACM Transactions on Information and System Security 1(1), 66–92 (1998)
Deng, J., Han, R., Mishra, S.: Intrusion tolerance and anti-traffic analysis strategies for wireless sensor networks. In: Proceedings of the DSN, Washington, DC, USA, p. 637. IEEE Computer Society Press, Los Alamitos (2004)
Deng, J., Han, R., Mishra, S.: Countermeasures against traffic analysis attacks in wireless sensor networks. SecureComm., 113–126 (September 2005)
Yang, Y., Shao, M., Zhu, S., Urgaonkar, B., Cao, G.: Towards event source unobservability with minimum network traffic in sensor networks. In: Proceedings of the WiSec, pp. 77–88 (2008)
Shao, M., Yang, Y., Zhu, S., Cao, G.: Towards statistically strong source anonymity for sensor networks. IEEE INFOCOM, 51–55 (April 2008)
Kamat, P., Zhang, Y., Trappe, W., Ozturk, C.: Enhancing source-location privacy in sensor network routing. IEEE ICDCS, 599–608 (June 2005)
Ozturk, C., Zhang, Y., Trappe, W.: Source-location privacy in energy-constrained sensor network routing. In: SASN, pp. 88–93. ACM Press, New York (2004)
Xi, Y., Schwiebert, L., Shi, W.: Preserving source location privacy in monitoring-based wireless sensor networks. In: IEEE IPDPS (2006)
Jian, Y., Chen, S., Zhang, Z., Zhang, L.: A novel scheme for protecting receiver’s location privacy in wireless sensor networks. IEEE Transactions on Wireless Communications 7, 3769–3779 (2008)
Zhang, Y., Liu, W., Fang, Y., Wu, D.: Secure localization and authentication in ultra-wideband sensor networks. IEEE Journal on Selected Areas in Communications 24, 829–835 (2006)
Cheng, X., Thaeler, A., Xue, G., Chen, D.: Tps: a time-based positioning scheme for outdoor wireless sensor networks. IEEE INFOCOM 4, 2685–2696 (2004)
Wikipedia, Normal distribution, http://en.wikipedia.org/wiki/Normal_distribution
Stigler, S.M.: Statistics on the Table, ch. 22. Harvard University Press
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
Li, Y., Ren, J. (2009). Providing Source-Location Privacy in Wireless Sensor Networks. In: Liu, B., Bestavros, A., Du, DZ., Wang, J. (eds) Wireless Algorithms, Systems, and Applications. WASA 2009. Lecture Notes in Computer Science, vol 5682. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03417-6_33
Download citation
DOI: https://doi.org/10.1007/978-3-642-03417-6_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03416-9
Online ISBN: 978-3-642-03417-6
eBook Packages: Computer ScienceComputer Science (R0)