Efficient Key Predistribution for Grid-Based Wireless Sensor Networks

Blackburn, Simon R.; Etzion, Tuvi; Martin, Keith M.; Paterson, Maura B.

doi:10.1007/978-3-540-85093-9_6

Cited by 35 publications

(31 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…These patterns have various applications as described in [5]. A new application of these patterns to the design of key predistribution scheme for wireless sensor networks was described lately in [13]. In this application the shape S might be a Lee sphere, an hexagon, or a circle, and sometimes another regular polygon.…”

Section: Bounds On Synchronization Patternsmentioning

confidence: 99%

Sequence Folding, Lattice Tiling, and Multidimensional Coding

Etzion

2011

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

Folding a sequence S into a multidimensional box is a well-known method which is used as a multidimensional coding technique. The operation of folding is generalized in a way that the sequence S can be folded into various shapes and not just a box. The new definition of folding is based on a lattice tiling for the given shape S and a direction in the Ddimensional integer grid. Necessary and sufficient conditions that a lattice tiling for S combined with a direction define a folding of a sequence into S are derived. The immediate and most impressive application is some new lower bounds on the number of dots in two-dimensional synchronization patterns. This can be also generalized for multidimensional synchronization patterns. The technique and its application for two-dimensional synchronization patterns, raise some interesting problems in discrete geometry. We will also discuss these problems. It is also shown how folding can be used to construct multidimensional error-correcting codes. Finally, by using the new definition of folding, multidimensional pseudorandom arrays with various shapes are generated.

show abstract

Section: Bounds On Synchronization Patternsmentioning

confidence: 99%

Sequence Folding, Lattice Tiling, and Multidimensional Coding

Etzion

2011

IEEE Trans. Inform. Theory

Self Cite

View full text Add to dashboard Cite

show abstract

“…They also proposed a class of key predistribution scheme based on orthogonal array [15]. Blackburn et al [16] proposed Costas arrays and distinct difference configuration. Product construction was used by [17].…”

Section: Introductionmentioning

confidence: 99%

A new key predistribution scheme for general and grid-group deployment of wireless sensor networks

Bag

Roy

2013

J Wireless Com Network

View full text Add to dashboard Cite

Key predistribution for wireless sensor networks has been a challenging field of research because stringent resource constraints make the key predistribution schemes difficult to implement. Despite this, key predistribution scheme is regarded as the best option for key management in wireless sensor networks. Here, the authors have proposed a new key predistribution scheme. This scheme exhibits better performance than existing schemes of its kind. Moreover, our scheme ensures constant time of key establishment between two nodes. We provide some bounds on the resiliency of this scheme. Next, we use this new key predistribution scheme in a grid-group deployment of sensor nodes. The entire deployment zone is broken into square regions. The sensor nodes falling within a single square region can communicate directly. Sensor nodes belonging to different square regions can communicate by means of special nodes deployed in each of the square region. We measure the resiliency in terms of fraction of links disconnected as well as fraction of nodes and regions disconnected. We show that our key predistribution scheme when applied to grid-group deployment performs better than standard models in existence.

show abstract

“…In Sect. 4 we outline a basic model for a KPS and discuss fundamental schemes. In the remaining sections we look at different applications of designs to key predistribution.…”

Section: Introductionmentioning

confidence: 99%

On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks

Martin

2009

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

The constraints of lightweight distributed computing environments such as wireless sensor networks lend themselves to the use of symmetric cryptography to provide security services. The lack of central infrastructure after deployment of such networks requires the necessary symmetric keys to be predistributed to participating nodes. The rich mathematical structure of combinatorial designs has resulted in the proposal of several key predistribution schemes for wireless sensor networks based on designs. We review and examine the appropriateness of combinatorial designs as a tool for building key predistribution schemes suitable for such environments.

show abstract

Efficient Key Predistribution for Grid-Based Wireless Sensor Networks

Cited by 35 publications

References 32 publications

Sequence Folding, Lattice Tiling, and Multidimensional Coding

Sequence Folding, Lattice Tiling, and Multidimensional Coding

A new key predistribution scheme for general and grid-group deployment of wireless sensor networks

On the Applicability of Combinatorial Designs to Key Predistribution for Wireless Sensor Networks

Contact Info

Product

Resources

About