This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Quantitative Measurement and Design of Source-Location Privacy Schemes for Wireless Sensor Networks
July 2012 (vol. 23 no. 7)
pp. 1302-1311
ASCII Text
x 
 
Yun Li, Jian Ren, Jie Wu, "Quantitative Measurement and Design of Source-Location Privacy Schemes for Wireless Sensor Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 7, pp. 1302-1311, July, 2012.
 
 
BibTex
x
 
@article{ 10.1109/TPDS.2011.260,
author = {Yun Li and Jian Ren and Jie Wu},
title = {Quantitative Measurement and Design of Source-Location Privacy Schemes for Wireless Sensor Networks},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {23},
number = {7},
issn = {1045-9219},
year = {2012},
pages = {1302-1311},
doi = {http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.260},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Quantitative Measurement and Design of Source-Location Privacy Schemes for Wireless Sensor Networks
IS - 7
SN - 1045-9219
SP1302
EP1311
EPD - 1302-1311
A1 - Yun Li,
A1 - Jian Ren,
A1 - Jie Wu,
PY - 2012
KW - Source-location privacy
KW - source-location information leakage
KW - quantitative measurement
KW - wireless sensor networks (WSNs).
VL - 23
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 
Yun Li, Microsoft, Redmond
Jian Ren, Michigan State University, East Lansing
Jie Wu, Temple University, Philadelphia
Wireless sensor networks (WSNs) have been widely used in many areas for critical infrastructure monitoring and information collection. While confidentiality of the message can be ensured through content encryption, it is much more difficult to adequately address source-location privacy (SLP). For WSNs, SLP service is further complicated by the nature that the sensor nodes generally consist of low-cost and low-power radio devices. Computationally intensive cryptographic algorithms (such as public-key cryptosystems), and large scale broadcasting-based protocols may not be suitable. In this paper, we first propose criteria to quantitatively measure source-location information leakage in routing-based SLP protection schemes for WSNs. Through this model, we identify vulnerabilities of some well-known SLP protection schemes. We then propose a scheme to provide SLP through routing to a randomly selected intermediate node (RSIN) and a network mixing ring (NMR). Our security analysis, based on the proposed criteria, shows that the proposed scheme can provide excellent SLP. The comprehensive simulation results demonstrate that the proposed scheme is very efficient and can achieve a high message delivery ratio. We believe it can be used in many practical applications.

[1] D. Chaum, "Untraceable Electronic Mail, Return Addresses, and Digital Pseudonyms," Comm. the ACM, vol. 24, pp. 84-90, Feb. 1981.
[2] M. Reed, P. Syverson, and D. Goldschlag, "Anonymous Connections and Onion Routing," IEEE J. Selected Areas in Comm., vol. 16, no. 4, pp. 482-494, May 1998.
[3] M. Reiter and A. Rubin, "Crowds: Anonymity for Web Transaction," ACM Trans. Information and System Security, vol. 1, no. 1, pp. 66-92, 1998.
[4] M. Shao, Y. Yang, S. Zhu, and G. Cao, "Towards Statistically Strong Source Anonymity for Sensor Networks," Proc. IEEE INFOCOM '08, pp. 51-55, Apr. 2008.
[5] P. Kamat, Y. Zhang, W. Trappe, and C. Ozturk, "Enhancing Source-Location Privacy in Sensor Network Routing," Proc. IEEE 25th Int'l Conf. Distributed Computing Systems (ICDCS '05), pp. 599-608, June 2005.
[6] Y. Li and J. Ren, "Preserving Source-Location Privacy in Wireless Sensor Networks," Proc. IEEE SECON '09, June 2009.
[7] Y. Li and J. Ren, "Source-Location Privacy through Dynamic Routing in Wireless Sensor Networks," Proc. IEEE INFOCOM '10, Mar. 2010.
[8] http:/www.panda.org/, 2011.
[9] J. Hill, R. Szewczyk, S.H.A. Woo, D. Culler, and K. Pister, "System Architecture Directions for Networked Sensors," Proc. ACM Ninth Int'l Conf. Architectural Support for Programming Languages and Operating Systems (ASPLOS IX), Nov. 2000.
[10] J.W. Suurballe, "Disjoint Paths in a Network," Wiley Periodicals, vol. 4, pp. 125-145, 1974.
[11] J.W. Suurballe and R.E. Tarjan, "A Quick Method for Finding Shortest Pairs of Disjoint Paths," Wiley Periodicals, vol. 14, pp. 325-336, 1984.
[12] R. Bhandari, "Optimal Physical Diversity Algorithms and Survivable Networks," Proc. IEEE Second Symp. Computers and Comm., pp. 433-441, 1997.
[13] A. Srinivas1 and E. Modiano, "Finding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks," Wireless Networks, vol. 11, pp. 401-417, July 2005.
[14] H. Wang, B. Sheng, and Q. Li, "Privacy-Aware Routing in Sensor Networks," Computer Networks, vol. 53, no. 9, pp. 1512-1529, 2009.
[15] S.M. Stigler, Statistics on the Table. Chapter 22. Harvard Univ. Press, 2002.
[16] N. Sematech, "Engineering Statistics Handbook," http://www. itl.nist.gov/div898/handbook/ eda/section3eda362.htm#CDF, 2011.
[17] Y. Li, L. Lightfoot, and J. Ren, "Routing-Based Source-Location Privacy Protection in Wireless Sensor Networks," Proc. IEEE Int'l Conf. Electro/Information Technology (EIT '09), June 2009.

Index Terms:
Source-location privacy, source-location information leakage, quantitative measurement, wireless sensor networks (WSNs).
Citation:
Yun Li, Jian Ren, Jie Wu, "Quantitative Measurement and Design of Source-Location Privacy Schemes for Wireless Sensor Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 23, no. 7, pp. 1302-1311, July 2012, doi:10.1109/TPDS.2011.260
Usage of this product signifies your acceptance of the Terms of Use.