• DocumentCode
    3635418
  • Title

    Connectivity in random graphs induced by a key predistribution scheme - small key pools

  • Author

    Osman Yağan;Armand M. Makowski

  • Author_Institution
    Department of Electrical and Computer Engineering and the Institute for Systems Research, University of Maryland at College Park, 20742, USA
  • fYear
    2010
  • fDate
    3/1/2010 12:00:00 AM
  • Firstpage
    1
  • Lastpage
    6
  • Abstract
    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 connectivity, and provide simple proofs for small key pools.
  • Keywords
    "Wireless sensor networks","Educational institutions","Communication system security","Cryptography","Guidelines"
  • Publisher
    ieee
  • Conference_Titel
    Information Sciences and Systems (CISS), 2010 44th Annual Conference on
  • Print_ISBN
    978-1-4244-7416-5
  • Type

    conf

  • DOI
    10.1109/CISS.2010.5464934
  • Filename
    5464934
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3635418