适合于无线传感器网络的混合式组密钥管理方案

针对无线传感器网络中经常出现节点加入或退出网络的情况,提出了一种安全有效的混合式组密钥管理方案.多播报文的加密和节点加入时的组密钥更新,采用了对称加密技术;而系统建立后,组密钥的分发和节点退出后的组密钥更新,采用了基于身份的公钥广播加密方法.方案可抗同谋、具有前向保密性、后向保密性等安全性质.与典型组密钥管理方案相比,方案在适当增加计算开销的情况下,有效降低了节点的存储开销和组密钥更新通信开销.由于节点的存储量、组密钥更新开销独立于群组大小,方案具有较好的扩展性,适合应用于无线传感器网络环境.     

WSN的网络安全管理机制研究

本文提出一种基于多项式的WSN密钥管理方案.基站通过计算节点秘密信息构成的多项式来生成网络的全局密钥,节点通过全局密钥可以认证网络中的合法节点.节点用全局密钥经过对称多项式密钥交换来生成与簇头节点之间的会话密钥.该方案能够动态更新密钥,从而解决了由于节点被捕获所导致的信息泄露、密钥连通性下降和密钥更新通信开销大等问题.性能分析表明,该方案与现有的密钥预分配方案相比,具有更低的存储开销、通信开销、良好的扩展性和连通性.     

移动ad hoc网络预分配非对称密钥管理方案

为了降低移动ad hoc网络非对称密钥管理中的通信开销,基于组合公钥思想,将ElGamal方案与预分配密钥方式相结合,提出一种基于身份的预分配非对称密钥管理方案(PAKMS)。该方案通过私钥生成中心为节点预分配主密钥子集及基于时间获得节点密钥更新的方式,从方法上降低了移动ad hoc网络非对称密钥管理中的通信开销;私钥生成中心为节点预分配主密钥子集的方式也使节点在网络运行阶段不再依赖私钥生成中心为节点分配和更新密钥。由此,弱化了基于身份密钥管理中存在的私钥托管问题对网络安全的影响。与典型方案对比分析表明,该方案在提供节点密钥更新服务的情况下能够有效降低网络通信开销。此外,对方案的安全性进行了详细证明。     

基于LKH的组播密钥分发改进方案R-LKH

随着Internet的发展，组播技术得到了广泛的应用，其中组密钥管理是组播安全的核心问题。分析了已有密钥管理方案的优缺点，特别是被广泛关注的LKH方案，提出了一个基于LKH的密钥管理新方案R—LKH．并给出相应的更新算法。通过对本方案和其他方案的通信开销、密钥存储开销和计算开销的分析表明．该方案可有效降低密钥开销，且具有可行的通信效率，适用于大型的动态群组。     

一种无状态的传感器网络密钥预分配方案

 在无线传感器网络中,节点被敌方捕获以后将泄露节点内存储的群组密钥等秘密信息,所以需要建立一种安全高效的群组密钥管理系统来及时对被捕获节点进行撤销,以保证无线传感器网络中群组通信的安全.提出一种基于逻辑密钥树结构的密钥预分配方案,群组控制者和密钥服务器(GCKS)为逻辑密钥树中每一逻辑节点分配一个密钥集,每一sensor节点对应一个叶节点,以及一条从该叶节点到根节点的路径,GCKS将该路径上所有节点的密钥植入sensor节点.节点撤销时,GCKS将逻辑密钥树分成互不相连的子树,利用子树中sensor节点的共享密钥进行群组密钥的更新.分析表明本方案满足无状态性,以及正确性、群组密钥保密性、前向保密性和后向保密性等安全性质,具有较低的存储、通信和计算开销,适用于无线传感器网络环境.     

基于LKH的组播密钥分发改进方案

文章在分析LKH算法的基础上,结合在小规模组播时PE算法性能较好的优势,设计了一种改进的组播密钥管理方案PE-RLKH方案,并给出相应的更新算法。通过对本方案和LKE方案的通信开销、密钥存储开销和计算开销的比较表明,该方案具有计算开销小,在保持一定的通信开销下能降低组密钥存储开销,具有较好的通信效率,可适用于较大规模的组播。     

基于身份的空间网络组密钥管理方案

针对现有组密钥管理方案无法适应空间网络的问题,提出了一种基于身份的空间网络组密钥管理方案.方案设置了一个由卫星节点组成的多播服务节点集合,协助多播群组完成公共参数的生成和广播,解决了组成员开销不平衡的问题;为同一群组提供服务的节点动态可变,避免了单点失效问题.与现有方案相比,本方案在满足安全要求的基础上,具有更小的计算、存储和通信开销.     

