A Space-Efficient Algorithm for Pre-distributing Pairwise Keys in Sensor Networks

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(√N), where N is the size of the network. As a result, our approach provides better scalability than previous approaches.