On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes (Extended version)

TL;DR

This paper analyzes the connectivity of the Eschenauer-Gligor key predistribution scheme in wireless sensor networks under random on-off communication links, providing improved zero-one laws for the absence of isolated nodes.

Contribution

It extends previous results by deriving sharper zero-one laws for network connectivity considering on-off channels in the Eschenauer-Gligor scheme.

Findings

Improved zero-one laws for absence of isolated nodes

Modeling of the network as intersection of random key and ER graphs

Enhanced understanding of network connectivity under on-off channels

Abstract

We consider the Eschenauer-Gligor key predistribution scheme under the condition of partial visibility with i.i.d. on-off links between pairs of nodes. This situation is modeled as the intersection of two random graphs, namely a random key graph and an Erd\H{o}s-R\'enyi (ER) graph. For this class of composite random graphs we give various improvements on a recent result by Ya\u{g}an [IEEE Transactions on Information Theory, 58(6):3821-3835, 2012] concerning zero-one laws for the absence of isolated nodes.