一种新的基于椭圆曲线密码体制的 Ad hoc组密钥管理方案

在安全的组通信中,组密钥管理是最关键的问题.论文首先分析了组密钥管理的现状和存在的问题,然后基于椭圆曲线密码体制,针对Ad hoc网络提出了一种安全有效的分布式组密钥管理方案,并对其正确性和安全性进行了证明,由椭圆曲线离散对数困难问题保证协议的安全.针对Ad hoc网络节点随时加入或退出组的特点,提出了有效的组密钥更新方案,实现了组密钥的前向保密与后向保密.与其他组密钥管理方案相比,本方案更加注重组成员的公平性,没有固定的成员结构,并且还具有轮数少、存储开销、通信开销小等特点,适合于在Ad hoc网络环境中使用.     

WSN中同构模型下动态组密钥管理方案

研究了同构网络模型的组密钥管理问题,首次给出了一个明确的、更完整的动态组密钥管理模型,并提出了一种基于多个对称多项式的动态组密钥管理方案。该方案能够为任意多于2个且不大于节点总数的节点组成的动态多播组提供密钥管理功能,解决了多播组建立、节点加入、退出等所引发的与组密钥相关的问题。该方案支持节点移动,具有可扩展性,并很好地解决了密钥更新过程中多播通信的不可靠性。组成员节点通过计算获得组密钥,只需要少量的无线通信开销,大大降低了协商组密钥的代价。分析比较认为,方案在存储、计算和通信开销方面具有很好的性能,更适用于资源受限的无线传感器网络。     

基于LKH混合树模型的新型组播密钥更新方案

安全组播是组播技术走向实用化必须解决的问题。在组成员动态变化时,设计一个高效的密钥管理方案是安全组播研究的主要问题。提出了一种基于新型混合树模型的组播密钥更新方案。该方案将GC的存储开销减小为4,同时,在成员加入或离开组时,由密钥更新引起的通信开销与nm保持对数关系(n为组成员数,m为每一族包含的成员数)。     

无线传感器网络中自治愈的群组密钥管理方案

 群组密钥管理的自治愈机制是保证无线传感器网络在不可靠信道上进行安全群组通信的重要 手段.基于采用双方向密钥链的群组密钥分发与撤销方法,提出了一个无线传感器网络中具有撤销能力的自治愈群组密钥管理方案.该方案实现了群组密钥的自治愈功能和节点撤销能力, 能够满足在较高丢包率的无线通信环境下传感器网络群组密钥管理的安全需求,确保了群组密钥保密性、前向保密性和后向保密性等安全属性.性能分析表明,该方案具有较小的计算和通信开销,能够适用于无线传感器网络.     

一种用于无线传感器网的协作接收方案

无线传感器网中,能量效率是系统设计首要考虑的因素.基于提高无线传感器网能量效率的目的,本文提出了一种简单的协作接收方案并分析了其能量效率,理论分析及仿真结果表明,当通信距离大于某一门限值时采用该接收方案可以有效提高无线传感器网的能量效率.     

Compromise-resilient anti-jamming communication in wireless sensor networks

Jamming is a kind of Denial-of-Service attack in which an adversary purposefully emits radio frequency signals to corrupt the wireless transmissions among normal nodes. Although some research has been conducted on countering jamming attacks, few works consider jamming attacks launched by insiders, where an attacker first compromises some legitimate sensor nodes to acquire the common cryptographic information of the sensor network and then jams the network through those compromised nodes. In this paper, we address the insider jamming problem in wireless sensor networks. In our proposed solutions, the physical communication channel of a sensor network is determined by the group key shared by all the sensor nodes. When insider jamming happens, the network will generate a new group key to be shared only by the non-compromised nodes. After that, the insider jammers are revoked and will not be able to predict the future communication channels used by the non-compromised nodes. Specifically, we propose two compromise-resilient anti-jamming schemes: the split-pairing scheme which deals with a single insider jammer, and the key-tree-based scheme which copes with multiple colluding insider jammers. We implement and evaluate the proposed solutions using Mica2 Motes. Experimental results show that our solutions have low recovery latency and low communication overhead, and hence they are suitable for resource constrained sensor networks.     

Active caching: a transmission method to guarantee desired communication reliability in wireless sensor networks

Due to the high packet loss rate during multi-hop transmissions in wireless sensor networks, more reliable endto- end data transmission is desirable. Because wireless sensor network applications require various levels of communication reliability (CR), the end-to-end data transmission should satisfy the desired CR of the applications. In this letter, we propose a flexible loss recovery mechanism for sensor network applications with various CRs. The proposed scheme caches data packets at intermediate nodes over routing paths computed by CR to retransmit lost packets during multi-hop transmissions. Because the proposed scheme presents a tradeoff between end-to-end delays and memory requirements dependent on CR, it can be used flexibly in various sensor network applications.     

