On the network reliability problem of the heterogeneous key predistribution scheme
Rashad Eletreby, Osman Yağan · 2016
We consider the network reliability problem in wireless sensor networks secured by the heterogeneous random key predistribution scheme. This scheme generalizes Eschenauer-Gligor scheme by considering the cases when the network comprises sensor nodes with varying level of resources; e.g., regular nodes vs. cluster heads. The scheme induces the inhomogeneous random key graph, denoted G(n; μ, K, P). We analyze the reliability of G(n; μ, K, P) against random link failures. Namely, we consider G(n; μ, K, P, α) formed by deleting each edge of G(n; μ, K, P) independently with probability 1-α, and study the probability that the resulting graph i) has no isolated node; and ii) is connected. We present scaling conditions onK, P, and α such that both events take place with probability zero or one, respectively, as the number of nodes gets large. We present numerical results to support these in the finite-node regime.