Dynamic key management in wireless sensor networks: A survey

Wireless sensor networks (WSNs) have a vast field of applications, including environment monitoring, battlefield surveillance and target tracking systems. As WSNs are usually deployed in remote or even hostile environments and sensor nodes are prone to node compromise attacks, the adoption of dynamic key management is extremely important. However, the resource-constrained nature of sensor nodes hinders the use of dynamic key management solutions designed for wired and ad hoc networks. Hence, many dynamic key management schemes have been proposed for WSNs recently. This paper investigates the special requirements of dynamic key management in sensor network environments, and introduces several basic evaluation metrics. In this work, the state of the art dynamic key management schemes are classified into different groups and summarized based on the evaluation metrics. Finally, several possible future research directions for dynamic key management are provided.     

Location-Aware Combinatorial Key Management Scheme for Clustered Sensor Networks

Recent advances in wireless sensor networks (WSNs) are fueling the interest in their application in a wide variety of sensitive settings such as battlefield surveillance, border control, and infrastructure protection. Data confidentiality and authenticity are critical in these settings. However, the wireless connectivity, the absence of physical protection, the close interaction between WSNs and their physical environment, and the unattended deployment of WSNs make them highly vulnerable to node capture as well as a wide range of network-level attacks. Moreover, the constrained energy, memory, and computational capabilities of the employed sensor nodes limit the adoption of security solutions designed for wire-line and wireless networks. In this paper, we focus on the management of encryption keys in large-scale clustered WSNs. We propose a novel distributed key management scheme based on Exclusion Basis Systems (EBS); a combinatorial formulation of the group key management problem. Our scheme is termed SHELL because it is Scalable, Hierarchical, Efficient, Location-aware, and Light-weight. Unlike most existing key management schemes for WSNs, SHELL supports rekeying and, thus, enhances network security and survivability against node capture. SHELL distributes key management functionality among multiple nodes and minimizes the memory and energy consumption through trading off the number of keys and rekeying messages. In addition, SHELL employs a novel key assignment scheme that reduces the potential of collusion among compromised sensor nodes by factoring the geographic location of nodes in key assignment. Simulation results demonstrate that SHELL significantly boosts the network resilience to attacks while conservatively consuming nodes' resources.     

A survey on clustering algorithms for wireless sensor networks

The past few years have witnessed increased interest in the potential use of wireless sensor networks (WSNs) in applications such as disaster management, combat field reconnaissance, border protection and security surveillance. Sensors in these applications are expected to be remotely deployed in large numbers and to operate autonomously in unattended environments. To support scalability, nodes are often grouped into disjoint and mostly non-overlapping clusters. In this paper, we present a taxonomy and general classification of published clustering schemes. We survey different clustering algorithms for WSNs; highlighting their objectives, features, complexity, etc. We also compare of these clustering algorithms based on metrics such as convergence rate, cluster stability, cluster overlapping, location-awareness and support for node mobility.     

基于中国剩余定理的传感器网络密钥管理协议

无线传感器网络的安全性是目前研究的热点。传统基于临时初始密钥和基于密钥池预分配的方案难以在网络连通性和节点存储计算消耗之间有效平衡,网络生命期内使用固定不变的初始密钥/密钥池难以抵抗节点捕获攻击。本文基于中国剩余定理提出了传感器网络密钥管理协议,每个节点携带较少的密钥素材,能够实现网络最大连通,并具有较少的存储空间和计算与通信能耗;基于时间概念分多个阶段部署传感器节点时,发布的密钥素材在不同的节点部署阶段相应变化,使得网络具有自愈合功能,从而具有较强的抗节点捕获攻击。     

无线传感器网络能量管理研究

传感器节点能量受限的特点使能量管理成为无线传感器网络(WSNs)设计的一个重要内容。对近年来无线传感器能量管理的研究进展进行了讨论和综述,指出了WSNs能量管理面临的问题与挑战。在分类阐述和比较当前具有代表性的各种休眠机制的同时,介绍了动态电压调节、动态功率管理、数据融合等能量管理策略。最后,指出了WSNs能量管理的未来发展方向。     

A systematic review on clustering and routing techniques based upon LEACH protocol for wireless sensor networks

In recent years, Wireless Sensor Networks (WSNs) have emerged as a new powerful technology used in many applications such as military operations, surveillance system, Intelligent Transport Systems (ITS) etc. These networks consist of many Sensor Nodes (SNs), which are not only used for monitoring but also capturing the required data from the environment. Most of the research proposals on WSNs have been developed keeping in view of minimization of energy during the process of extracting the essential data from the environment where SNs are deployed. The primary reason for this is the fact that the SNs are operated on battery which discharges quickly after each operation. It has been found in literature that clustering is the most common technique used for energy aware routing in WSNs. The most popular protocol for clustering in WSNs is Low Energy Adaptive Clustering Hierarchy (LEACH) which is based on adaptive clustering technique. This paper provides the taxonomy of various clustering and routing techniques in WSNs based upon metrics such as power management, energy management, network lifetime, optimal cluster head selection, multihop data transmission etc. A comprehensive discussion is provided in the text highlighting the relative advantages and disadvantages of many of the prominent proposals in this category which helps the designers to select a particular proposal based upon its merits over the others.     

