Zero–One Laws for Connectivity in Random Key Graphs

The random key graph is a random graph naturally associated with the random key predistribution scheme introduced by Eschenauer and Gligor in the context of wireless sensor networks (WSNs). For this class of random graphs, we establish a new version of a conjectured zero-one law for graph connectivity as the number of nodes becomes unboundedly large. The results reported here complement and strengthen recent work on this conjecture by Blackburn and Gerke. In particular, the results are given under conditions which are more realistic for applications to WSNs.

[1]  Armand M. Makowski,et al.  Connectivity results for random key graphs , 2009, 2009 IEEE International Symposium on Information Theory.

[2]  James Allen Fill,et al.  Random intersection graphs when m= w (n): an equivalence theorem relating the evolution of the G ( n, m, p ) and G ( n,P /italic>) models , 2000 .

[3]  E. Chong,et al.  Wiley‐Interscience Series in Discrete Mathematics and Optimization , 2011 .

[4]  Armand M. Makowski,et al.  On the random graph induced by a random key predistribution scheme under full visibility , 2008, 2008 IEEE International Symposium on Information Theory.

[5]  A. Cayley.  A theorem on trees , 2009 .

[6]  O. Yagan,et al.  On the existence of triangles in random key graphs , 2009, 2009 47th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Stefanie Gerke,et al.  Connectivity of the uniform random intersection graph , 2008, Discret. Math..

[8]  Armand M. Makowski,et al.  On the random graph induced by a randomized predistribution scheme under full visibility (Extended version) , 2008 .

[9]  L. Mancini,et al.  How to Design Connected Sensor Networks that Are Provably Secure , 2006 .

[10]  Katarzyna Rybarczyk,et al.  Diameter, connectivity, and phase transition of the uniform random intersection graph , 2011, Discret. Math..

[11]  Edward R. Scheinerman,et al.  On Random Intersection Graphs: The Subgraph Problem , 1999, Combinatorics, Probability and Computing.

[12]  Roberto Di Pietro,et al.  Redoubtable Sensor Networks , 2008, TSEC.

[13]  Armand M. Makowski,et al.  A zero-one law for the existence of triangles in random key graphs , 2011 .

[14]  G. E. Martin.  Counting: The Art of Enumerative Combinatorics , 2001 .

[15]  B. Bollobás.  The evolution of random graphs , 1984 .

[16]  James Allen Fill,et al.  Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models , 2000, Random Struct. Algorithms.

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

[18]  J. Spencer.  Nine lectures on random graphs , 1993 .

[19]  Vijaya Ramachandran,et al.  The diameter of sparse random graphs , 2007, Random Struct. Algorithms.

[20]  P. Erdos,et al.  On the evolution of random graphs , 1984 .

[21]  Peter Marbach.  A lower-bound on the number of rankings required in recommender systems using collaborativ filtering , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

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

[23]  Sun,et al.  Review of Key Management Mechanisms in Wireless Sensor Networks , 2006 .

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

[25]  Mukesh Singhal,et al.  Security in wireless sensor networks , 2008, Wirel. Commun. Mob. Comput..

[26]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[27]  W. T. Gowers,et al.  RANDOM GRAPHS (Wiley Interscience Series in Discrete Mathematics and Optimization) , 2001 .

[28]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[29]  Armand M. Makowski,et al.  Connectivity in random graphs induced by a key predistribution scheme - small key pools , 2010, 2010 44th Annual Conference on Information Sciences and Systems (CISS).

[30]  Moez Draief,et al.  Epidemics and Rumours in Complex Networks , 2010 .

[31]  Erhard Godehardt,et al.  Two Models of Random Intersection Graphs for Classification , 2003 .

[32]  Osman Yagan.  Random graph modeling of key distribution schemes in wireless sensor networks , 2011 .

[33]  Yong Wang,et al.  A survey of security issues in wireless sensor networks , 2006, IEEE Communications Surveys & Tutorials.

[34]  Erhard Godehardt,et al.  Random Intersection Graphs and Classification , 2006, GfKl.