Secure Connectivity of Wireless Sensor Networks Under Key Predistribution with on/off Channels

Abstract

Security is an important issue in wireless sensor networks (WSNs), which are often deployed in hostile environments. The q-composite key predistribution scheme has been recognized as a suitable approach to secure WSNs. Although the q-composite scheme has received much attention in the literature, there is still a lack of rigorous analysis for secure WSNs operating under the q-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 k-connectivity in secure WSNs operating under the q-composite scheme with unreliable communication links modeled as independent on/off channels, where k-connectivity ensures connectivity despite the failure of any (k - 1) sensors or links, and connectivity means that any two sensors can find a path in between for secure communication. Specifically, we derive the asymptotically exact probability and a zero-one law for k-connectivity. We further use the theoretical results to provide design guidelines for secure WSNs. Experimental results also confirm the validity of our analytical findings.

arXiv commentpublished in International Conference on Distributed Computing Systems (ICDCS) 2017

References in corpus (14)

• Zero-one laws for connectivity in random key graphs
• Key Generation in Wireless Sensor Networks Based on Frequency-selective Channels - Design, Implementation, and Analysis
• Degree and clustering coefficient in sparse random intersection graphs
• Performance of the Eschenauer-Gligor key distribution scheme under an ON/OFF channel
• k-Connectivity in Random Key Graphs with Unreliable Links
• Assortativity and clustering of sparse random intersection graphs
• On resilience and connectivity of secure wireless sensor networks under node capture attacks
• Topological properties of secure wireless sensor networks under the q-composite key predistribution scheme with unreliable links
• Connectivity in Secure Wireless Sensor Networks under Transmission Constraints
• On Connectivity and Robustness in Random Intersection Graphs
• Sharp threshold functions for the random intersection graph via coupling method?
• On Topological Properties of Wireless Sensor Networks under the q-Composite Key Predistribution Scheme with On/Off Channels
• The coupling method for inhomogeneous random intersection graphs
• On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs