Exact Analysis of k-Connectivity in Secure Sensor Networks with Unreliable Links
Abstract
The Eschenauer--Gligor (EG) random key predistribution scheme has been widely recognized as a typical approach to secure communications in wireless sensor networks (WSNs). However, there is a lack of precise probability analysis on the reliable connectivity of WSNs under the EG scheme. To address this, we rigorously derive the asymptotically exact probability of -connectivity in WSNs employing the EG scheme with unreliable links represented by independent on/off channels, where -connectivity ensures that the network remains connected despite the failure of any sensors or links. Our analytical results are confirmed via numerical experiments, and they provide precise guidelines for the design of secure WSNs that exhibit a desired level of reliability against node and link failures.
Keywords
Cite
@article{arxiv.1409.6022,
title = {Exact Analysis of k-Connectivity in Secure Sensor Networks with Unreliable Links},
author = {Jun Zhao and Osman Yağan and Virgil Gligor},
journal= {arXiv preprint arXiv:1409.6022},
year = {2015}
}