$k$ -Connectivity in Random Key Graphs With Unreliable Links

Random key graphs form a class of random intersection graphs that are naturally induced by the random key predistribution scheme of Eschenauer and Gligor for securing wireless sensor network (WSN) communications. Random key graphs have received much attention recently, owing in part to their wide applicability in various domains, including recommender systems, social networks, secure sensor networks, clustering and classification analysis, and cryptanalysis to name a few. In this paper, we study connectivity properties of random key graphs in the presence of unreliable links. Unreliability of graph links is captured by independent Bernoulli random variables, rendering them to be on or off independently from each other. The resulting model is an intersection of a random key graph and an Erdos-Renyi graph, and is expected to be useful in capturing various real-world networks; e.g., with secure WSN applications in mind, link unreliability can be attributed to harsh environmental conditions severely impairing transmissions. We present conditions on how to scale this model's parameters so that: 1) the minimum node degree in the graph is at least k and 2) the graph is k-connected, both with high probability as the number of nodes becomes large. The results are given in the form of zero-one laws with critical thresholds identified and shown to coincide for both graph properties. These findings improve the previous results by Rybarczyk on k-connectivity of random key graphs (with reliable links), as well as the zero-one laws by Yagan on one-connectivity of random key graphs with unreliable links.

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

[2]  P. Erdos,et al.  On the strength of connectedness of a random graph , 1964 .

[3]  Virgil D. Gligor,et al.  On the strengths of connectivity and robustness in general random intersection graphs , 2014, 53rd IEEE Conference on Decision and Control.

[4]  Béla Bollobás,et al.  Random Graphs , 1985 .

[5]  Virgil D. Gligor,et al.  Exact analysis of k-connectivity in secure sensor networks with unreliable links , 2015, 2015 13th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

[6]  Deborah Estrin,et al.  Highly-resilient, energy-efficient multipath routing in wireless sensor networks , 2001, MOCO.

[7]  Mihir Bellare,et al.  OCB: a block-cipher mode of operation for efficient authenticated encryption , 2001, CCS '01.

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

[9]  Mindaugas Bloznelis,et al.  Component evolution in a secure wireless sensor network , 2009, Networks.

[10]  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).

[11]  Mindaugas Bloznelis,et al.  Perfect matchings in random intersection graphs , 2013 .

[12]  Mathew D. Penrose,et al.  Random Geometric Graphs , 2003 .

[13]  Katarzyna Rybarczyk,et al.  Sharp threshold functions for the random intersection graph via coupling method , 2009, 0910.0749.

[14]  Armand M. Makowski,et al.  Random Key Graphs Can They be Small Worlds? , 2009, 2009 First International Conference on Networks & Communications.

[15]  Valentas Kurauskas,et al.  Assortativity and clustering of sparse random intersection graphs , 2012, 1209.4675.

[16]  Armand M. Makowski,et al.  Zero–One Laws for Connectivity in Random Key Graphs , 2009, IEEE Transactions on Information Theory.

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

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

[19]  Virgil D. Gligor,et al.  Random intersection graphs and their applications in security, wireless communication, and social networks , 2015, ArXiv.

[20]  Virgil D. Gligor,et al.  Fast Encryption and Authentication: XCBC Encryption and XECB Authentication Modes , 2001, FSE.

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

[22]  Charanjit S. Jutla,et al.  Encryption Modes with Almost Free Message Integrity , 2001, Journal of Cryptology.

[23]  Katarzyna Rybarczyk,et al.  Sharp Threshold Functions for Random Intersection Graphs via a Coupling Method , 2011, Electron. J. Comb..

[24]  Mathew D. Penrose,et al.  On k-connectivity for a geometric random graph , 1999, Random Struct. Algorithms.

[25]  Virgil D. Gligor,et al.  k-Connectivity in Secure Wireless Sensor Networks with Physical Link Constraints - The On/Off Channel Model , 2012, ArXiv.

[26]  Osman Yagan.  Performance of the Eschenauer–Gligor Key Distribution Scheme Under an ON/OFF Channel , 2012, IEEE Transactions on Information Theory.

[27]  D. Manjunath,et al.  On connectivity thresholds in superposition of random key graphs on random geometric graphs , 2013, 2013 IEEE International Symposium on Information Theory.

[28]  Charanjit S. Jutla.  Encryption Modes with Almost Free Message Integrity , 2001, EUROCRYPT.

[29]  Jun Zhao,et al.  Connectivity in secure wireless sensor networks under transmission constraints , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[30]  P. ERDbS.  ON THE STRENGTH OF CONNECTEDNESS OF A RANDOM GRAPH , 2001 .

[31]  Nicolas W. Hengartner,et al.  The phase transition in inhomogeneous random intersection graphs , 2013, ArXiv.

[32]  P. Erd Os,et al.  On the strength of connectedness of random graphs , 1961 .

[33]  Yilun Shang,et al.  On the Isolated Vertices and Connectivity in Random Intersection Graphs , 2011 .

[34]  Virgil D. Gligor,et al.  Secure k-connectivity in wireless sensor networks under an on/off channel model , 2013, 2013 IEEE International Symposium on Information Theory.

[35]  Xiang-Yang Li,et al.  Fault tolerant deployment and topology control in wireless networks , 2003, MobiHoc '03.

[36]  Adrian Perrig,et al.  Brief Encounters with a Random Key Graph , 2009, Security Protocols Workshop.

[37]  Paul G. Spirakis,et al.  On the independence number and Hamiltonicity of uniform random intersection graphs , 2011, Theor. Comput. Sci..

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

[39]  F. Ball,et al.  Epidemics on random intersection graphs , 2010, 1011.4242.

[40]  Douglas R. Stinson,et al.  On the complexity of the herding attack and some related attacks on hash functions , 2012, Des. Codes Cryptogr..

[41]  Paul G. Spirakis,et al.  Sharp thresholds for Hamiltonicity in random intersection graphs , 2010, Theor. Comput. Sci..

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

[43]  Krzysztof Krzywdzinski,et al.  Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols , 2011, MFCS.

[44]  Blair D. Sullivan,et al.  Hyperbolicity, degeneracy, and expansion of random intersection graphs , 2014, WAW.

[45]  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.

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