Abstract
Key pre-distribution is an important area of research in Distributed Sensor Networks (DSN). Two sensor nodes are considered connected for secure communication if they share one or more common secret key(s). It is important to analyze the largest subset of nodes in a DSN where each node is connected to every other node in that subset (i.e., the largest clique). This parameter (largest clique size) is important in terms of resiliency and capability towards efficient distributed computing in a DSN. In this paper, we concentrate on the schemes where the key pre-distribution strategies are based on transversal design and study the largest clique sizes. We show that merging of blocks to construct a node provides larger clique sizes than considering a block itself as a node in a transversal 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. In: Eurosics 2004 (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)
Chakrabarti, D., Maitra, S., Roy, B.: A Hybrid Design of Key Pre-distribution Scheme for Wireless Sensor Networks. In: Jajodia, S., Mazumdar, C. (eds.) ICISS 2005. LNCS, vol. 3803, pp. 228–238. Springer, Heidelberg (2005)
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)
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)
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). Clique Size in Sensor Networks with Key Pre-distribution Based on Transversal Design. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_36
Download citation
DOI: https://doi.org/10.1007/11603771_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30959-8
Online ISBN: 978-3-540-32428-7
eBook Packages: Computer ScienceComputer Science (R0)