Absence of isolated nodes in inhomogeneous random key graphs

We introduce a new random key predistribution scheme for securing heterogeneous wireless sensor networks. Each of the n sensors in the network is classified into r classes according to some probability distribution μ = {μ1, ..., μr}. Before deployment, a class i sensor is assigned Ki cryptographic keys that are selected uniformly at random from a common pool of P keys, for each i = 1, ..., r. Once deployed, a pair of sensors can establish a secure communication channel if and only if they have a key in common. We model the topology of this network by an inhomogeneous random key graph. We establish scaling conditions on the parameters P and {K1, ..., Kr} so that the this graph has no isolated nodes with high probability. The result is given in the form of a zero-one law with the number of sensors n growing unboundedly large. An analogous result is also conjectured for the property of graph connectivity.

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

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

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

[4]  Svante Janson,et al.  Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.

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

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

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

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

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

[10]  Yeh-Ching Chung,et al.  Heterogeneous Wireless Sensor Network Deployment and Topology Control Based on Irregular Sensor Model , 2007, GPC.

[11]  Suresh Singh,et al.  Exploiting heterogeneity in sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

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

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

[15]  B. Bollobás,et al.  The phase transition in inhomogeneous random graphs , 2007 .

[16]  Yunghsiang Sam Han,et al.  A key management scheme for wireless sensor networks using deployment knowledge , 2004, IEEE INFOCOM 2004.

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

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

[19]  Osman Yagan.  Zero-One Laws for Connectivity in Inhomogeneous Random Key Graphs , 2016, IEEE Transactions on Information Theory.

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

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

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

[23]  Luc Devroye,et al.  Connectivity of inhomogeneous random graphs , 2012, Random Struct. Algorithms.

[24]  Jun Zhao,et al.  $k$ -Connectivity in Random Key Graphs With Unreliable Links , 2015, IEEE Transactions on Information Theory.

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