Location of Repository

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

Topics:
ems

Publisher: IEEE

Year: 2010

OAI identifier:
oai:eprints.bbk.ac.uk.oai2:2907

Provided by:
Birkbeck Institutional Research Online

Downloaded from
http://eprints.bbk.ac.uk/2907/1/2907.pdf

- (2004). A complete annotated bibliography of work related to Sidon sequences”,
- (2002). A key-management scheme for distributed sensor networks”,
- (2007). A survey of key management schemes in wireless sensor networks”,
- (2008). An Application-Oriented Framework for Wireless Sensor Network Key Establishment”,
- (1995). Bh sequences”,
- (1984). Constructions and properties of Costas arrays”,
- (2008). Efﬁ-cient key predistribution for grid-based wireless sensor networks,”
- (2008). Efficient key predistribution for grid-based wireless sensor networks,”
- (2005). Establishing pairwise keys in distributed sensor networks”,
- (2006). Expander graph based key distribution mechanisms in wireless sensor networks”,
- (2008). Institut f¨ ur Chemie und Dynamik der Geosph¨ are (ICG), Forschungszentrum J¨ ulich: SoilNet – a Zigbee based soil moisture sensor network. http://www.fz-juelich.de/icg/icg-4/index.php?index=739,
- (2008). Institut fu¨r Chemie und Dynamik der Geospha¨re (ICG), Forschungszentrum Ju¨lich: SoilNet – a Zigbee based soil moisture sensor network. http://www.fz-juelich.de/icg/icg-4/index.php?index=739,
- (2007). Integrated smart sensing systems.
- (2005). J.Katz and A.Khalili “A pairwise key pre-distribution scheme for wireless sensor networks”,
- (2005). Key Distribution Mechanisms for Wireless Sensor Networks: a Survey”, Rensselaer Polytechnic Institute
- (1972). om, “On B2 sequences of vectors”,
- (1972). On B2 sequences of vectors”,
- (2008). On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs”,
- (1937). On the difference between consecutive primes”,
- (2003). Random key predistirbution schemes for sensor networks”
- (1966). Sequences, Volume I,
- (1993). Solving a linear equation in a set of integers”,
- (1993). Sphere Packings, Lattices, and Groups,
- (2004). The design space of wireless sensor networks.
- Theorems in the additive theory of numbers”,
- (2008). Twodimensional patterns with distinct differences: Constructions, bounds and maximal anticodes,” preprint,
- (2008). Wireless sensor network deployment for water use efﬁciency in irrigation.

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.