Performance of the Eschenauer-Gligor key distribution scheme under an ON/OFF channel
arXiv:1112.3415 · doi:10.1109/TIT.2012.2189353
Abstract
We investigate the secure connectivity of wireless sensor networks under the random key distribution scheme of Eschenauer and Gligor. Unlike recent work which was carried out under the assumption of full visibility, here we assume a (simplified) communication model where unreliable wireless links are represented as on/off channels. We present conditions on how to scale the model parameters so that the network i) has no secure node which is isolated and ii) is securely connected, both with high probability when the number of sensor nodes becomes large. The results are given in the form of full zero-one laws, and constitute the first complete analysis of the EG scheme under non-full visibility. Through simulations these zero-one laws are shown to be valid also under a more realistic communication model, i.e., the disk model. The relations to the Gupta and Kumar's conjecture on the connectivity of geometric random graphs with randomly deleted edges are also discussed.
Submitted to IEEE Transactions on Information Theory in November, 2011
Cited by in corpus (13)
- Connectivity of soft random geometric graphs
- k-Connectivity in Random Key Graphs with Unreliable Links
- 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 Connectivity and Robustness in Random Intersection Graphs
- Towards -connectivity of the random graph induced by a pairwise key predistribution scheme with unreliable links
- On Topological Properties of Wireless Sensor Networks under the q-Composite Key Predistribution Scheme with On/Off Channels
- Optimal Radius for Connectivity in Duty-Cycled Wireless Sensor Networks
- 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
- Secure Connectivity of Wireless Sensor Networks Under Key Predistribution with on/off Channels