Article thumbnail
Location of Repository

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

By S.R. Blackburn, T. Etzion, K.M. Martin and Maura B. Paterson


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
DOI identifier: 10.1109/TIT.2010.2050794
OAI identifier:

Suggested articles


  1. (2004). A complete annotated bibliography of work related to Sidon sequences”,
  2. (2002). A key-management scheme for distributed sensor networks”, doi
  3. (2007). A survey of key management schemes in wireless sensor networks”, doi
  4. (2008). An Application-Oriented Framework for Wireless Sensor Network Key Establishment”, doi
  5. (1995). Bh sequences”, doi
  6. (1984). Constructions and properties of Costas arrays”, doi
  7. (2008). Effi-cient key predistribution for grid-based wireless sensor networks,” doi
  8. (2008). Efficient key predistribution for grid-based wireless sensor networks,” doi
  9. (2005). Establishing pairwise keys in distributed sensor networks”, doi
  10. (2006). Expander graph based key distribution mechanisms in wireless sensor networks”, doi
  11. (2008). Institut f¨ ur Chemie und Dynamik der Geosph¨ are (ICG), Forschungszentrum J¨ ulich: SoilNet – a Zigbee based soil moisture sensor network.,
  12. (2008). Institut fu¨r Chemie und Dynamik der Geospha¨re (ICG), Forschungszentrum Ju¨lich: SoilNet – a Zigbee based soil moisture sensor network.,
  13. (2007). Integrated smart sensing systems. doi
  14. (2005). J.Katz and A.Khalili “A pairwise key pre-distribution scheme for wireless sensor networks”, doi
  15. (2005). Key Distribution Mechanisms for Wireless Sensor Networks: a Survey”, Rensselaer Polytechnic Institute
  16. (1972). om, “On B2 sequences of vectors”,
  17. (1972). On B2 sequences of vectors”,
  18. (2008). On the construction of practical key predistribution schemes for distributed sensor networks using combinatorial designs”, doi
  19. (1937). On the difference between consecutive primes”, doi
  20. (2003). Random key predistirbution schemes for sensor networks” doi
  21. (1966). Sequences, Volume I, doi
  22. (1993). Solving a linear equation in a set of integers”,
  23. (1993). Sphere Packings, Lattices, and Groups, doi
  24. (2004). The design space of wireless sensor networks. doi
  25. Theorems in the additive theory of numbers”, doi
  26. (2008). Twodimensional patterns with distinct differences: Constructions, bounds and maximal anticodes,” preprint, doi
  27. (2008). Wireless sensor network deployment for water use efficiency in irrigation. doi

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