• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文学位 >Random graph modeling of key distribution schemes in wireless sensor networks.
【24h】

Random graph modeling of key distribution schemes in wireless sensor networks.

机译：无线传感器网络中密钥分配方案的随机图建模。

获取原文
获取原文并翻译 | 示例
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Wireless sensor networks (WSNs) are distributed collections of sensors with limited capabilities for computations and wireless communications. It is envisioned that such networks will be deployed in hostile environments where communications are monitored, and nodes are subject to capture and surreptitious use by an adversary. Thus, cryptographic protection will be needed to ensure secure communications, as well as to support sensor-capture detection, key revocation and sensor disabling. Recently, random key predistribution schemes have been introduced to address these issues, and they are by now a widely accepted solution for establishing security in WSNs.;The main goal of the dissertation is to investigate and compare two popular random key predistribution schemes, namely the Eschenauer-Gligor (EG) scheme and the pairwise key distribution scheme of Chan, Perrig and Song. We investigate both schemes through their induced random graph models and develop scaling laws that corresponds to desirable network properties, e.g., absence of secure nodes that are isolated, secure connectivity, resiliency against attacks, scalability, and low memory load. We obtain conditions on the scheme parameters so that these properties occur with high probability as the number of nodes becomes large. We then compare these two schemes explaining their relative advantages and disadvantages, as well as their feasibility for several WSN applications.;In the process, we first focus on the "full visibility" case, where sensors are all within communication range of each other. This assumption naturally leads to studying the random graph models induced by the aforementioned key distribution schemes, namely the random key graph and the random pairwise graph, respectively. In a second step, we remove the assumption of full visibility by integrating a wireless communication model with the random graph models induced under full visibility. We study the connectivity of WSNs under this new model and obtain conditions (for both schemes) that lead to the secure connectivity of the network.
机译：无线传感器网络（WSN）是传感器的分布式集合，具有有限的计算和无线通信功能。可以预见，这样的网络将被部署在监视通信的敌对环境中，并且敌方会捕获并秘密使用节点。因此，将需要密码保护来确保安全的通信，并支持传感器捕获检测，密钥撤销和传感器禁用。近年来，为解决这些问题，人们引入了随机密钥预分配方案，目前，它们已成为在无线传感器网络中建立安全性的一种广泛接受的解决方案。论文的主要目的是研究和比较两种流行的随机密钥预分配方案，即： Eschenauer-Gligor（EG）方案和Chan，Perrig和Song的成对密钥分配方案。我们通过其诱导的随机图模型来研究这两种方案，并开发与所需的网络属性相对应的缩放定律，例如，缺少隔离的安全节点，安全连接性，抵御攻击的弹性，可伸缩性和低内存负载。我们获得有关方案参数的条件，以便随着节点数量变大，这些属性以高概率出现。然后，我们将比较这两种方案，以说明它们的相对优缺点以及在几种WSN应用中的可行性。在此过程中，我们首先关注“完全可见性”情况，其中传感器都在彼此的通信范围内。该假设自然地导致研究由上述密钥分配方案产生的随机图模型，即分别为随机密钥图和随机成对图。在第二步中，我们通过将无线通信模型与在完全可见性下诱发的随机图模型集成在一起，消除了完全可见性的假设。我们研究了这种新模型下WSN的连通性，并获得了导致两种网络安全连通的条件（针对这两种方案）。

著录项

  • 作者

    Yagan, Osman.;

  • 作者单位

    University of Maryland, College Park.;

  • 授予单位 University of Maryland, College Park.;
  • 学科 Engineering Electronics and Electrical.
  • 学位 Ph.D.
  • 年度 2011
  • 页码 261 p.
  • 总页数 261
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号