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 language | English |
|---|---|
| Title of host publication | Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009 |
| Pages | 695-699 |
| Number of pages | 5 |
| DOIs | |
| Publication status | Published - Nov 20 2009 |
| Event | 2009 International Conference on New Trends in Information and Service Science, NISS 2009 - Beijing, China Duration: Jun 30 2009 → Jul 2 2009 |
Other
| Other | 2009 International Conference on New Trends in Information and Service Science, NISS 2009 |
|---|---|
| Country | China |
| City | Beijing |
| Period | 6/30/09 → 7/2/09 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Software
Cite this
}
Groupwise pairwise scheme for wireless sensor networks. / Anokye, Stephen; Semong, Thabo; Li, Qiaoliang; Hu, Qiang.
Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009. 2009. p. 695-699 5260950.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
TY - GEN
T1 - Groupwise pairwise scheme for wireless sensor networks
AU - Anokye, Stephen
AU - Semong, Thabo
AU - Li, Qiaoliang
AU - Hu, Qiang
PY - 2009/11/20
Y1 - 2009/11/20
N2 - 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].
AB - 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].
UR - http://www.scopus.com/inward/record.url?scp=70449573115&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70449573115&partnerID=8YFLogxK
U2 - 10.1109/NISS.2009.120
DO - 10.1109/NISS.2009.120
M3 - Conference contribution
AN - SCOPUS:70449573115
SN - 9780769536873
SP - 695
EP - 699
BT - Proceedings - 2009 International Conference on New Trends in Information and Service Science, NISS 2009
ER -