Scalable and efficient key management for heterogeneous sensor networks

As typical wireless sensor networks (WSNs) have resource limitations, predistribution of secret keys is possibly the most practical approach for secure network communications. In this paper, we propose a key management scheme based on random key predistribution for heterogeneous wireless sensor networks (HSNs). As large-scale homogeneous networks suffer from high costs of communication, computation, and storage requirements, the HSNs are preferred because they provide better performance and security solutions for scalable applications in dynamic environments. We consider hierarchical HSN consisting of a small number high-end sensors and a large number of low-end sensors. To address storage overhead problem in the constraint sensor nodes, we incorporate a key generation process, where instead of generating a large pool of random keys, a key pool is represented by a small number of generation keys. For a given generation key and a publicly known seed value, a keyed-hash function generates a key chain; these key chains collectively make a key pool. As dynamic network topology is native to WSNs, the proposed scheme allows dynamic addition and removal of nodes. This paper also reports the implementation and the performance of the proposed scheme on Crossbow’s MicaZ motes running TinyOS. The results indicate that the proposed scheme can be applied efficiently in resource-constrained sensor networks. We evaluate the computation and storage costs of two keyed-hash algorithms for key chain generation, HMAC-SHA1 and HMAC-MD5.

Network resource management mechanisms in SDN enabled WSNs: A comprehensive review

Wireless technologies usually have very limited computing, memory, and battery power that require the optimal management of network resources to increase network performance. The optimization of these network resources provides an efficient network topology, traffic control, routing, and data aggregation. This study presents a qualitative and quantitative investigation to evaluate the efficient network resource management mechanisms for software defined wireless sensor networks (SDN-enabled WSNs) from the beginning of network design to reliable data delivery. In this paper, a taxonomy of network resource management research studies is proposed. A detailed analysis of SDN-enabled WSNs architecture, SDN controllers, topology discovery, routing approaches, flow rules installation, and data aggregation is also discussed. Furthermore, the comparative analysis of resource provisioning methods along with various simulation tools is presented. Moreover, this review outlines open research challenges and prospective future directions for network resource management in SDN-enabled WSNs.     

无线传感网络中安全密钥管理机制

Recent advancements in wireless communication and microchip techniques have accelerated the development of wireless sensor networks (WSN). Key management in WSN is a critical and challenging problem because of the inner characteristics of sensor networks: deployed in hostile environments, limited resource and ad hoc nature. This paper investigates the constraints and special requirements of key management in sensor network environment, and some basic evaluation metrics are introduced. The key pre-distribution scheme is thought as the most suitable solution for key management problem in wireless sensor networks. It can be classified into four classes: pure probabilistic key predistribution, polynomial-based, Blom′s matrix-based, and deterministic key predistribution schemes. In each class of methods, the related research papers are discussed based on the basic evaluation metrics. Finally, the possible research directions in key management are discussed.     

基于业务区分的无线多媒体传感器网络QoS体系结构

无线多媒体传感器网络（WMSNs）的网络服务质量（QoS）一直是人们关心的核心问题,然而目前WMSNs的QoS保障研究主要针对单个协议层或特定应用场景,缺少系统性的QoS体系框架研究。结合无线传感器网络自身特点,利用图论对网络进行建模。在此基础上,提出一种三层可计算QoS指标体系,并根据各种应用不同QoS需求将应用分为四类,设计出一种基于业务区分的无线多媒体传感器网络QoS体系结构（DQoSAW）。以传输MPEG视频流为例对DQoSAW进行验证,实验结果表明DQoSAW能够显著改进WMSNs的整体性能。     

Data Gathering in Wireless Sensor Networks Via Regular Low Density Parity Check Matrix

A great challenge faced by wireless sensor networks (WSNs) is to reduce energy consumption of sensor nodes. Fortunately, the data gathering via random sensing can save energy of sensor nodes. Nevertheless, its randomness and density usually result in difficult implementations, high computation complexity and large storage spaces in practical settings. So the deterministic sparse sensing matrices are desired in some situations. However, it is difficult to guarantee the performance of deterministic sensing matrix by the acknowledged metrics. In this paper, we construct a class of deterministic sparse sensing matrices with statistical versions of restricted isometry property (StRIP) via regular low density parity check (RLDPC) matrices. The key idea of our construction is to achieve small mutual coherence of the matrices by confining the column weights of RLDPC matrices such that StRIP is satisfied. Besides, we prove that the constructed sensing matrices have the same scale of measurement numbers as the dense measurements. We also propose a data gathering method based on RLDPC matrix. Experimental results verify that the constructed sensing matrices have better reconstruction performance, compared to the Gaussian, Bernoulli, and CSLDPC matrices. And we also verify that the data gathering via RLDPC matrix can reduce energy consumption of WSNs.      

Mobility-assisted minimum connected cover in a wireless sensor network

