Title :
Connectivity results for random key graphs
Author :
Osman Yagan;Armand M. Makowski
Author_Institution :
Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland at College Park, 20742, USA
Abstract :
The random key graph is the 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, and provide an outline for its proof.
Keywords :
"Wireless sensor networks","Educational institutions","Cryptography","H infinity control"
Conference_Titel :
Information Theory, 2009. ISIT 2009. IEEE International Symposium on
Print_ISBN :
978-1-4244-4312-3
Electronic_ISBN :
2157-8117
DOI :
10.1109/ISIT.2009.5206014
