Combinatorics of experimental design
Combinatorics of experimental design
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
A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design
International Journal of Information Security - Special issue on ISC'05
Key Predistribution Schemes Using Codes in Wireless Sensor Networks
Information Security and Cryptology
On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks
IWCC '09 Proceedings of the 2nd International Workshop on Coding and Cryptology
ACM Transactions on Sensor Networks (TOSN)
A new key-predistribution scheme for highly mobile sensor networks
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Key pre-distribution using partially balanced designs in wireless sensor networks
International Journal of High Performance Computing and Networking
Determining parameters of key predistribution schemes via linear codes in wireless sensor networks
Inscrypt'10 Proceedings of the 6th international conference on Information security and cryptology
Key predistribution schemes for distributed sensor networks via block designs
Designs, Codes and Cryptography
| Hi-index | 0.00 |
We propose two deterministic key predistribution schemes in a Wireless Sensor Network (WSN), in which sensor nodes are deployed randomly. Both the schemes are based on Partially Balanced Incomplete Block Designs (PBIBD). An important feature of our scheme is that every pair of nodes can communicate directly, making communication faster and efficient. The number of keys per node is of the order of √N, where N is the number of nodes in the network. Our second design has the added advantage that we can introduce new nodes in the network keeping the key pool fixed. We study the resiliency of the network under node compromise and show that our designs give better results than the existing ones.