Key PreDistribution Model for Wireless Sensor Network

ABSTRACT The collection of spatially disseminated autonomous sensors with restricted resources that work together and supervise the physical or environmental conditions is a Wireless Sensor Network (WSN). These networks are prone to various kinds of attacks because of their operating nature. The establishment of secure links between nodes is a problem in WSNs. Key management is one solution but it has become a challenging issue in the design and deployment of secure WSNs. Because of resource limitations, symmetric key establishment is one of the most suitable paradigms for securing exchanges in WSNs. Symmetric schemes were mainly categorized into two categories such as probabilistic and deterministic schemes. As WSNs are highly resource constrained, they suffer from reduced storage capacity. So, it is essential to design smart technique to build blocks of keys that will embed on nodes to secure network links. But in most existing solution, the design of key rings is related to network size. This solution either suffers from low scalability or degrades other performance metrics including secure connection, storage overhead. This motivates the use of unital design theory that allows a smart building of blocks with unique feature that allow coping with scalability and connection issues. In contrast to these solutions, the goal is to enhance the scalability of WSN key management scheme without degrading the other network performances. To achieve this goal, a new scalable key management scheme for WSN which provides good secure connectivity coverage is proposed which make use of the unital design theory. Also the basic mapping from unitals to key predistribution allows achieving high network scalability. But this naive mapping does not guaranteed a high key sharing probability. So, an enhanced unital-based key distribution scheme providing high network scalability and good key sharing probability is proposed.