Distinct difference configurations: multihop paths and key predistribution in sensor networks

Authors:
Simon R. Blackburn;Tuvi Etzion;Keith M. Martin;Maura B. Paterson
Affiliations:
Department of Mathematics, Royal Holloway, University of London, Egham, Surrey, UK;Computer Science Department, Technion-Israel Institute of Technology, Haifa, Israel;Department of Mathematics, Royal Holloway, University of London, Egham, Surrey, UK;Department of Economics, Mathematics and Statistics at Birkbeck, University of London, London, UK
Venue:
IEEE Transactions on Information Theory
Year:
2010

Citing 11
Cited 2

Sphere-packings, lattices, and groups

Sphere-packings, lattices, and groups
A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Random Key Predistribution Schemes for Sensor Networks

SP '03 Proceedings of the 2003 IEEE Symposium on Security and Privacy
Establishing pairwise keys in distributed sensor networks

ACM Transactions on Information and System Security (TISSEC)
A pairwise key predistribution scheme for wireless sensor networks

ACM Transactions on Information and System Security (TISSEC)
A survey of key management schemes in wireless sensor networks

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

ACM Transactions on Information and System Security (TISSEC)
An Application-Oriented Framework for Wireless Sensor Network Key Establishment

Electronic Notes in Theoretical Computer Science (ENTCS)
Wireless sensor network deployment for water use efficiency in irrigation

Proceedings of the workshop on Real-world wireless sensor networks
Two-dimensional patterns with distinct differences: constructions, bounds, and maximal anticodes

IEEE Transactions on Information Theory
The design space of wireless sensor networks

IEEE Wireless Communications

The rise and fall and rise of combinatorial key predistribution

SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Key predistribution schemes for distributed sensor networks via block designs

Designs, Codes and Cryptography

Quantified Score

Hi-index	754.84

Visualization

Abstract

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 difference configuration to be the number of distinct vectors that can be expressed as the sum of k or fewer difference vectors. This is an important parameter when distinct difference configurations are used in the wireless sensor application, as this parameter describes the density of nodes that can be reached by a short secure path in the network. We provide upper and lower bounds for the k-hop coverage of a distinct difference configuration with m points, and exploit a connection with Bh sequences to construct configurations with maximal k-hop coverage. We also construct distinct difference configurations that enable all small vectors to be expressed as the sum of two of the difference vectors of the configuration, an important task for local secure connectivity in the application.