Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks

Camtepe, Seyit; Yener, Bülent

doi:10.1109/tnet.2007.892879

Cited by 267 publications

(65 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Consider the following technique. Generally, a sensor node corresponds to a block in combinatorial design [6,28]. Here one can merge a few blocks to get a sensor node.…”

Section: Key Predistributionmentioning

confidence: 99%

“…The use of combinatorial and probabilistic design (also a combination of bothtermed as hybrid design) in the context of key distribution has been proposed in the work by Camtepe and Yener [6]. In this case also, the main motivation was to have low number of common keys as in the work by Lee and Stinson [28].…”

Section: Key Predistributionmentioning

confidence: 99%

“…report that count nodes are formed such that there is no intranode connectivity. 6. for rest of the (r 2 − count · z) blocks, merge z blocks randomly to form a node (they may have intranode connectivity) to get ( r 2 /z − count) many extra nodes; this constitutes the initial configuration.…”

Section: A Heuristic: Merging Blocks Attempting To Minimize the Numbementioning

confidence: 99%

See 2 more Smart Citations

Secure Communication in Distributed Sensor Networks (DSN)

Nayak

2007

Handbook of Applied Algorithms

View full text Add to dashboard Cite

“…Consider the following technique. Generally, a sensor node corresponds to a block in combinatorial design [6,28]. Here one can merge a few blocks to get a sensor node.…”

Section: Key Predistributionmentioning

confidence: 99%

Section: Key Predistributionmentioning

confidence: 99%

Section: A Heuristic: Merging Blocks Attempting To Minimize the Numbementioning

confidence: 99%

See 1 more Smart Citation

Secure Communication in Distributed Sensor Networks (DSN)

Nayak

2007

Handbook of Applied Algorithms

View full text Add to dashboard Cite

“…For storage, the energy limited nodes; it will be a great burden. Literature [3][4][5][6][7] makes a more detailed analysis on this basis and the mechanism extends. Literature [8] proposes grid-based and Literature [9] proposes a com bination of methods which is the further study for the random key pre-distribution mechanism.…”

Section: Introductionmentioning

confidence: 99%

A New Kind of Dynamic Key Protocol for Wireless Sensor Network

Zhang¹,

Cheng²,

Wang³

2011

WSN

View full text Add to dashboard Cite

For the source limitations and vulnerabilities of the sensor nodes of Wireless Sensor Networks, we propose the new kind of dynamic key protocol for wireless sensor network, using the unidirection of hash function and the thinking of Hill to study the dynamic key matrix. Through theoretical analysis of some aspects, our method can promote security, connectivity expansibility; the results show that this protocol reduces storage space and communication energy consumption also.

show abstract

“…Consider the following technique. Generally, a sensor node corresponds to a block in combinatorial design [2,11]. Here we merge a few blocks to get a sensor node.…”

mentioning

confidence: 99%

A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design

Chakrabarti

Maitra

Roy

2006

Int. J. Inf. Secur.

View full text Add to dashboard Cite

In this paper, combinatorial design followed by randomized merging strategy is applied to key predistribution in sensor nodes. A transversal design is used to construct a (v, b, r, k) configuration and then randomly selected blocks are merged to form the sensor nodes. We present detailed mathematical analysis of the number of nodes, number of keys per node and the probability that a link gets affected if certain number of nodes are compromised. The technique is tunable to user requirements and it also compares favourably with state of the art design strategies. An important feature of our design is the presence of more number of common keys between any two nodes. Further, we study the situation when properly chosen blocks are merged to form sensor nodes such that the number of intranode common key is minimized. We present a basic heuristic for this approach and show that it provides slight improvement in terms of certain parameters than our basic random merging strategy.

show abstract

Combinatorial Design of Key Distribution Mechanisms for Wireless Sensor Networks

Cited by 267 publications

References 13 publications

Secure Communication in Distributed Sensor Networks (DSN)

Secure Communication in Distributed Sensor Networks (DSN)

A New Kind of Dynamic Key Protocol for Wireless Sensor Network

A key pre-distribution scheme for wireless sensor networks: merging blocks in combinatorial design

Contact Info

Product

Resources

About