Show simple item record

On the gradual deployment of random pairwise key distribution schemes

dc.contributor.authorYagan, Osman
dc.contributor.authorMakowski, Armand M.
dc.descriptionSubmitted for inclusion in the program of Infocom 2011, Shanghai (PRC), June 2011en_US
dc.description.abstractIn the context of wireless sensor networks, the pairwise key distribution scheme of Chan et al. has several advantages over other key distribution schemes including the original scheme of Eschenauer and Gligor. However, this offline pairwise key distribution mechanism requires that the network size be set in advance, and involves all sensor nodes simultaneously. Here, we address this issue by describing an implementation of the pairwise scheme that supports the gradual deployment of sensor nodes in several consecutive phases. We discuss the key ring size needed to maintain the secure connectivity throughout all the deployment phases. In particular we show that the number of keys at each sensor node can be taken to be O(log n) in order to achieve secure connectivity (with high probability).en_US
dc.description.sponsorshipNational Science Foundation through NSF Grant CCF-07290en_US
dc.subjectWireless sensor networksen_US
dc.subjectKey predistributionen_US
dc.subjectRandom key graphsen_US
dc.titleOn the gradual deployment of random pairwise key distribution schemesen_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


This item appears in the following Collection(s)

Show simple item record