Search
Now showing items 1-4 of 4
Connectivity in one-dimensional geometric random graphs: Poisson approximations, zero-one laws and phase transitions
(2008-10-24)
Consider n points (or nodes) distributed uniformly and independently on the unit interval [0,1]. Two nodes are said to be adjacent if their distance is less than some given threshold value.For the underlying random graph ...
On random graphs associated with a pairwise key distribution scheme
(2010-01-01)
The pairwise key distribution scheme of Chan
et al. was proposed as an alternative to the key distribution scheme of Eschenauer and Gligor to enable network security in wireless sensor networks. We consider the random ...
On the gradual deployment of random pairwise key distribution schemes
(2010-07-31)
In the context of wireless sensor networks, the pairwise key distribution scheme of Chan et al. has several advantages over other key distribution schemes including the original scheme of Eschenauer and Gligor. However, ...
On random graphs associated with a pairwise key distribution scheme for wireless sensor networks (Extended version)
(2010-07)
The pairwise key distribution scheme of Chan
et al. was proposed as an alternative to the key distribution scheme of Eschenauer and Gligor (EG) to enable network security in wireless sensor networks. In this paper we ...