Institute for Systems Research Technical Reports

Permanent URI for this collectionhttp://hdl.handle.net/1903/4376

This archive contains a collection of reports generated by the faculty and students of the Institute for Systems Research (ISR), a permanent, interdisciplinary research unit in the A. James Clark School of Engineering at the University of Maryland. ISR-based projects are conducted through partnerships with industry and government, bringing together faculty and students from multiple academic departments and colleges across the university.

Browse

Subject: search.filters.subject.Random key graphs

Search Results

Now showing 1 - 5 of 5
  • Thumbnail Image
    Item
    A zero-one law for the existence of triangles in random key graphs
    (2011) Yagan, Osman; Makowski, Armand
    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 for the appearance of triangles, and identify the corresponding critical scaling. This is done by applying the method of first and second moments to the number of triangles in the graph.
  • Thumbnail Image
    Item
    On the gradual deployment of random pairwise key distribution schemes
    (2010-07-31) Yagan, Osman; Makowski, Armand M.
    In the context of wireless sensor networks, the pairwise key distribution scheme of Chan et al. has several advantages over other key distribution schemes including the original scheme of Eschenauer and Gligor. However, this offline pairwise key distribution mechanism requires that the network size be set in advance, and involves all sensor nodes simultaneously. Here, we address this issue by describing an implementation of the pairwise scheme that supports the gradual deployment of sensor nodes in several consecutive phases. We discuss the key ring size needed to maintain the secure connectivity throughout all the deployment phases. In particular we show that the number of keys at each sensor node can be taken to be O(log n) in order to achieve secure connectivity (with high probability).
  • Thumbnail Image
    Item
    On random graphs associated with a pairwise key distribution scheme
    (2010-01-01) Yagan, Osman; Makowski, Armand M.
    The pairwise key distribution scheme of Chan et al. was proposed as an alternative to the key distribution scheme of Eschenauer and Gligor to enable network security in wireless sensor networks. We consider the random graph induced by this pairwise scheme under the assumption of full visibility, and show the existence of a zero-one law for graph connectivity.
  • Thumbnail Image
    Item
    On the existence of triangles in random key graphs
    (2009-07-04) Yagan, Osman; Makowski, Armand M.
    The random key graph, also known as the uniform random intersection graph, is a random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We show the existence of a zero-one law for the appearance of triangles in random key graphs by applying the method of first and second moments to the number of triangles in the graph.
  • Thumbnail Image
    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.