Key Pre-distribution Schemes For Wireless Sensor Networks

Key management is the most important of the network security issues. In addition, the key storage and key distribution are two of the most important and the most difficult links. Based on the finite affine planes,symplectic geometry over finite fields, and Hamming code, key pre-distribution schemes for wirelesss sensor networks with the high connectivity and security are constructed. The first we concentrate on analyzing properties of points and lines in finite affine planes that relate to the connectivity, length of key-chains and the security of distributed sensor networks. A triangle in the affine plane represent a note in a network, points of the triangle represent keys of the note. Our scheme supports more nodes with the same key-chain sizes compared with other deterministic schemes and makes sure every pair of nodes within communication range can communicate directly. The second key pre-distribution scheme based on symplectic space was proposed. A v-1-dimensional subspace in 2v-dimensional symplectic spaces represents a note and all 1-dimensional subspaces represent keys. The scheme improves the network connectivity, at the same time, our scheme support more nodes with same key chain size compared with other key pre-distribution schemes. The third we use Hamming codes to present a key predistrubution scheme. A code word represents a note in a network, entries of the code word represent keys of the note. This scheme is better than some existed schemes in terms of network sizes.