학술논문
On the Eschenauer-Gligor key predistribution scheme under on-off communication channels: The absence of isolated nodes
Document Type
Conference
Author
Source
2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton) Communication, Control, and Computing (Allerton), 2015 53rd Annual Allerton Conference on. :1494-1501 Sep, 2015
Subject
Language
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ős-Rényi (ER) graph. For this class of composite random graphs we give various improvements on a recent result by Yağan [17] concerning zero-one laws for the absence of isolated nodes.