A Key Predistribution Scheme for Sensor Networks Using Deployment Knowledge
IEEE Transactions on Dependable and Secure Computing
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
Combinatorial structures for design of wireless sensor networks
ACNS'06 Proceedings of the 4th international conference on Applied Cryptography and Network Security
| Hi-index | 0.00 |
Key management, one of the most challenging problems in Wireless Sensor Network (WSN) has been efficiently addressed using Key Predistribution (KPD) schemes. This paper analyzes a localized KPD based on the Transversal Design (TD) design or Reed Solomon (RS) codes schemes; later two shown to be similar. They lack full direct communications among their constituent nodes and so, rely on multi-hop involving other nodes reducing the overall efficiency of the system. The communication issue for TD or RS and hence the localized KPD gets resolved by Deterministic Merging of exactly two nodes. The weakness of `selective node attack' of the merged designs, similar to their original KPDs, is overcome by invoking the novel trick of Sarkar \emph{et al.} Simulation results confirm that the various network parameters of the proposed schemes improves significantly over a random counterpart among other existing schemes.