Improved Key Predistribution Scheme in Wireless Sensor Networks Using Cell Splitting in Hexagonal Grid Based Deployment Model

Abstract

Security in wireless sensor networks is an upcoming field which is quite different from traditional network security mechanisms. Many applications are dependent on the secure operation of a wireless sensor network, and have serious effects if the network is disrupted. Therefore, it is necessary to protect communication between sensor nodes. Key management plays an essential role in achieving security in wireless sensor networks. To achieve security, various key predistribution schemes have been proposed without deployment knowledge. Deployment knowledge can benefit the key predistribution scheme, as the nodes that are likely to be neighbors of each sensor node are assumed, and hence each node does not need to waste its memory to store unnecessary secret information. However, the existing key predistribution schemes require more memory and larger transmission range to achieve the desired connectivity. In order to enhance secure communication among sensor nodes, grid and hexagon deployment models are used. In both the deployment models, the sensor field is divided into equal grids. The keys are distributed from a large key pool randomly and pairwise keys are generated for each pair of sensor nodes. Once the pairwise keys are generated among neighboring nodes, they establish a secure connection and transmit data. We propose a new scheme based on cell splitting concept to improve the security level, in which a hexagon is subdivided in to smaller groups. The performance is evaluated in terms of connectivity and resilience against node capture. The analysis show that the performance is better using cell splitting concept compared to normal hexagon based scheme.