Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Blom, R.: An optimal class of symmetric key generation systems. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 335–338. Springer, Heidelberg (1985)
Camtepe, S.A., Yener, B.: Combinatorial design of key distribution mechanisms for wireless sensor networks. Eurosics (2004)
Chakrabarti, D., Maitra, S., Roy, B.: A Key Pre-distribution Scheme for Wireless Sensor Networks: Merging Blocks in Combinatorial Design. In: Zhou, J., López, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 89–103. Springer, Heidelberg (2005)
Chan, H., Perrig, A., Song, D.: Random key predistribution schemes for sensor networks. In: IEEE Symposium on Research in Security and Privacy, pp. 197–213 (2003)
Colbourn, C.J., Dinitz, J.H.: The CRC Handbook of Combinatorial Designs. CRC Press, Boca Raton (1996)
Du, W., Ding, J., Han, Y.S., Varshney, P.K.: A pairwise key pre-distribution scheme for wireles sensor networks. In: Proceedings of the 10th ACM conference on Computer and Communicatios Security, pp. 42–51. ACM CCS, New York (2003)
Eschenauer, L., Gligor, V.B.: A key-management scheme for distributed sensor networks. In: Proceedings of the 9th ACM conference on Computer and Communicatios Security, pp. 41–47. ACM CCS, New York (2002)
Kahn, J.M., Katz, R.H., Pister, K.S.J.: Next century challenges: Mobile networking for smart dust. In: Proceedings of the 5th annual ACM/IEEE international conference on mobile computing and networking, pp. 483–492 (1999)
Stinson, D.: Cryptography: Theory and Practice, 2nd edn. Chapman & Hall, CRC Press, Boca Raton (2002)
Lee, J., Stinson, D.: Deterministic key predistribution schemes for distributed sensor networks. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 294–307. Springer, Heidelberg (2004)
Lee, J., Stinson, D.: A combinatorial approach to key predistribution for distributed sensor networks. In: IEEE Wireless Computing and Networking Conference (WCNC 2005), New Orleans, LA, USA, March 13-17 (2005)
Street, A.P., Street, D.J.: Combinatorics of experimental design. Clarendon Press, Oxford (1987)
Liu, D., Ning, P.: Establishing pairwise keys in distributed sensor networks. In: Proceedings of the 10th ACM conference on Computer and Communicatios Security. ACM CCS, New York (2003)
Stinson, D.R.: Combinatorial Designs: Constructions and Analysis. Springer, New York (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakrabarti, D., Maitra, S., Roy, B. (2005). A Hybrid Design of Key Pre-distribution Scheme for Wireless Sensor Networks. In: Jajodia, S., Mazumdar, C. (eds) Information Systems Security. ICISS 2005. Lecture Notes in Computer Science, vol 3803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11593980_17
Download citation
DOI: https://doi.org/10.1007/11593980_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30706-8
Online ISBN: 978-3-540-32422-5
eBook Packages: Computer ScienceComputer Science (R0)