Performance Analysis of Expander Graph Based Key Predistribution Scheme in WSN

The security of wireless sensor networks is a significant concern and can be achieved by the application of cryptographic algorithms. The symmetric key encryption techniques are widely used cryptographic mechanisms for the security of sensor networks due to its low computational complexity. A symmetric key encryption technique requires a secret key to be shared between both parties for confidential communication. In a wireless sensor network, it is difficult to know which node is going to be in its communication range at the deployment phase. If prior knowledge of sensor location exists, it is an added advantage and helps in the distribution of secret keys among nodes. Even if with the expected location information, distributing the keys properly among the nodes is a challenging task. A proper algorithm must be used so that it gives the adequate utilization of the distributed keys with a minimal number of keys per sensor node. In this paper, we propose a location-dependent key distribution scheme. We use Delaunay Triangulation for the efficient distribution of keys among sensor nodes. The method gives a high probability of secure communication links among nodes with high resilience to the network.

show abstract

Performance Analysis of Expander Graph Based Key Predistribution Scheme in WSN

Cited by 3 publications

References 9 publications

Location-Independent Key Distribution for Sensor Network Using Regular Graph

Location-Independent Key Distribution for Sensor Network Using Regular Graph

Combinatorial group based approach for key pre-distribution scheme in wireless sensor network

Delaunay Triangulation Based Key Distribution for Three-Dimensional Wireless Sensor Networks

Contact Info

Product

Resources

About