All properties of mobile wireless sensor networks (MWSNs) are inherited from static wireless sensor networks (WSNs) and meanwhile have their own uniqueness and node mobility. Sensor nodes in these networks monitor different regions of an area of interest and collectively present a global overview of monitored activities. Since failure of a sensor node leads to loss of connectivity, it may cause a partitioning of the network. Adding mobility to WSNs can significantly increase the capability of the WSN by making it resilient to failures, reactive to events, and able to support disparate missions with a common set of sensor nodes. In this paper, we propose a new algorithm based on the divide-and-conquer approach, in which the whole region is divided into sub-regions and in each sub-region the minimum connected sensor cover set is selected through energy-aware selection method. Also, we propose a new technique for mobility assisted minimum connected sensor cover considering the network energy. We provide performance metrics to analyze the performance of our approach and the simulation results clearly indicate the benefits of our new approach in terms of energy consumption, communication complexity, and number of active nodes over existing algorithms.     

一种基于ID的传感器网络密钥管理方案

传感器网络中有必要使用加密技术对节点间的通信进行保护。基于传感器ID的密钥管理方案采用二元多项式,实现了包括密钥分配,密钥更新和对传感器被破坏的检测等功能,被破坏的密钥能够自动恢复,同时减少了对内存和计算能力的要求,更能适应传感网络的环境。     

无线传感器网络MAC协议研究进展

近年来, 无线传感器网络 (WSNs) 作为国内外一个新兴的研究方向, 吸引了许多研究者和机构的广泛关注. 无线传感器网络具有与传统无线网络不同的特点, 且与应用高度相关. 无线传感器网络主要的一个设计目标是有效地使用网络节点的受限资源 (能量、内存和计算能力), 以最大化网络的服务寿命. 传统网络的介质访问控制 (MAC) 协议, 并不能直接应用于无线传感器网络. 针对无线传感器网络的特点和应用背景, 研究人员提出了很多 MAC 协议. 本文通过分析无线传感器网络的特点, 讨论了影响 MAC 协议设计的有关问题, 着重研究和比较了当前一些重要的无线传感器网络 MAC 协议. 结果表明, 不存在一种适用于无线传感器网络应用的标准 MAC 协议, 好的 MAC 协议必须能在能量有效性和网络性能之间进行折中. 最后, 展望了无线传感器网络 MAC 协议的进一步研究策略和发展趋势.     

Trust-based security for wireless ad hoc and sensor networks

Wireless sensors networks are susceptible to a large number of security threats, and because of the communication, computation and delay constraints of most applications that run on top of these networks, traditional security mechanisms cannot be used. Trust and reputation have been recently suggested as an effective security mechanism for open environments such as the Internet, and considerable research has been done on modeling and managing trust and reputation. Using the trust and reputation management scheme to secure wireless sensor networks (WSNs) requires paying close attention to the incurred bandwidth and delay overhead, which have thus far been overlooked by most research work. In this paper, we propose a novel agent-based trust and reputation management scheme (ATRM) for wireless sensor networks. The objective of the scheme is to manage trust and reputation locally with minimal overhead in terms of extra messages and time delay. Throughout the entirety of this paper, we describe our scheme and prove its correctness. We will also present our extensive performance evaluation results, which clearly show that trust and reputation can be computed in wireless sensor networks with minimal overhead.     

无线传感器网络适应QoS机制的网络模型

基于无线传感器网络服务质量(QoS)的特点,提出了一个独立于具体算法的、在点和边上都可加权的有向图网络模型,并用数学定义描述了QoS参数间的关系及服从的函数约束,使用该网络模型分析QoS路由的数学约束集并提出QoS路由选择策略。     

基于NETCONF的WSN网络管理系统设计

无线传感器网络的网络管理是个崭新的研究领域。无线传感器网络自身的特点决定了其管理系统与传统的计算机网络管理系统有根本区别。但是,到目前为止,有关无线传感器网络管理系统的研究还较少。本文总结了相关研究,并基于NETCONF协议设计了WSN网络管理系统,包括信息模型、节点代理和WSN-NETCONF协议,为无线传感器网络管理系统的实现奠定了基础。     

基于安全连通性检测的随机密钥预分配方案

近年来,无线传感器网络的安全研究越来越受到关注,研究者们相继提出了许多解决方案。其中的随机密钥预分配方案基于概率模型,因此网络中可能存在着一些安全孤立节点,从而可能会降低整个网络的安全连通性。针对此问题,提出在节点布置比较稀疏的无线传感器网络的初始化阶段以及网络在运行过程中,定期对网络进行安全连通性检测,以发现网络中存在的安全孤立节点,然后增大这些孤立节点的通信半径,从而动态地调整网络中某个局部区域的安全连通性,以使得整个网络获得更高的安全连通性。     

基于Q学习的多Sink节点无线传感网路由机制研究

单Sink节点无线传感网存在部分关键区域节点能量消耗过快、路由选择算法单一及Sink节点失效的问题.多Sink节点无线传感网能有效解决上述问题,研究多Sink节点传感网的路由协议及其存在的不足,提出了一种基于Q学习的路由选择机制.利用该学习方法节点综合考虑各种环境因素,进行周期性的学习训练,优化路径选择,最后按照计算得...