A key-management scheme for distributed sensor networks
Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks
SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Establishing pairwise keys in distributed sensor networks
Proceedings of the 10th ACM conference on Computer and communications security
Combinatorial Designs: Constructions and Analysis
Combinatorial Designs: Constructions and Analysis
A pairwise key predistribution scheme for wireless sensor networks
ACM Transactions on Information and System Security (TISSEC)
A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design
International Journal of Information Security - Special issue on ISC'05
Location-aware key predistribution scheme for wide area wireless sensor networks
Proceedings of the fourth ACM workshop on Security of ad hoc and sensor networks
ACM Transactions on Information and System Security (TISSEC)
A Key Management Scheme Using Deployment Knowledge for Wireless Sensor Networks
IEEE Transactions on Parallel and Distributed Systems
Key Predistribution Schemes Using Codes in Wireless Sensor Networks
Information Security and Cryptology
ACM Transactions on Sensor Networks (TOSN)
Deterministic key predistribution schemes for distributed sensor networks
SAC'04 Proceedings of the 11th international conference on Selected Areas in Cryptography
| Hi-index | 0.00 |
Key management in wireless sensor networks (WSN) is a challenging task because of the stringent resource available to the nodes. As such key predistribution (KPD) is regarded as one of the best option for key management in WSN. This work analyzes an existing work by Simonova et al. that makes use of deployment knowledge where the deployment zone consists of clusters of nodes. Transversal design (TD) based KPD scheme of Lee and Stinson is used to distribute the keys in these clusters. However Simonova et al. points out that any KPD could have been used. This leads the current authors to investigates the applicability of Ruj and Roy's Reed Solomon (RS) code based KPD , similar to the TD based KPD in distributing the key in each cluster. Much like the TD based KPD, the RS code based KPD does not offer full connectivity among nodes in the clusters amounting to lack of full connectivity in the amalgamated network. Full connectivity among nodes in each cluster and thus the entire network can be achieved by a deterministically merging strategy using exactly two nodes. This merging strategy is certainly better than a random approach by Chakrabarti et al. where the exact number of nodes being merged is not specified and does not ensure full connectivity. Since the scheme of Simonova et al. uses too many keys after amalgamation, a modified approach using Cluster Head (CH) is proposed to provide full communication in the network. Comparative study establishes the proposed Cluster Head design perform better than the KPD of Simonova et al. while proving the efficiency of the merging strategy.