Topological properties of secure wireless sensor networks under the q-composite key predistribution scheme with unreliable links

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 topological properties related to node degree in WSNs operating under the q-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 k, 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.

IEEE/ACM Transactions on Networking. arXiv admin note: text overlap with arXiv:1408.5082

References in corpus (4)

• Degree and clustering coefficient in 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
• On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs

Cited by in corpus (7)

• Topological properties of secure wireless sensor networks under the q-composite key predistribution scheme with unreliable links
• Probabilistic key predistribution in mobile networks resilient to node-capture attacks
• On secure communication in sensor networks under q-composite key predistribution with unreliable links
• Analyzing resilience of interest-based social networks against node and link failures
• KPsec: Secure End-to-End Communications for Multi-Hop Wireless Networks
• Secure Connectivity of Wireless Sensor Networks Under Key Predistribution with on/off Channels
• How UAVs' Highly Dynamic 3D Movement Improves Network Security?