基于聚类的无线传感网络的合作MIMO传输方案

Wireless sensor network is becoming more and more popular in recent years, but energy-constrained characteristic of sensor nodes is one of the critical issues that we must consider in system design. In this paper, a cluster-based virtual V-BLAST transmission scheme is proposed to achieve energy savings for energy-constrained wireless sensor networks. In the proposed scheme, instead of using cluster member as cooperative nodes, multiple cluster heads cooperate to form virtual antenna array so that V-BLAST based virtual MIMO transmission can be implemented. Based on the communication energy consumption model, a way to optimize the parameters for the scheme is given. In addition, detailed simulation is performed to evaluate the performance of the proposed scheme for both densely and sparsely deployed sensor networks. Theoretical analysis and simulation results verify the energy efficiency of the proposed scheme.     

Range‐free intersecting chord‐based geometric localization scheme for wireless sensor networks

Recent advancement in wireless sensor network has contributed greatly to the emerging of low‐cost, low‐powered sensor nodes. Even though deployment of large‐scale wireless sensor network became easier, as the power consumption rate of individual sensor nodes is restricted to prolong the battery lifetime of sensor nodes, hence the heavy computation capability is also restricted. Localization of an individual sensor node in a large‐scale geographic area is an integral part of collecting information captured by the sensor network. The Global Positioning System (GPS) is one of the most popular methods of localization of mobile terminals; however, the use of this technology in wireless sensor node greatly depletes battery life. Therefore, a novel idea is coined to use few GPS‐enabled sensor nodes, also known as anchor nodes, in the wireless sensor network in a well‐distributed manner. Distances between anchor nodes are measured, and various localization techniques utilize this information. A novel localization scheme Intersecting Chord‐Based Geometric Localization Scheme (ICBGLS) is proposed here, which loosely follows geometric constraint‐based algorithm. Simulation of the proposed scheme is carried out for various communication ranges, beacon broadcasting interval, and anchor node traversal techniques using Omnet++ framework along with INET framework. The performance of the proposed algorithm (ICBGLS), Ssu scheme, Xiao scheme, and Geometric Constraint‐Based (GCB) scheme is evaluated, and the result shows the fact that the proposed algorithm outperforms the existing localization algorithms in terms of average localization error. The proposed algorithm is executed in a real‐time indoor environment using Arduino Uno R3 and shows a significant reduction in average localization time than GCB scheme and similar to that of the SSU scheme and Xiao scheme.     

Topology control in the presence of jammers for wireless sensor networks

In this paper, the problem of ensuring packet delivery ratio and high network lifetime in wireless sensor networks in the presence of single or multiple jammers is studied using single‐leader‐multiple‐followers Stackelberg game theory. A topology control scheme is proposed, in which the sink node, which acts as the leader, identifies the set of jamming affected nodes. On the other hand, the sensor nodes, which act as followers, need to decide an optimum transmission power level, while ensuring an optimal set of neighbor nodes covered. A scheme, named TC‐JAM, for ensuring packet delivery ratio, while avoiding jammers and increasing network lifetime in wireless sensor networks, is proposed. In existing literatures, the sensor nodes are envisioned to be equipped with multiple interfaces, while having access for multiple channels. However, in TC‐JAM, the sensor nodes have simple hardware with single interface for communication, ie, the sensor nodes have single channel for communication. Additionally, in the proposed scheme, TC‐JAM, each sensor node has a provision to vary its transmission power according to the chosen strategies. Using TC‐JAM, the energy consumption of the overall network reduces by up to 62%, and the network lifetime increases by 56% to 73%.     

Probabilistic Forwarding Decision Scheme for Reliable Geocasting in Wireless Sensor Networks

Geocasting is an important communication service in wireless sensor networks. Most of the existing geocasting protocols assume that sensor nodes and the area of interest have accurate location information. However, this assumption is unreasonable if localization systems or schemes cannot work well. This study proposes an efficient probabilistic forwarding decision scheme for reliable geocasting in virtual coordinate-based wireless sensor networks. The proposed scheme uses directional code and hop distance to identify sensor node’s location. The sensor node determines a direction-based probability and a distance-based probability derived from its directional code and hop distance, respectively. The sensor node depends on the two probabilities to determine its ultimate forwarding probability. Simulation results confirm that the proposed scheme outperforms the pure direction-based forwarding scheme in packet delivery ratio though it occurs more packets. Results also show that the direction-based probability significantly dominates the geocasting performance.