Groupwise pairwise scheme for wireless sensor networks

Stephen Anokye, Thabo Semong, Qiaoliang Li, Qiang Hu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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[6].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[6] and other group key management schemes such as [14]and [16].

Original languageEnglish
Title of host publicationProceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009
Pages695-699
Number of pages5
DOIs
Publication statusPublished - Nov 20 2009
Event2009 International Conference on New Trends in Information and Service Science, NISS 2009 - Beijing, China
Duration: Jun 30 2009Jul 2 2009

Other

Other2009 International Conference on New Trends in Information and Service Science, NISS 2009
CountryChina
CityBeijing
Period6/30/097/2/09

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Software

Fingerprint Dive into the research topics of 'Groupwise pairwise scheme for wireless sensor networks'. Together they form a unique fingerprint.

Cite this