Zero-one laws for connectivity in random key graphs

Simple item page
dc.contributor.advisor
dc.contributor.authorYagan, Osman
dc.contributor.authorMakowski, Armand
dc.date.accessioned2009-01-16T15:54:57Z
dc.date.available2009-01-16T15:54:57Z
dc.date.issued2009-01-14
dc.description.abstractThe 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.en
dc.description.sponsorshipNSF Grant CCF-07290en
dc.format.extent447739 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/8716
dc.language.isoen_USen
dc.relation.isAvailableAtInstitute for Systems Researchen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us
dc.relation.ispartofseriesTR_2009-1en
dc.subjectWireless sensor networksen
dc.subjectKey predistributionen
dc.subjectRandom key graphsen
dc.subjectConnectivityen
dc.subjectZero-one lawsen
dc.titleZero-one laws for connectivity in random key graphsen
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
YMConnectivityUpdate_1-2.pdf
Size:
798.57 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports