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

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.

[1]  J. Maynard.  On the difference between consecutive primes , 2012, 1201.1787.

[2]  E. Haacke.  Sequences , 2005 .

[3]  P ? ? ? ? ? ? ? % ? ? ? ? , 1991 .

[4]  Keith M. Martin,et al.  An Application-Oriented Framework for Wireless Sensor Network Key Establishment , 2008, Electron. Notes Theor. Comput. Sci..

[5]  Tuvi Etzion,et al.  Two-Dimensional Patterns With Distinct Differences—Constructions, Bounds, and Maximal Anticodes , 2010, IEEE Transactions on Information Theory.

[6]  W. Fischer,et al.  Sphere Packings, Lattices and Groups , 1990 .

[7]  Thomas C. Hales.  Sphere packings, I , 1997, Discret. Comput. Geom..

[8]  Moti Yung,et al.  Expander Graph based Key Distribution Mechanisms in Wireless Sensor Networks , 2006, 2006 IEEE International Conference on Communications.

[9]  Dawn Xiaodong Song,et al.  Random key predistribution schemes for sensor networks , 2003, 2003 Symposium on Security and Privacy, 2003..

[10]  Harry Vereecken,et al.  SoilNet - A Zigbee based soil moisture sensor network , 2007 .

[11]  Yunghsiang Sam Han,et al.  A pairwise key pre-distribution scheme for wireless sensor networks , 2003, CCS '03.

[12]  Xiaojiang Du,et al.  A survey of key management schemes in wireless sensor networks , 2007, Comput. Commun..

[13]  Virgil D. Gligor,et al.  A key-management scheme for distributed sensor networks , 2002, CCS '02.

[14]  R. C. Bose,et al.  Theorems in the additive theory of numbers , 1962 .

[15]  S. Golomb,et al.  Constructions and properties of Costas arrays , 1984, Proceedings of the IEEE.

[16]  B. Lindström.  On B2-sequences of vectors , 1972 .

[17]  Tuvi Etzion,et al.  Efficient Key Predistribution for Grid-Based Wireless Sensor Networks , 2008, ICITS.

[18]  E. Wright,et al.  Theorems in the additive theory of numbers , 2022 .

[19]  N. F. Gjeddebæk.  On the difference between consecutive primes , 1966 .

[20]  S. W. Graham.  B h sequences , 1996 .

[21]  Bülent Yener,et al.  Key distribution mechanisms for wireless sensor networks : a survey , 2005 .

[22]  S. Guru,et al.  Wireless sensor network deployment for water use efficiency in irrigation , 2008, Real-World Wireless Sensor Networks.

[23]  Donggang Liu,et al.  Establishing pairwise keys in distributed sensor networks , 2005, TSEC.

[24]  Douglas R. Stinson,et al.  On the Construction of Practical Key Predistribution Schemes for Distributed Sensor Networks Using Combinatorial Designs , 2008, TSEC.

[25]  Kay Römer,et al.  The design space of wireless sensor networks , 2004, IEEE Wireless Communications.

[26]  K. O'Bryant.  A Complete Annotated Bibliography of Work Related to Sidon Sequences , 2004, math/0407117.

[27]  Imre Z. Ruzsa,et al.  Solving a linear equation in a set of integers I , 1993 .

[28]  Yunghsiang Sam Han,et al.  A pairwise key predistribution scheme for wireless sensor networks , 2005, TSEC.

[29]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.