Towards $k$-connectivity of the random graph induced by a pairwise key predistribution scheme with unreliable links.

We study the secure and reliable connectivity of wireless sensor networks. Security is assumed to be ensured by the random pairwise key predistribution scheme of Chan, Perrig, and Song, and unreliable wireless links are represented by independent ON/OFF channels. Modeling the network by an intersection of a random K-out graph and an Erdos-Rényi graph, we present scaling conditions (on the number o...