On random graphs associated with a pairwise key distribution scheme
On random graphs associated with a pairwise key distribution scheme
Files
Publication or External Link
Date
2010-01-01
Authors
Yagan, Osman
Makowski, Armand M.
Advisor
Citation
DRUM DOI
Abstract
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 graph induced by this pairwise scheme under the assumption of full visibility, and show the existence of a zero-one law for graph connectivity.