Institute for Systems Research
Permanent URI for this communityhttp://hdl.handle.net/1903/4375
Browse
3 results
Search Results
Item On the resiliency of sensor networks under the pairwise key distribution scheme(2011-07) Yagan, Osman; Makowski, ArmandWe investigate the security of wireless sensor networks under the pairwise key distribution scheme of Chan et al. [2]. We present conditions on how to scale the model parameters so that the network is i) unassailable, and ii) unsplittable, both with high probability, as the number of sensor nodes becomes large. We show that the required number of secure keys to be stored in the memory of each sensors is order of magnitude smaller than what is required for the Eschenauer-Gligor scheme [5].Item Connectivity in random key graphs – Simple proofs for special cases(2009-01-14) Yagan, Osman; Makowski, ArmandWe consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity, and provide simple proofs for some special cases.Item Zero-one laws for connectivity in random key graphs(2009-01-14) Yagan, Osman; Makowski, Armand;The random key graph is a random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We report on recent results concerning a conjectured zero-one law for graph connectivity.