Location Dependent Key Predistribution Scheme for Square Grid and Hexagonal Grid

Objective: To design a location aware key pre-distribution scheme for wireless sensor network deployed in square grid and hexagonal grid with minimum possible keys stored in each nodes. Methods/Statistical analysis: In location dependent key predistribution coordinates of the sensor nodes are known prior to deployment. Therefore their connectivity is known prior. Grid structured network is well fitted topology for various types of application in sensor network. Coverage and connectivity issues have been studied in these kinds of network. Security for these special structured is emerging topic of study and key predistribution as well. Findings: To efficient use of preloaded keys of the sensor nodes, the keys need to be distributed smartly. As in case of a square or hexagonal grid locations are known prior therefore it gives advantage in distributing the symmetric keys over the nodes. In this paper, we propose an algorithm using adjacency matrix of the network for square and hexagonal grid network. We analyze resilience against popular attack like node capture attack and node fabrication attack at the end of this paper. Application/Improvements: Staring with single key distribution, pair-wise key distribution, random key distribution and so on, various key predistribution schemes have been proposed in literature. Taking the advantage of structured topology of sensor network the algorithm enhances the overall performance.