A hybrid design of key pre-distribution scheme for wireless sensor networks

被引：0
作者：
Chakrabarti, D [1 ]
Maitra, S [1 ]
Roy, B [1 ]
机构：
[1] Indian Stat Inst, Appl Stat Unit, Kolkata 700108, W Bengal, India
来源：
INFORMATION SYSTEMS SECURITY, PROCEEDINGS | 2005年 / 3803卷
关键词：
combinatorial design; sensor network; key pre-distribution; random merging;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Here a scheme is presented for key pre-distribution in wireless sensor networks. A transversal design is considered to construct a (v, b, r, k) configuration. Then properly chosen blocks are merged to form sensor nodes such that there is no intra-node common key. The choice of blocks in merging is currently made heuristically in a randomized manner. The scheme is called hybrid as a combinatorial design followed by a heuristic is applied. Detailed analysis is presented regarding the number of nodes, number of keys per nodes and the probability that a link gets affected if certain number of nodes are compromised. It is also argued how the scheme compares favourably with the state of the art proposals. Towards the end we also present a result to find out the lower bound on the number of nodes given a certain combinatorial design.
引用
收藏
页码：228 / 238
页数：11
相关论文
共 14 条
[1]  
[Anonymous], 2002, CRYPTOGRAPHY THEORY
[2]  
BLOM R, 1985, LECT NOTES COMPUT SC, V209, P335
[3]  
CAMTEPE SA, EUROSICS 2004
[4]  
CHAKRABARTI D, LECT NOTES COMPUTER, V3650
[5]   Random key predistribution schemes for sensor networks [J].
Chan, HW ;
Perrig, A ;
Song, D .
2003 IEEE SYMPOSIUM ON SECURITY AND PRIVACY, PROCEEDINGS, 2003, :197-213
[6]  
Dinitz, 1996, CRC HDB COMBINATORIA
[7]  
Du W, 2003, P 10 ACM C COMP COMM, P42, DOI [10.1145/948109.948118, DOI 10.1145/948109.948118]
[8]  
Eschenauer L., 2002, Proceedings of the ACM Conference on Computer and Communications Security, P41, DOI [10.1145/586110.586117, DOI 10.1145/586110.586117]
[9]  
Kahn J. M., 1999, P 5 ANN ACM IEEE INT, P483
[10]  
LEE J, 2005, IEEE WIR COMP NETW C
12