ACM Home Page
Please provide us with feedback. Feedback
Group-based key predistribution for wireless sensor networks
Full text PdfPdf (438 KB)
Source
ACM Transactions on Sensor Networks (TOSN) archive
Volume 4 ,  Issue 2  (March 2008) table of contents
Article No. 11  
Year of Publication: 2008
ISSN:1550-4859
Authors
Donggang Liu  The University of Texas at Arlington, Arlington, TX
Peng Ning  North Carolina State University, Raleigh, NC
Wenliang Du  Syracuse University, Syracuse, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 40,   Downloads (12 Months): 485,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1340771.1340777
What is a DOI?

ABSTRACT

Many key predistribution techniques have been developed recently to establish pairwise keys between sensor nodes in wireless sensor networks. To further improve these schemes, researchers have also proposed to take advantage of the sensors' expected locations and discovered locations to help the predistribution of the keying materials. However, in many cases, it is very difficult to deploy sensor nodes at their expected locations or guarantee the correct location discovery at sensor nodes in hostile environments. In this article, a group-based deployment model is developed to improve key predistribution. In this model, sensor nodes are only required to be deployed in groups. The critical observation in the article is that the sensor nodes in the same group are usually close to each other after deployment. This deployment model is practical; it greatly simplifies the deployment of sensor nodes, while still providing an opportunity to improve key predistribution. Specifically, the article presents a novel framework for improving key predistribution using the group-based deployment knowledge. This framework does not require the knowledge of the sensors' expected or discovered locations and is thus suitable for applications where it is difficult to deploy the sensor nodes at their expected locations or correctly estimate the sensors' locations after deployment. To seek practical key predistribution schemes, the article presents two efficient instantiations of this framework, a hash key-based scheme and a polynomial-based scheme. The evaluation shows that these two schemes are efficient and effective for pairwise key establishment in sensor networks; they can achieve much better performance than the previous key predistribution schemes when the sensor nodes are deployed in groups.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
3
 
4
 
5
Capkun, S. and Hubaux, J. 2005. Secure positioning of wireless devices with application to sensor networks. In Proceedings of IEEE InfoCom'05.
 
6
Carman, D., Kruus, P., and Matt, B. J. 2000. Constrains and approaches for distributed sensor network security. Tech. rep. 00-010. NAI Labs, Glenwood, MD.
 
7
Chan, H. and Perrig, A. 2005. PIKE: Peer intermediaries for key establishment in sensor networks. In Proceedings of IEEE Infocom.
 
8
9
 
10
Du, W., Deng, J., Han, Y. S., Chen, S., and Varshney, P. 2004. A key management scheme for wireless sensor networks using deployment knowledge. In Proceedings of IEEE INFOCOM'04.
11
12
13
 
14
Hartung, C., Balasalle, J., and Han, R. 2005. Node compromise in sensor networks: The need for secure systems. Tech. Rep. CU-CS-990-05. University of Colorado at Boulder, Boulder, CO.
15
 
16
Hu, L. and Evans, D. 2003. Secure aggregation for wireless networks. In Proceedings of the Workshop on Security and Assurance in ad hoc Networks.
17
18
 
19
Karlof, C. and Wagner, D. 2003. Secure routing in wireless sensor networks: Attacks and countermeasures. In Proceedings of the 1st IEEE International Workshop on Sensor Network Protocols and Applications.
 
20
21
 
22
23
24
25
 
26
 
27
Niculescu, D. and Nath, B. 2001. Ad hoc positioning system (APS). In Proceedings of IEEE GLOBECOM '01.
28
29
30
 
31
Ray, S., Ungrangsi, R., Pellegrini, F. D., Trachtenberg, A., and Starobinski, D. 2003. Robust location detection in emergency sensor networks. In Proceedings of IEEE INFOCOM 2003.
 
32
 
33
34


Collaborative Colleagues:
Donggang Liu: colleagues
Peng Ning: colleagues
Wenliang Du: colleagues