Exact analysis of k-connectivity in secure sensor networks with unreliable links

The Eschenauer-Gligor (EG) random key predistri-bution scheme has been widely recognized as a typical approach to secure communications in wireless sensor networks (WSNs). However, there is a lack of precise probability analysis on the reliable connectivity of WSNs under the EG scheme. To address this, we rigorously derive the asymptotically exact probability of k-connectivity in WSNs employing the EG scheme with unreliable links represented by independent on/off channels, where k-connectivity ensures that the network remains connected despite the failure of any (k-1) sensors or links. Our analytical results are confirmed via numerical experiments, and they provide precise guidelines for the design of secure WSNs that exhibit a desired level of reliability against node and link failures.

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

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

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

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

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

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

[7]  M. Penrose.  CONNECTIVITY OF SOFT RANDOM GEOMETRIC GRAPHS , 2013, 1311.3897.

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

[9]  Virgil D. Gligor,et al.  On secure and reliable communications in wireless sensor networks: Towards k-connectivity under a random pairwise key predistribution scheme , 2014, 2014 IEEE International Symposium on Information Theory.

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

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

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

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

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

[15]  Roberto Di Pietro,et al.  Connectivity properties of secure wireless sensor networks , 2004, SASN '04.

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

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

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

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

[20]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

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

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

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

[24]  Pieter Bastiaan Ober.  Asymptotic Theory of Statistics and Probability , 2011 .

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

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

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

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

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

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

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

[32]  Peng-Jun Wan,et al.  Asymptotic Distribution of The Number of Isolated Nodes in Wireless Ad Hoc Networks with Unreliable Nodes and Links , 2006, GLOBECOM.

[33]  J. Scott Provan,et al.  The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected , 1983, SIAM J. Comput..

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

[35]  Virgil D. Gligor,et al.  On topological properties of wireless sensor networks under the q-composite key predistribution scheme with on/off channels , 2014, 2014 IEEE International Symposium on Information Theory.

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

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