WiSec '08 Proceedings of the first ACM conference on Wireless network security
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
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
KALwEN: a new practical and interoperable key management scheme for body sensor networks
Security and Communication Networks
Key predistribution using partially balanced designs in wireless sensor networks
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
100% connectivity for location aware code based KPD in clustered WSN: merging blocks
ISC'12 Proceedings of the 15th international conference on Information Security
Key predistribution schemes for distributed sensor networks via block designs
Designs, Codes and Cryptography
Code based KPD scheme with full connectivity: deterministic merging
ICT-EurAsia'13 Proceedings of the 2013 international conference on Information and Communication Technology
Connecting, scaling and securing RS code and TD based KPDs in WSNs: deterministic merging
Proceedings of the fourteenth ACM international symposium on Mobile ad hoc networking and computing
| Hi-index | 0.01 |
In this paper, combinatorial design followed by randomized merging strategy is applied to key pre-distribution in sensor nodes. A transversal design is used to construct a (v, b, r, k) configuration and then randomly selected blocks are merged to form the sensor nodes. We present detailed mathematical analysis of the number of nodes, number of keys per node and the probability that a link gets affected if certain number of nodes are compromised. The technique is tunable to user requirements and it also compares favourably with state of the art design strategies. An important feature of our design is the presence of more number of common keys between any two nodes. Further, we study the situation when properly chosen blocks are merged to form sensor nodes such that the number of intra-node common key is minimized. We present a basic heuristic for this approach and show that it provides slight improvement in terms of certain parameters than our basic random merging strategy.