Connectivity in Secure Wireless Sensor Networks under Transmission Constraints

Abstract

In wireless sensor networks (WSNs), the Eschenauer-Gligor (EG) key pre-distribution scheme is a widely recognized way to secure communications. Although connectivity properties of secure WSNs with the EG scheme have been extensively investigated, few results address physical transmission constraints. These constraints reflect real-world implementations of WSNs in which two sensors have to be within a certain distance from each other to communicate. In this paper, we present zero-one laws for connectivity in WSNs employing the EG scheme under transmission constraints. These laws help specify the critical transmission ranges for connectivity. Our analytical findings are confirmed via numerical experiments. In addition to secure WSNs, our theoretical results are also applied to frequency hopping in wireless networks.

Full version of a paper published in Annual Allerton Conference on Communication, Control, and Computing (Allerton) 2014

References in corpus (7)

• Performance of the Eschenauer-Gligor key distribution scheme under an ON/OFF channel
• Connectivity in Secure Wireless Sensor Networks under Transmission Constraints
• On the strengths of connectivity and robustness in general random intersection graphs
• On Topological Properties of Wireless Sensor Networks under the q-Composite Key Predistribution Scheme with On/Off Channels
• On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs
• The phase transition in inhomogeneous random intersection graphs
• (k,m)-connectivity in Mobile Clustered Wireless Networks

Cited by in corpus (17)

• k-Connectivity in Random Key Graphs with Unreliable Links
• 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
• Zero-one laws for connectivity in inhomogeneous random key graphs
• On the strengths of connectivity and robustness in general random intersection graphs
• On $k$-connectivity and minimum vertex degree in random $s$-intersection graphs
• Probabilistic key predistribution in mobile networks resilient to node-capture attacks
• Random intersection graphs and their applications in security, wireless communication, and social networks
• Analyzing connectivity of heterogeneous secure sensor networks
• Designing Securely and Reliably Connected Wireless Sensor Networks
• Exact Analysis of k-Connectivity in Secure Sensor Networks with Unreliable Links
• Hyperbolicity, degeneracy, and expansion of random intersection graphs
• Minimum node degree in inhomogeneous random key graphs with unreliable links
• On connectivity in a general random intersection graph
• Secure Connectivity of Wireless Sensor Networks Under Key Predistribution with on/off Channels
• Secure Communication in Dynamic Wireless Ad hoc Networks