A Highly Scalable Key Pre-Distribution Scheme for Wireless Sensor Networks

被引:80
作者
Bechkit, Walid [1 ]
Challal, Yacine [1 ]
Bouabdallah, Abdelmadjid [1 ,2 ,3 ]
Tarokh, Vahid [4 ]
机构
[1] Univ Technol Compiegne, UMR CNRS 7253, Lab HeuDiaSyc, Compiegne, France
[2] Univ Technol Compiegne, Networking & Secur Res Grp, Compiegne, France
[3] Univ Technol Compiegne, Interact & Cooperat Res Excellence Res Ctr LABEX, Compiegne, France
[4] Harvard Univ, Sch Engn & Appl Sci, Cambridge, MA 02138 USA
关键词
Wireless sensor networks; security; key management; network scalability; secure connectivity coverage; MANAGEMENT SCHEME; UNITALS;
D O I
10.1109/TWC.2012.010413.120732
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Given the sensitivity of the potential WSN applications and because of resource limitations, key management emerges as a challenging issue for WSNs. One of the main concerns when designing a key management scheme is the network scalability. Indeed, the protocol should support a large number of nodes to enable a large scale deployment of the network. In this paper, we propose a new scalable key management scheme for WSNs which provides a good secure connectivity coverage. For this purpose, we make use of the unital design theory. We show that the basic mapping from unitals to key pre-distribution allows us to achieve high network scalability. Nonetheless, this naive mapping does not guarantee a high key sharing probability. Therefore, we propose an enhanced unital-based key pre-distribution scheme providing high network scalability and good key sharing probability approximately lower bounded by 1 - e(-1) approximate to 0.632. We conduct approximate analysis and simulations and compare our solution to those of existing methods for different criteria such as storage overhead, network scalability, network connectivity, average secure path length and network resiliency. Our results show that the proposed approach enhances the network scalability while providing high secure connectivity coverage and overall improved performance. Moreover, for an equal network size, our solution reduces significantly the storage overhead compared to those of existing solutions.
引用
收藏
页码:948 / 959
页数:12
相关论文
共 24 条
[1]  
Assmus E.F., 1992, CAMBRIDGE TRACTS MAT, V103
[2]  
Bechkit W., P 2012 IEEE ICCCN, P1
[3]   Unitals and codes [J].
Betten, A ;
Betten, D ;
Tonchev, VD .
DISCRETE MATHEMATICS, 2003, 267 (1-3) :23-33
[4]  
BLOM R, 1985, LECT NOTES COMPUT SC, V209, P335
[5]  
Camtepe S. A., 2005, TR0507
[6]   Combinatorial design of key distribution mechanisms for wireless sensor networks [J].
Camtepe, Seyit A. ;
Yener, Bulent .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2007, 15 (02) :346-358
[7]  
Castelluccia C., P 2007 IEEE SEC, P351
[8]   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
[9]  
Choi T., P 2011 IEEE WOWMOM, P1
[10]  
Doddavenkatappa M., P 2011 IEEE ICC, P1