On random graphs associated with a pairwise key distribution scheme for wireless sensor networks (Extended version)
| dc.contributor.author | Yagan, Osman | |
| dc.contributor.author | Makowski, Armand M. | |
| dc.date.accessioned | 2010-07-30T15:50:33Z | |
| dc.date.available | 2010-07-30T15:50:33Z | |
| dc.date.issued | 2010-07 | |
| dc.description.abstract | The 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.uri | http://hdl.handle.net/1903/10601 | |
| dc.language.iso | en_US | en_US |
| dc.relation.isAvailableAt | Institute for Systems Research | en_us |
| dc.relation.isAvailableAt | Digital Repository at the University of Maryland | en_us |
| dc.relation.isAvailableAt | University of Maryland (College Park, MD) | en_us |
| dc.relation.ispartofseries | TR_2010-16; | |
| dc.subject | Wireless sensor networks | en_US |
| dc.subject | Security | en_US |
| dc.subject | Key predistribution | en_US |
| dc.subject | Connectivity | en_US |
| dc.subject | Random graphs | en_US |
| dc.subject | Zero-one laws | en_US |
| dc.title | On random graphs associated with a pairwise key distribution scheme for wireless sensor networks (Extended version) | en_US |
| dc.type | Technical Report | en_US |