Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks

@article{Blackburn2010DistinctDC,
  title={Distinct Difference Configurations: Multihop Paths and Key Predistribution in Sensor Networks},
  author={Simon R. Blackburn and Tuvi Etzion and Keith M. Martin and Maura B. Paterson},
  journal={IEEE Transactions on Information Theory},
  year={2010},
  volume={56},
  pages={3961-3972}
}
A distinct difference configuration is a set of points in Z2 with the property that the vectors (difference vectors) connecting any two of the points are all distinct. Many specific examples of these configurations have been previously studied: the class of distinct difference configurations includes both Costas arrays and sonar sequences, for example. Motivated by an application of these structures in key predistribution for wireless sensor networks, we define the k-hop coverage of a distinct… 

Figures and Tables from this paper

A unified approach to combinatorial key predistribution schemes for sensor networks

TLDR
This work defines a new, general class of designs, termed “partially balanced t-designs”, that is sufficiently general that it encompasses almost all of the designs that have been proposed for combinatorial key predistribution schemes.

Key Predistribution Techniques for Grid-Based Wireless Sensor Networks

TLDR
It is observed that the regular topology of a grid-based network enables an efficient trade-off between the connectivity, resilience and storage requirements of a KPS, and the balancing of these properties to suit application requirements is discussed.

Costas array based key pre-distribution scheme (CAKPS) for WSN and its performance analysis

TLDR
A Costas array based key pre-distribution scheme for location dependent as well as location independent wireless sensor networks is proposed and comparative performance analysis of the scheme is shown.

Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes

TLDR
Rather than restricting dots to lie in a square or rectangle, this work restricts the maximum distance between dots of the configuration; the motivation for this is a new application of such configurations to key distribution in wireless sensor networks.

Key predistribution schemes for distributed sensor networks via block designs

TLDR
This paper proposes a new construction method for key predistribution schemes based on combinations of duals of standard block designs which works for any intersection threshold and obtains explicit algebraic expressions for the metrics for local connectivity and resiliency.

Location Dependent Key Predistribution Scheme for Square Grid and Hexagonal Grid

TLDR
This paper proposes an algorithm using adjacency matrix of the network for square and hexagonal grid network to design a location aware key pre-distribution scheme for wireless sensor network deployed in square grid andhexagonal grid with minimum possible keys stored in each nodes.

Key Pre-Distributions From Graph-Based Block Designs

TLDR
This paper considers prior knowledge of network characteristics and application constraints in terms of communication needs between sensor nodes, and proposes methods to design key pre-distribution schemes, in order to provide better security and connectivity while requiring less resources.

Secure Protocols for Key Pre-distribution, Network Discovery, and Aggregation in Wireless Sensor Networks

TLDR
This thesis is concerned with security during all phases of a sensor network’s lifetime: pre-deployment, deployment, operation, and maintenance and presents a family of secure aggregation protocols that allow for data to be efficiently collected from the entire network at a much lower cost than collecting readings individually, even if an active adversary is present.

Efficient Implementation of Lightweight Key Predistribution Techniques for Grid-Based Wireless Sensor Networks

  • Computer Science
  • 2009
TLDR
The connectivity and resilience requirements of KPSs for grid-based wireless sensor networks are explored and explicit algorithms for efficiently constructing DDCs that lead to schemes with the desired properties for a large range of parameters are given.

Generalised key distribution patterns

TLDR
Methods from set theory and ideas from convex analysis are used in order to construct general structures and provide some mathematical insight into their behaviour and analyse these general structures by exploiting the proof techniques of other authors in new ways, tightening existing inequalities and generalising results from the literature.

References

SHOWING 1-10 OF 37 REFERENCES

On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs

TLDR
It is shown that the performance of a KPS can be improved by carefully choosing a certain class of set systems as “key ring spaces”, and two types of transversal designs are employed, which turn out to have significant efficiency in a shared-key discovery phase without degrading connectivity and resiliency.

Random key predistribution schemes for sensor networks

TLDR
The random-pairwise keys scheme is presented, which perfectly preserves the secrecy of the rest of the network when any node is captured, and also enables node-to-node authentication and quorum-based revocation.

Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes

TLDR
Rather than restricting dots to lie in a square or rectangle, this work restricts the maximum distance between dots of the configuration; the motivation for this is a new application of such configurations to key distribution in wireless sensor networks.

A pairwise key predistribution scheme for wireless sensor networks

TLDR
A new key predistribution scheme is proposed which substantially improves the resilience of the network compared to previous schemes, and an in-depth analysis of the scheme in terms of network resilience and associated overhead is given.

Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks

TLDR
This paper presents a deterministic key distribution scheme based on Expander Graphs and shows how to map the parameters (e.g., degree, expansion, and diameter) of a Ramanujan Expandergraph to the desired properties of a key distribution schemes for a physical network topology.

A pairwise key pre-distribution scheme for wireless sensor networks

TLDR
This paper proposes a new key pre-distribution scheme, which substantially improves the resilience of the network compared to the existing schemes, and exhibits a nice threshold property: when the number of compromised nodes is less than the threshold, the probability that any nodes other than these compromised nodes are affected is close to zero.

Efficient Key Predistribution for Grid-Based Wireless Sensor Networks

TLDR
This paper describes how Costas arrays can be used for key predistribution in wireless sensor networks, then defines distinct difference configurations, a more general structure that provides a flexible choice of parameters in such schemes.

Establishing pairwise keys in distributed sensor networks

TLDR
A general framework for establishing pairwise keys between sensor nodes using bivariate polynomials is developed and an optimization technique for polynomial evaluation is presented, which can be applied efficiently in resource-constrained sensor networks.

A survey of key management schemes in wireless sensor networks

A key-management scheme for distributed sensor networks

TLDR
A key-management scheme designed to satisfy both operational and security requirements of DSNs is presented, which relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes.