Topological Properties of Secure Wireless Sensor Networks Under the $q$ -Composite Key Predistribution Scheme With Unreliable Links

Security is an important issue in wireless sensor networks (WSNs), which are often deployed in hostile environments. The <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>-composite key predistribution scheme has been recognized as a suitable approach to secure WSNs. Although the <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>-composite scheme has received much attention in the literature, there is still a lack of rigorous analysis for secure WSNs operating under the <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>-composite scheme in consideration of the unreliability of links. One main difficulty lies in analyzing the network topology, whose links are not independent. Wireless links can be unreliable in practice due to the presence of physical barriers between sensors or because of harsh environmental conditions severely impairing communications. In this paper, we resolve the difficult challenge and investigate topological properties related to node degree in WSNs operating under the <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math></inline-formula>-composite scheme with unreliable communication links modeled as independent ON/OFF channels. Specifically, we derive the asymptotically exact probability for the property of minimum degree being at least <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>, present the asymptotic probability distribution for the minimum degree, and demonstrate that the number of nodes with a fixed degree is in distribution asymptotically equivalent to a Poisson random variable. We further use the theoretical results to provide useful design guidelines for secure WSNs. Experimental results also confirm the validity of our analytical findings.

[1]  Shreyas Sundaram,et al.  Robustness and Algebraic Connectivity of Random Interdependent Networks , 2015, ArXiv.

[2]  Andrei Z. Broder,et al.  Workshop on Algorithms and Models for the Web Graph , 2007, WAW.

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

[4]  Jyoti Pandey,et al.  Distribution of k -connectivity in the secure wireless sensor network , 2014, International Conference on Recent Advances and Innovations in Engineering (ICRAIE-2014).

[5]  Jun Zhao.  Designing secure networks with q-composite key predistribution under different link constraints , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

[6]  Jun Zhao,et al.  Parameter control in predistribution schemes of cryptographic keys , 2015, 2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[7]  Maurizio Rebaudengo,et al.  A Key Distribution Scheme for Mobile Wireless Sensor Networks: $q$ - $s$ -Composite , 2017, IEEE Transactions on Information Forensics and Security.

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

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

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

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

[12]  Sotiris E. Nikoletseas,et al.  On Some Combinatorial Properties of Random Intersection Graphs , 2015, Algorithms, Probability, Networks, and Games.

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

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

[15]  Jun Zhao,et al.  On Resilience and Connectivity of Secure Wireless Sensor Networks Under Node Capture Attacks , 2017, IEEE Transactions on Information Forensics and Security.

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

[17]  Jiming Chen,et al.  Cyber Security for Industrial Control Systems : From the Viewpoint of Close-Loop , 2016 .

[18]  Mindaugas Bloznelis,et al.  Degree and clustering coefficient in sparse random intersection graphs , 2013, 1303.3388.

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

[20]  Pil Joong Lee,et al.  Exact Formulae for Resilience in Random Key Predistribution Schemes , 2012, IEEE Transactions on Wireless Communications.

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

[22]  Jun Zhao,et al.  On k-Connectivity and Minimum Vertex Degree in Random s-Intersection Graphs , 2015, ANALCO.

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

[24]  Jun Zhao,et al.  Topology Control in Secure Wireless Sensors Networks , 2016 .

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

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

[27]  Hideaki Ishii,et al.  Consensus of second-order multi-agent systems in the presence of locally bounded faults , 2015, Syst. Control. Lett..

[28]  A. Dasgupta.  Asymptotic Theory of Statistics and Probability , 2008 .

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

[30]  Jun Zhao,et al.  Threshold functions in random s-intersection graphs , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

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

[32]  Jun Zhao.  Modeling interest-based social networks: Superimposing Erdős-Rényi graphs over random intersection graphs , 2017, 2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).

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

[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]  P. Erd Os,et al.  On the strength of connectedness of random graphs , 1961 .

[36]  Jie Ding,et al.  Key Pre-Distributions From Graph-Based Block Designs , 2016, IEEE Sensors Journal.

[37]  Jun Zhao.  On the resilience to node capture attacks of secure wireless sensor networks , 2015, 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton).