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

Filters

2010 - 20114

Settings

Start date: 2010Subject: search.filters.subject.Security

Search Results

Now showing 1 - 4 of 4
  • Thumbnail Image
    Item
    On the resiliency of sensor networks under the pairwise key distribution scheme
    (2011-07) Yagan, Osman; Makowski, Armand
    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 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].
  • 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 for wireless sensor networks (Extended version)
    (2010-07) 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 (EG) to enable network security in wireless sensor networks. In this paper we consider the random graph induced by this pairwise scheme under the assumption of full visibility. We first establish a zero-one law for graph connectivity. Then, we discuss the number of keys needed in the memory of each sensor in order to achieve secure connectivity (with high probability). For a network of n sensors the required number of keys is shown to be on the order of log n, a key ring size comparable to that of the EG scheme (in realistic scenarios).
  • 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.