Show simple item record

On random graphs associated with a pairwise key distribution scheme

dc.contributor.authorYagan, Osman
dc.contributor.authorMakowski, Armand M.
dc.date.accessioned2010-05-04T14:40:54Z
dc.date.available2010-05-04T14:40:54Z
dc.date.issued2010-01-01
dc.identifier.urihttp://hdl.handle.net/1903/10066
dc.description.abstractThe pairwise key distribution scheme of Chan et al. was proposed as an alternative to the key distribution scheme of Eschenauer and Gligor to enable network security in wireless sensor networks. We consider the random graph induced by this pairwise scheme under the assumption of full visibility, and show the existence of a zero-one law for graph connectivity.en_US
dc.language.isoen_USen_US
dc.relation.ispartofseriesTR_2010-10
dc.subjectWireless sensor networksen_US
dc.subjectSecurityen_US
dc.subjectKey predistributionen_US
dc.subjectRandom key graphsen_US
dc.subjectConnectivityen_US
dc.subjectZero-one lawsen_US
dc.titleOn random graphs associated with a pairwise key distribution schemeen_US
dc.typeTechnical Reporten_US
dc.relation.isAvailableAtA. James Clark School of Engineeringen_us
dc.relation.isAvailableAtElectrical & Computer Engineeringen_us
dc.relation.isAvailableAtDigital Repository at the University of Marylanden_us
dc.relation.isAvailableAtUniversity of Maryland (College Park, MD)en_us


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record