Connectivity results for random key graphs

Authors:
Osman Yaǧan;Armand M. Makowski
Affiliations:
Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland at College Park, College Park, Maryland;Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland at College Park, College Park, Maryland
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 4
Year:
2009

Citing 2
Cited 1

A key-management scheme for distributed sensor networks

Proceedings of the 9th ACM conference on Computer and communications security
Redoubtable Sensor Networks

ACM Transactions on Information and System Security (TISSEC)

On the existence of triangles in random key graphs

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Quantified Score

Hi-index	0.00

Visualization

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.