Groupwise Pairwise Scheme for Wireless Sensor Networks
Stephen Anokye, Thabo Semong, Qiaoliang Li, Qiang Hu · 2009
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.