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.
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.
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.
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.
The Rise and Fall and Rise of Combinatorial Key Predistribution
  • K. Martin
  • Mathematics, Computer Science
    Selected Areas in Cryptography
  • 2010
TLDR
It is explained why the problem of how most effectively to predistribute keys is back "in fashion" after a period of limited attention by the research community, and the appropriateness of combinatorial techniques for key distribution is considered.
Problems on Two-Dimensional Synchronization Patterns
TLDR
This work describes several solution techniques and presents some open problems in two-dimensional synchronization patterns, a sequence of dots in which the out-of-phase autocorrelation function takes the values zero or one.
Sidon sequences and doubly periodic two-dimensional synchronization patterns
  • T. Etzion
  • Mathematics, Computer Science
    2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
TLDR
This paper presents sufficient conditions that a two-dimensional synchronization pattern can be transformed into a Sidon sequence and presents a new construction for Sidon sequences over an alphabet of size q(q − 1), where q is a power of a prime.
The Research of the Information Security Group
TLDR
Royal Holloway, University of London (RHUL) is an academic centre of excellence in cyber security, one of eight such centres in the UK recognized by GCHQ and one of the largest academic information security groups in the world.
...
...

References

SHOWING 1-10 OF 60 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.
Constructions and properties of Costas arrays
A Costas array is an n × n array of dots and blanks with exactly one dot in each row and column, and with distinct vector differences between all pairs of dots. As a frequency-hop pattern for radar
Key distribution mechanisms for wireless sensor networks : a survey
TLDR
This work evaluates deterministic, probabilistic and hybrid type of key pre-distribution and dynamic key generation algorithms for distributing pair-wise, group-wise and network-wise keys in distributed and hierarchical wireless sensor networks.
The design space of wireless sensor networks
TLDR
This article discusses the consequences of this fact with regard to the design space of wireless sensor networks by considering its various dimensions and justifies the view by demonstrating that specific existing applications occupy different points in thedesign space.
...
...