Loading [MathJax]/extensions/MathMenu.js
pDCS: Security and Privacy Support for Data-Centric Sensor Networks | IEEE Journals & Magazine | IEEE Xplore

pDCS: Security and Privacy Support for Data-Centric Sensor Networks


Abstract:

The demand for efficient data dissemination/access techniques to find relevant data from within a sensor network has led to the development of data-centric sensor (DCS) n...Show More

Abstract:

The demand for efficient data dissemination/access techniques to find relevant data from within a sensor network has led to the development of data-centric sensor (DCS) networks, where the sensor data instead of sensor nodes are named based on attributes such as event type or geographic location. However, saving data inside a network also creates security problems due to the lack of tamper resistance of the sensor nodes and the unattended nature of the sensor network. For example, an attacker may simply locate and compromise the node storing the event of his interest. To address these security problems, we present pDCS, a privacy-enhanced DCS network which offers different levels of data privacy based on different cryptographic keys. pDCS also includes an efficient key management scheme to facilitate the management of multiple types of keys used in the system. In addition, we propose several query optimization techniques based on Euclidean Steiner tree and keyed bloom filter (KBF) to minimize the query overhead while preserving query privacy. Finally, detailed analysis and simulations show that the KBF scheme can significantly reduce the message overhead with the same level of query delay and maintain a very high level of query privacy.
Published in: IEEE Transactions on Mobile Computing ( Volume: 8, Issue: 8, August 2009)
Page(s): 1023 - 1038
Date of Publication: 02 December 2008

ISSN Information:

References is not available for this document.

1 Introduction

Sensor networks are envisioned to be extremely useful for a broad spectrum of emerging civil and military applications [1], such as remote surveillance, habitat monitoring, and collaborative target tracking. Sensor networks scale in size as time goes on, so does the amount of sensing data generated. The large volume of data coupled with the fact that the data are spread across the entire network creates a demand for efficient data dissemination/access techniques to find the relevant data from within the network. This demand has led to the development of Data-Centric Sensor (DCS) networks [2], [3], [4].

