A space-efficient algorithm for pre-distributing pairwise keys in sensor networks

Authors:
Taekyun Kim;Sangjin Kim;Heekuck Oh
Affiliations:
Department of Computer Science and Engineering, Hanyang University, Korea;School of Internet Media Engineering, Korea University of Technology and Education, Korea;Department of Computer Science and Engineering, Hanyang University, Korea
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part III
Year:
2005

Citing 3
Cited 0

A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Security support for in-network processing in Wireless Sensor Networks

Proceedings of the 1st ACM workshop on Security of ad hoc and sensor networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a space-efficient key pre-distribution scheme based on quasi-orthogonal finite projective plane. This approach, compared to the previous approaches, guarantees full connectivity and the uniqueness of pairwise keys. Moreover, the size of the key ring depends not on the size of the key pool, but on the size of the network. The actual order of the key ring size is only $O(\sqrt{N})$, where N is the size of the network. As a result, our approach provides better scalability than previous approaches.