The random key graph is a random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity.NSF Grant CCF-0729
Random graphs are of great interest as a modeling framework for a wide variety of real-world complex...
Submitted for inclusion in the program of Infocom 2011, Shanghai (PRC), June 2011In the context of w...
We give, for the first time, a precise mathematical analysis of the connectivity and security proper...
Extended version of a paper submitted to ISIT 2008, Toronto (Canada), July 2008.We consider the rand...
Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer a...
The random key graph, also known as the uniform random intersection graph, is a random graph induced...
We study connectivity property in the superposition of random key graph on random geometric graph. F...
We address the problem of connectivity in Secure Wireless Sensor Networks (SWSN) using random pre-di...
Abstract-We investigate the secure connectivity of wireless sensor networks under the random key dis...
Random graphs are an important tool for modelling and analyzing the underlying properties of complex...
Wireless sensor networks (WSNs) are distributed collections of sensors with limited capabilities for...
Random K-out graphs are used in several applications including modeling by sensor networks secured b...
In wireless sensor networks (WSNs), the Eschenauer–Gligor (EG) key pre-distribution scheme is a wide...
Consider n points (or nodes) distributed uniformly and independently on the unit interval [0,1]. Two...
AbstractA uniform random intersection graph G(n,m,k) is a random graph constructed as follows. Label...
Random graphs are of great interest as a modeling framework for a wide variety of real-world complex...
Submitted for inclusion in the program of Infocom 2011, Shanghai (PRC), June 2011In the context of w...
We give, for the first time, a precise mathematical analysis of the connectivity and security proper...
Extended version of a paper submitted to ISIT 2008, Toronto (Canada), July 2008.We consider the rand...
Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer a...
The random key graph, also known as the uniform random intersection graph, is a random graph induced...
We study connectivity property in the superposition of random key graph on random geometric graph. F...
We address the problem of connectivity in Secure Wireless Sensor Networks (SWSN) using random pre-di...
Abstract-We investigate the secure connectivity of wireless sensor networks under the random key dis...
Random graphs are an important tool for modelling and analyzing the underlying properties of complex...
Wireless sensor networks (WSNs) are distributed collections of sensors with limited capabilities for...
Random K-out graphs are used in several applications including modeling by sensor networks secured b...
In wireless sensor networks (WSNs), the Eschenauer–Gligor (EG) key pre-distribution scheme is a wide...
Consider n points (or nodes) distributed uniformly and independently on the unit interval [0,1]. Two...
AbstractA uniform random intersection graph G(n,m,k) is a random graph constructed as follows. Label...
Random graphs are of great interest as a modeling framework for a wide variety of real-world complex...
Submitted for inclusion in the program of Infocom 2011, Shanghai (PRC), June 2011In the context of w...
We give, for the first time, a precise mathematical analysis of the connectivity and security proper...
Add to ORKG