• DocumentCode
    3632792
  • Title

    Connectivity results for random key graphs

  • Author

    Osman Yagan;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
    2009
  • Firstpage
    2403
  • Lastpage
    2407
  • Abstract
    The random key graph is 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 an outline for its proof.
  • Keywords
    "Wireless sensor networks","Educational institutions","Cryptography","H infinity control"
  • Publisher
    ieee
  • Conference_Titel
    Information Theory, 2009. ISIT 2009. IEEE International Symposium on
  • ISSN
    2157-8095
  • Print_ISBN
    978-1-4244-4312-3
  • Electronic_ISBN
    2157-8117
  • Type

    conf

  • DOI
    10.1109/ISIT.2009.5206014
  • Filename
    5206014
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3632792