On secure communication in sensor networks under q-composite key predistribution with unreliable links
arXiv:1911.00718 · doi:10.1109/TCOMM.2017.2778718
Abstract
Many applications of wireless sensor networks (WSNs) require deploying sensors in hostile environments, where an adversary may eavesdrop communications. To secure communications in WSNs, the q-composite key predistribution scheme has been proposed in the literature. In this paper, we investigate secure k-connectivity in WSNs operating under the q-composite scheme, in consideration of the unreliability of wireless links. Secure k-connectivity ensures that any two sensors can find a path in between for secure communication, even when k - 1 sensors fail. We present conditions on how to set the network parameters such that the network has secure k-connectivity asymptotically almost surely. The result is given in the form of a sharp zero-one law.
IEEE Transactions on Communications
References in corpus (6)
- 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 Topological Properties of Wireless Sensor Networks under the q-Composite Key Predistribution Scheme with On/Off Channels
- Probabilistic key predistribution in mobile networks resilient to node-capture attacks
- Analyzing resilience of interest-based social networks against node and link failures