ACM Home Page
Please provide us with feedback. Feedback
Group-based key pre-distribution in wireless sensor networks
Full text PdfPdf (219 KB)
Source Workshop on Wireless Security archive
Proceedings of the 4th ACM workshop on Wireless security table of contents
Cologne, Germany
SESSION: Key management table of contents
Pages: 11 - 20  
Year of Publication: 2005
ISBN:1-59593-142-2
Authors
Donggang Liu  University of Texas at Arlington
Peng Ning  North Carolina State University
Wenliang Du  Syracuse University
Sponsors
ACM: Association for Computing Machinery
SIGMOBILE: ACM Special Interest Group on Mobility of Systems, Users, Data and Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 17,   Downloads (12 Months): 151,   Citation Count: 12
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1080793.1080798
What is a DOI?

ABSTRACT

Many key pre-distribution techniques have been developed recently to establish pairwise keys for wireless sensor networks. To further improve these schemes, researchers have proposed to take advantage of sensors' expected locations to help pre-distributing keying materials. However, it is usually very difficult, and sometimes impossible, to guarantee the knowledge of sensors' expected locations. In order to remove the dependency on expected locations, this paper proposes a practical deployment model, where sensor nodes are deployed in groups, and the nodes in the same group are close to each other after the deployment. Based on this model, the paper develops a novel group-based key pre-distribution framework, which can be combined with any of existing key pre-distribution techniques. A distinguishing property of this framework is that it does not require the knowledge of sensors' expected locations and greatly simplifies the deployment of sensor networks. The analysis also shows that the framework can substantially improve the security as well as the performance of existing key pre-distribution techniques.


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
D.W. Carman, P.S. Kruus, and B.J.Matt. Constrains and approaches for distributed sensor network security. Technical report, NAI Labs, 2000.
 
5
H. Chan and A. Perrig. PIKE: Peer intermediaries for key establishment in sensor networks. In Proceedings of IEEE Infocom, March 2005.
 
6
7
 
8
W. Du, J. Deng, Y. S. Han, S. Chen, and P. Varshney. A key management scheme for wireless sensor networks using deployment knowledge. In Proceedings of IEEE INFOCOM'04, March 2004.
9
10
11
12
 
13
L. Hu and D. Evans. Secure aggregation for wireless networks. In Workshop on Security and Assurance in Ad Hoc Networks, January 2003.
14
15
 
16
C. Karlof and D. Wagner. Secure routing in wireless sensor networks: Attacks and countermeasures. In Proceedings of 1st IEEE International Workshop on Sensor Network Protocols and Applications, May 2003.
17
18
 
19
D. Niculescu and B. Nath. Ad hoc positioning system (APS). In Proceedings of IEEE GLOBECOM '01, 2001.
20
21
22
 
23
 
24
Z. Yu and Y. Guan. A key pre-distribution scheme using deployment knowledge for wireless sensor networks. In Proceedings of ACM/IEEE International Conference on Information Processing in Sensor Networks (IPSN), April 2005.
25

CITED BY  12
 
 
 
 

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