On the random graph induced by a randomized predistribution scheme under full visibility (Extended version)

Simple item page
dc.contributor.authorYagan, Osman
dc.contributor.authorMakowski, Armand M.
dc.date.accessioned2008-01-15T19:21:53Z
dc.date.available2008-01-15T19:21:53Z
dc.date.issued2008
dc.descriptionExtended version of a paper submitted to ISIT 2008, Toronto (Canada), July 2008.en
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 show the existence of a zero-one law for the absence of isolated nodes, and complement it by a Poisson convergence for the number of isolated nodes. Leveraging earlier resu lts and analogies with Erd\H{o}s-Renyi graphs, we explore similar results for the property of graph connectivity. Implications for secure connectivity are discussed.en
dc.description.sponsorshipNational Science Foundation,Computing and Communications - Theoretical Foundationsen
dc.format.extent300973 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/1903/7498
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 2008-3en
dc.subjectWireless sensor networksen
dc.subjectKey predistributionen
dc.subjectSecure connectivityen
dc.subjectAbsence of isolated nodesen
dc.subjectZero-one lawsen
dc.subjectPoisson convergenceen
dc.titleOn the random graph induced by a randomized predistribution scheme under full visibility (Extended version)en
dc.typeTechnical Reporten

Files

Original bundle

Now showing 1 - 1 of 1
Thumbnail Image
Name:
2008-3.pdf
Size:
293.92 KB
Format:
Adobe Portable Document Format
Download

Collections

Institute for Systems Research Technical Reports
Electrical & Computer Engineering Research Works