Conference Proceeding

Groupwise Pairwise Scheme for Wireless Sensor Networks

Sch. of Comput. & Commun., Hunan Univ., Changsha, China
08/2009; DOI:10.1109/NISS.2009.120 pp.695 - 699 In proceeding of: New Trends in Information and Service Science, 2009. NISS '09. International Conference on
Source: IEEE Xplore

ABSTRACT With the proliferation of wireless sensor networks, it has become expedient to secure the communication links between two sensor nodes. Due to the resource constraints of wireless sensor networks, traditional key management schemes such as the Diffie-Hellman and public key schemes are not applicable in wireless sensor networks. Our work seeks to improve on the pairwise scheme and the random pairwise scheme by Chang, Perrig and Song. Compared with the pairwise scheme, our scheme significantly reduces the memory and computational overheads in the pairwise scheme while maintaining the same resilience against node capture and connectivity and it has better connectivity than that of Chan et al and other group key management schemes such as and.

0 0
 · 
0 Bookmarks
 · 
19 Views
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.

Keywords

Chan
 
Chang
 
communication links
 
connectivity
 
group key management schemes
 
node capture
 
pairwise scheme
 
proliferation
 
public key schemes
 
random pairwise scheme
 
resource constraints
 
sensor nodes
 
traditional key management schemes
 
wireless sensor networks