Connectivity in random key graphs – Simple proofs for special cases

Simple item page
dc.contributor.authorYagan, Osman
dc.contributor.authorMakowski, Armand
dc.date.accessioned2009-04-14T13:32:51Z
dc.date.available2009-04-14T13:32:51Z
dc.date.issued2009-01-14
dc.description.abstractWe consider 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 simple proofs for some special cases.en
dc.format.extent275904 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/9055
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-6en
dc.subjectWireless sensor networksen
dc.subjectZero-one lawsen
dc.subjectKey predistributionen
dc.subjectRandom key graphen
dc.subjectConnectivityen
dc.titleConnectivity in random key graphs – Simple proofs for special casesen
dc.typeArticleen

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
ISIT2009specialedited.pdf
Size:
269.44 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports