Now showing items 1-4 of 4

    • Connectivity in random key graphs – Simple proofs for special cases 

      Yagan, Osman; Makowski, Armand (2009-01-14)
      We 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 ...
    • On the resiliency of sensor networks under the pairwise key distribution scheme 

      Yagan, Osman; Makowski, Armand (2011-07)
      We 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 ...
    • A zero-one law for the existence of triangles in random key graphs 

      Yagan, Osman; Makowski, Armand (2011)
      Random key graphs are random graphs induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. For this class of random graphs we show the existence of a zero-one law ...
    • Zero-one laws for connectivity in random key graphs 

      Yagan, Osman; Makowski, Armand (2009-01-14)
      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 ...