共查询到20条相似文献,搜索用时 156 毫秒
1.
基于密钥预置技术,提出了一种新的传感器网络动态对偶密钥建立算法。在该算法中,节点在部署前首先被预置一个全局初始密钥,在部署之后,邻节点之间将基于预置的全局初始密钥来动态生成一跳的对偶密钥。理论分析与实验结果表明,与已有基于随机方法的传感器网络对偶密钥建立算法相比,新算法具有更好的直接和间接对偶密钥建立概率。 相似文献
2.
对偶密钥建立的有效性和安全性的折衷平衡是研究传感器网络中对偶密钥管理问题的焦点.提出了基于扩环矩阵向量预置的密钥建立算法以及相应的节点自学习算法.仿真实验表明我们的算法不仅取得了与MSKPD方案非常接近的抗毁损性能,而且在同样的预置和部署条件下,具有更高的密钥连通度. 相似文献
3.
对偶密钥机制,使得网络中任意两个节点共享预置的密钥,在传感器网络的安全中具有非常重要的意义。由于节点资源受限,如何尽可能减小建立间接对偶密钥的路径长度是该类算法的研究焦点之一。该文提出了一种基于超立方体模型的对偶密钥快速建立算法,采用对二进制串分段及逻辑运算等处理来消并一定数量的异位数目,从而在较大程度上减少生成密钥路径的中间节点。 相似文献
4.
5.
6.
周鹏 《计算机工程与设计》2009,30(8)
针对管道流量泄漏和管网突发性的爆管,将动态密钥路径的实现应用于管道流量泄漏监测中,对偶密钥技术的采用使无线传感器网络通信的安全性得到保障,而对偶密钥中的动态密钥路径的应用进一步提高无线传感器网络通信的可靠性.提出了动态密钥预分配方案及预置算法,导出了基于弱连通性的簇内动态密钥路径实施过程及其算法分析.sBIBD模型算法较好地预测网络阻塞现象,自适应实时调整网络传输速率和减少网络数据损失率.该算法具有良好可靠性和高效性,以保证在管道泄漏监测网络中获得更优的链路利用率、TCP友好性以及减少链路丢包率,是一种适合无线传感器网络安全可靠的具有实用价值的算法. 相似文献
7.
8.
9.
10.
11.
传感器网络中一种可靠的对密钥更新方案 总被引:7,自引:0,他引:7
提出了一种基于预分发和协作的可靠的对密钥更新方案RPKU(reliable pairwise key-updating).借助于一种改进的Blom密钥矩阵构造方法,该方案能够随着网络的动态变化而动态伸缩各个节点的密钥信息,从而解决了由于节点被攻击所导致的密钥泄漏和密钥连通性下降等问题.该方案还提出了一种基于分簇型传感器网络结构的密钥预分发方法,使得任意两个相邻节点间都能建立一个对密钥.仿真结果表明,与已有的密钥方案相比,该方案在安全性、密钥连通性和扩展性等方面都具有明显的优势. 相似文献
12.
一个新的基于身份的无线传感器网络密钥协商方案 总被引:1,自引:0,他引:1
无线信道具有开放性,节点间建立配对密钥是无线传感器网络安全通信的基础。在大部分基于身份加密(Identity-Based Encryption, IBE)的传感器网络密钥协商方案中,使用双线对运算建立配对密钥,能耗高且耗时长。基于BNN-IBS身份签名提出了一个新的无线传感器网络密钥协商方案,节点通过Diffie-Hellman协议建立配对密钥,所需的密钥参数通过广播获得。与基于IBE的传感器网络密钥协商方案(IBE-based Key Agreement Scheme, IBEKAS)进行量化比较,结果表明本方案不仅提供了与IBEKAS同层次的安全性与可扩展性,且在能耗与时耗方面具有较明显的优势。 相似文献
13.
14.
15.
Simple,extensible and flexible random key predistribution schemes for wireless sensor networks using reusable key pools 总被引:2,自引:1,他引:1
Albert Levi Sinan Emre Taşçı Young Jae Lee Yong Jae Lee Ersoy Bayramoğlu Murat Ergun 《Journal of Intelligent Manufacturing》2010,21(5):635-645
Sensor nodes are tiny, low-power, computationally limited and battery constrained electromechanical devices. A sensor node
contains a sensing unit and a wireless communication unit. Sensor nodes are deployed over a field for sensing an event data
in the environment and transfer it towards a base station over its wireless channel. In a typical application, vast amount
of sensor nodes are deployed over a field which constitute a sensor network. Sensor nodes must be customized for a specific sensor network application before the deployment. This customization is needed
not only for underlying networking application, but also for security related configurations. Random key predistribution mechanisms
have been proposed to provide security for wireless sensor networks. In the literature, there are well known random key predistribution
schemes. Some of these schemes are secure, but quite complex to apply in real-world applications due to their node-based customization
requirements, while some other are easily applicable but they do not offer reasonable security. In this paper, we propose
random key predistribution schemes for wireless sensor networks that provide varying ranges of security. The proposed schemes
are easily applicable in real world scenarios due to their simplicity and relaxed node customization requirements. In this
respect, our schemes provide a tradeoff. Moreover, our proposed schemes show a good extensibility property. We assume prior
deployment knowledge. We examine performance of our schemes and compare them with well known random key predistribution schemes. 相似文献
16.
Pairwise key establishment is a fundamental security service in sensor networks; it enables sensor nodes to communicate securely with each other using cryptographic techniques. In order to ensure this security, many approaches have been proposed recently. One of them is to use key predistribution schemes (KPSs) by means of combinatorial designs. In this paper, we use the Bush’s construction of orthogonal arrays to present a class of key predistribution schemes for distributed sensor networks. The secure connectivity and resilience of the resulting sensor network are analyzed. This KPS constructed in our paper has some better properties than those of the existing schemes. 相似文献
17.
Wenliang Du Jing Deng Han Y.S. Varshney P.K. 《Dependable and Secure Computing, IEEE Transactions on》2006,3(1):62-77
To achieve security in wireless sensor networks, it is important to be able to encrypt messages sent among sensor nodes. Keys for encryption purposes must be agreed upon by communicating nodes. Due to resource constraints, achieving such key agreement in wireless sensor networks is nontrivial. Many key agreement schemes used in general networks, such as Diffie-Hellman and public-key-based schemes, are not suitable for wireless sensor networks. Predistribution of secret keys for all pairs of nodes is not viable due to the large amount of memory used when the network size is large. Recently, a random key predistribution scheme and its improvements have been proposed. A common assumption made by these random key predistribution schemes is that no deployment knowledge is available. Noticing that, in many practical scenarios, certain deployment knowledge may be available a priori, we propose a novel random key predistribution scheme that exploits deployment knowledge and avoids unnecessary key assignments. We show that the performance (including connectivity, memory usage, and network resilience against node capture) of sensor networks can be substantially improved with the use of our proposed scheme. The scheme and its detailed performance evaluation are presented in this paper. 相似文献
18.
19.
借鉴传感器网络中基于密钥矩阵密钥对预配置方案,设计出一个应用于传感器网络的高效密钥对预配置方案:应用矩阵池的密钥预配置方案。该方案提出了矩阵池的概念,将密钥的预配置建立在多个密钥矩阵之上,节省了节点的存储空间,增强了网络的可扩展性。将加密传输机制应用到密钥的传输过程中,增强了密钥传输过程中的安全性。通过本文的分析可以看出该方案有一些优良的特性,包括两节点间能以很高的概率成功建立密钥对、对入侵有较强的鲁棒性、低通讯量。 相似文献