Clique Size in Sensor Networks with Key Pre-Distribution Based on Transversal Design*

Dibyendu Chakrabarti, Subhamoy Maitra and Bimal Roy

International Journal of Distributed Sensor Networks, 2005, vol. 1, issue 3-4, 345-354

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 analyse 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.

Keywords: Clique; Combinatorial Design; Distributed Sensor Networks; Key Pre-distribution; Random Merging; Secured Communication (search for similar items in EconPapers)
Date: 2005
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1080/15501320500364603 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:1:y:2005:i:3-4:p:345-354

DOI: 10.1080/15501320500364603

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().