On random graphs associated with a pairwise key distribution scheme for wireless sensor networks (Extended version)

dc.contributor.authorYagan, Osman
dc.contributor.authorMakowski, Armand M.
dc.date.accessioned2010-07-30T15:50:33Z
dc.date.available2010-07-30T15:50:33Z
dc.date.issued2010-07
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 (EG) to enable network security in wireless sensor networks. In this paper we consider the random graph induced by this pairwise scheme under the assumption of full visibility. We first establish a zero-one law for graph connectivity. Then, we discuss the number of keys needed in the memory of each sensor in order to achieve secure connectivity (with high probability). For a network of n sensors the required number of keys is shown to be on the order of log n, a key ring size comparable to that of the EG scheme (in realistic scenarios).en_US
dc.identifier.urihttp://hdl.handle.net/1903/10601
dc.language.isoen_USen_US
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_2010-16;
dc.subjectWireless sensor networksen_US
dc.subjectSecurityen_US
dc.subjectKey predistributionen_US
dc.subjectConnectivityen_US
dc.subjectRandom graphsen_US
dc.subjectZero-one lawsen_US
dc.titleOn random graphs associated with a pairwise key distribution scheme for wireless sensor networks (Extended version)en_US
dc.typeTechnical Reporten_US

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
YaganMakowskiRPLong_edited.pdf
Size:
297.04 KB
Format:
Adobe Portable Document Format