A Hybrid Design of Key Pre-distribution Scheme for Wireless Sensor Networks

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.

[1]  Douglas R. Stinson,et al.  Deterministic Key Predistribution Schemes for Distributed Sensor Networks , 2004, Selected Areas in Cryptography.

[2]  Bülent Yener,et al.  Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks , 2004, ESORICS.

[3]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[4]  Yunghsiang Sam Han,et al.  A pairwise key pre-distribution scheme for wireless sensor networks , 2003, CCS '03.

[5]  Randy H. Katz,et al.  Next century challenges: mobile networking for “Smart Dust” , 1999, MobiCom.

[6]  C. Colbourn,et al.  The CRC handbook of combinatorial designs , edited by Charles J. Colbourn and Jeffrey H. Dinitz. Pp. 784. $89.95. 1996. ISBN 0-8493-8948-8 (CRC). , 1997, The Mathematical Gazette.

[7]  Subhamoy Maitra,et al.  A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design , 2005, International Journal of Information Security.

[8]  A. Street,et al.  Combinatorics of experimental design , 1987 .

[9]  Donggang Liu,et al.  Establishing pairwise keys in distributed sensor networks , 2005, TSEC.

[10]  Rolf Blom,et al.  An Optimal Class of Symmetric Key Generation Systems , 1985, EUROCRYPT.

[11]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice , 1995 .

[12]  Douglas R. Stinson,et al.  Cryptography: Theory and Practice,Second Edition , 2002 .

[13]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[14]  Aggelos Kiayias,et al.  Polynomial Reconstruction Based Cryptography , 2001, Selected Areas in Cryptography.

[15]  Douglas R. Stinson,et al.  A combinatorial approach to key predistribution for distributed sensor networks , 2005, IEEE Wireless Communications and Networking Conference, 2005.