A key pre-distribution scheme for wireless sensor networks: Merging blocks in combinatorial design

被引：16

作者：

Chakrabarti D. ^{[1
]}

Maitra S. ^{[1
]}

Roy B. ^{[1
]}

机构：

[1] Applied Statistics Unit, Indian Statistical Institute, Kolkata 700108

来源：

International Journal of Information Security | 2006年 / 5卷 / 2期

关键词：

Combinatorial design; Key pre-distribution; Random merging; Sensor network;

D O I：

10.1007/s10207-006-0085-4

中图分类号：

学科分类号：

摘要：

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. © Springer-Verlag 2006.

引用

页码：105 / 114

页数：9

共 15 条

[1]

Blom R., An optimal class of symmetric key generation systems, Eurocrypt, LNCS 209, 84, pp. 335-338, (1985)

[2]

Camtepe S.A., Yener B., Combinatorial design of key distribution mechanisms for wireless sensor networks, Eurosics, (2004)

[3]

Chakrabarti D., Maitra S., Roy B., A hybrid design of key pre-distribution scheme for wireless sensor networks, The 1st International Conference on Information Systems Security, 3803, pp. 228-238, (2005)

[4]

Chan H., Perrig A., Song D., Random key predistribution schemes for sensor networks, IEEE Symposium on Research in Security and Privacy, pp. 197-213, (2003)

[5]

Colbourn C.J., Dinitz J.H., The CRC Handbook of Combinatorial Designs, (1996)

[6]

Du W., Ding J., Han Y.S., Varshney P.K., A pairwise key pre-distribution scheme for wireles sensor networks, Proceedings of the 10th ACM Conference on Computer and Communications Security, pp. 42-51, (2003)

[7]

Eschenauer L., Gligor V.B., A key-management scheme for distributed sensor networks, Proceedings of the 9th ACM Conference on Computer and Communications Security, pp. 41-47, (2002)

[8]

Gura N., Patel A., Wander A., Eberle H., Shantz S.C., Comparing elliptic curve cryptography and RSA on 8-bit CPUs, pp. 119-132, (2004)

[9]

Kahn J.M., Katz R.H., Pister K.S.J., Next century challenges: Mobile networking for smart dust, Proceedings of the 5th Annual ACM/IEEE International Conference on Mobile Computing and Networking, pp. 483-492, (1999)

[10]

Lee J., Stinson D., Deterministic key predistribution schemes for distributed sensor networks, 3357, pp. 294-307, (2004)

← 1 2 →