Select All
1.
I. Akyildiz, W. Su, Y. Sankarasubramaniam and E. Cayirci, "Wireless Sensor Networks: A Survey", Computer Networks, vol. 38, no. 4, Mar. 2002.
2.
S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, et al., "GHT: A Geographic Hash Table for Data-Centric Storage", Proc. First ACM Workshop Wireless Sensor Networks and Applications (WSNA '02), Sept. 2002.
3.
A. Ghose, J. Grobklags and J. Chuang, "Resilient Data-Centric Storage in Wireless Ad-Hoc Sensor Networks", Proc. Fourth Int'l Conf. Mobile Data Management (MDM '03), pp. 45-62, 2003.
4.
W. Zhang, G. Cao and T. La Porta, "Data Dissemination with Ring-Based Index for Wireless Sensor Networks", Proc. 11th IEEE Int'l Conf. Network Protocols (ICNP '03), pp. 305-314, Nov. 2003.
5.
B. Karp and H. Kung, "GPSR: Greedy Perimeter Stateless Routing for Wireless Networks", Proc. ACM MobiCom, 2000.
6.
F. Ye, H. Luo, J. Cheng, S. Lu and L. Zhang, "A Two-Tier Data Dissemination Model for Large-Scale Wireless Sensor Networks", Proc. ACM MobiCom, pp. 148-159, Sept. 2002.
7.
S. Ratnasamy, D. Estrin, R. Govindan, B. Karp, L. Yin, S. Shenker, et al., "Data-Centric Storage in Sensornets", Proc. ACM First Workshop Hot Topics in Networks, 2001.
8.
The Smartdust Project, 2008, [online] Available: http://robotics.eecs.berkeley.edu/pister/SmartDust/.
9.
P. Winter and M. Zachariasen, "Euclidean Steiner Minimum Trees: An Improved Exact Algorithm", Networks, vol. 30, no. 3, pp. 149-166, 1997.
10.
G. Myles, A. Friday and N. Davies, "Preserving Privacy in Environments with Location-Based Applications", IEEE Pervasive Computing, 2003.
11.
U. Hengartner and P. Steenkiste, "Protecting Access to People Location Information", Proc. First Int'l Conf. Security in Pervasive Computing (SPC '03), 2003.
12.
E. Snekkenes, "Concepts for Personal Location Privacy Policies", Proc. Third ACM Conf. Electronic Commerce (EC '01), 2001.
13.
M. Gruteser, G. Schelle, A. Jain, R. Han and D. Grunwald, "Privacy-Aware Location Sensor Networks", Proc. Ninth USENIX Workshop Hot Topics in Operating Systems (HotOS '03), 2003.
14.
J. Deng, R. Han and S. Mishra, "Intrusion Tolerance and Anti-Traffic Analysis Strategies for Wireless Sensor Networks", Proc. Int'l Conf. Dependable Systems and Networks (DSN '04), June 2004.
15.
D. Chaum, "Untraceable Electronic Mail Return Address and Digital Pseudonyms", Comm. ACM, vol. 24, no. 2, pp. 84-88, 1981.
16.
C. Ozturk, Y. Zhang and W. Trappe, "Source-Location Privacy in Energy-Constrained Sensor Networks Routing", Proc. ACM Workshop Security of Ad Hoc and Sensor Networks (SASN '04), Oct. 2004.
17.
M. Shao, S. Zhu, W. Zhang and G. Cao, "pDCS: Security and Privacy Support for Data-Centric Sensor Networks", Proc. IEEE INFOCOM, 2007.
18.
A. Perrig, R. Szewczyk, V. Wen, D. Culler and J. Tygar, "Spins: Security Protocols for Sensor Networks", Proc. ACM MobiCom, 2001.
19.
S. Zhu, S. Setia and S. Jajodia, "Leap: Efficient Security Mechanisms for Large-Scale Distributed Sensor Networks", Proc. 10th ACM Conf. Computer and Comm. Security (CCS '03), 2003.
20.
H. Chan, A. Perrig and D. Song, "Random Key Predistribution Schemes for Sensor Networks", Proc. IEEE Security and Privacy Symp., 2003.
21.
W. Du, J. Deng, Y. Han and P. Varshney, "A Pairwise Key Pre-Distribution Scheme for Wireless Sensor Networks", Proc. 10th ACM Conf. Computer and Comm. Security (CCS '03), pp. 42-51, 2003.
22.
L. Eschenauer and V. Gligor, "A Key-Management Scheme for Distributed Sensor Networks", Proc. Ninth ACM Conf. Computer and Comm. Security (CCS '02), 2002.
23.
D. Liu and P. Ning, "Establishing Pairwise Keys in Distributed Sensor Networks", Proc. 10th ACM Conf. Computer and Comm. Security (CCS '03), 2003.
24.
S. Zhu, S. Xu, S. Setia and S. Jajodia, "Establishing Pair-Wise Keys for Secure Communication in Ad Hoc Networks: A Probabilistic Approach", Proc. 11th IEEE Int'l Conf. Network Protocols (ICNP '03), 2003.
25.
Y. Zhang, W. Liu, W. Lou and Y. Fang, "Location-Based Compromise-Tolerant Security Mechanisms for Wireless Sensor Networks", IEEE J. Selected Areas in Comm., Feb. 2006.
26.
W. Zhang and G. Cao, "Group Rekeying for Filtering False Data in Sensor Networks: A Predistribution and Local Collaboration-Based Approach", Proc. IEEE INFOCOM, Mar. 2005.
27.
W. Zhang, M. Tran, S. Zhu and G. Cao, "A Random Perturbation-Based Scheme for Pairwise Key Establishment in Sensor Networks", Proc. ACM MobiHoc, 2007.
28.
C.K. Wong, M. Gouda and S. Lam, "Secure Group Communication Using Key Graphs", Proc. ACM SIGCOMM, 1998.
29.
A. Perrig, D. Song and D. Tygar, "Elk a New Protocol for Efficient Large-Group Key Distribution", Proc. IEEE Symp. Security and Privacy, 2001.
30.
D. Naor, M. Naor and J. Lotspiech, "Revocation and Tracing Schemes for Stateless Receivers", Proc. Advances in Cryptology (CRYPTO '01), pp. 41-62, 2001.
Contact IEEE to Subscribe

References

References is not available for this document.