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.     

有效的无线传感器网络密钥管理算法

密钥管理算法是无线传感器网络安全的一个重要组成部分.提出了一个新的密钥管理算法,它通过将已存储的密钥部分地转化为即使被攻击者截获也无影响的特殊信息,来获取更加良好的安全性能,但同时又不降低网络的连通性能.为了验证此算法的性能,给出仿真和与其它算法进行性能对比的例子,仿真结果显示这种算法具有更好的性能.     

有效的群组密钥自治愈管理方案

对无线传感器网络的自治愈群组密钥管理方案进行了研究.针对无线传感器网络群组通信信道不可靠、丢包率较高的无线通信环境现状,提出了一种具有撤销能力的群组密钥自治愈管理方案.该方案利用散列链的单向性和后续会话标志的不可知性实现了群组密钥的安全.通过会话密钥的历史冗余关联,使授权节点能够自动恢复丢失的群组会话密钥.安全及能量消耗分析表明,该方案不仅能保证无线传感器网络的通信安全,而且具有较低的通信开销和存储开销,适应于大规模的无线传感器网络.     

压缩感知在无线传感网络的应用综述

随着信息技术的发展,近些年压缩感知技术格外引人瞩目,在图像视频编码、雷达及微波辐射成像、气象卫星、图像加密、物联网等领域展现出强大的功能与发展前景。首先介绍了压缩感知在无线传感网络领域的发展及研究现状,然后从压缩感知仿真实验和实例、压缩感知的测量方案、压缩感知的解压缩方案、压缩感知在无线传感网络的具体应用四个方面阐明了压缩感知在无线传感网络领域的优势,最后对压缩感知的前景进行了展望。     

A survey of game-theoretic approaches in wireless sensor networks

Wireless sensor networks (WSNs) comprising of tiny, power-constrained nodes are gaining popularity due to their potential for use in a wide variety of environments like monitoring of environmental attributes, intrusion detection, and various military and civilian applications. While the sensing objectives of these environments are unique and application-dependent, a common performance criteria for wireless sensor networks is prolonging network lifetime while satisfying coverage and connectivity in the deployment region. Security is another important performance parameter in wireless sensor networks, where adverse and remote environments pose various kinds of threats to reliable network operation. In this paper, we look at the problems of security and energy efficiency and different formulations of these problems based on the approach of game theory. The potential applicability of WSNs to intruder detection environments also lends itself to game-theoretic formulation of these environments, where pursuit-evasion games provide a relevant framework to model detection, tracking and surveillance applications.The suitability of using game theory to study security and energy efficiency problems and pursuit-evasion scenarios using WSNs stems from the nature of strategic interactions between nodes. Approaches from game theory can be used to optimize node-level as well as network-wide performance by exploiting the distributed decision-making capabilities of WSNs. The use of game theory has proliferated, with a wide range of applications in wireless sensor networking. In the wake of this proliferation, we survey the use of game-theoretic approaches to formulate problems related to security and energy efficiency in wireless sensor networks.     

无线传感器网络密钥管理方案的研究

无线传感器网络(Wireless Sensor Networks,WSN)是由资源有限的传感器节点构成的无线网络,由于其本身资源方面存在的局限性和脆弱性,使其安全问题成为一大挑战。密钥管理作为安全机制的重要环节,始终是无线传感器网络安全领域的研究热点。本文在研究无线传感器网络安全问题的基础上,对具有代表性的密钥管理方案进行了深入研究,全面分析其利弊以及适应性问题,最后提出了进一步的研究设想。     

Simple,extensible and flexible random key predistribution schemes for wireless sensor networks using reusable key pools

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.     

Pair-wise path key establishment in wireless sensor networks

When sensor networks deployed in unattended and hostile environments, for securing communication between sensors, secret keys must be established between them. Many key establishment schemes have been proposed for large scale sensor networks. In these schemes, each sensor shares a secret key with its neighbors via preinstalled keys. But it may occur that two end nodes which do not share a key with each other could use a secure path to share a secret key between them. However during the transmission of the secret key, the secret key will be revealed to each node along the secure path. Several researchers proposed a multi-path key establishment to prevent a few compromised sensors from knowing the secret key, but it is vulnerable to stop forwarding or Byzantine attacks. To counter these attacks, we propose a hop by hop authentication scheme for path key establishment to prevent Byzantine attacks. Compared to conventional protocols, our proposed scheme can mitigate the impact of malicious nodes from doing a Byzantine attack and sensor nodes can identify the malicious nodes. In addition, our scheme can save energy since it can detect and filter false data not beyond two hops.     

A scalable key management and clustering scheme for wireless ad hoc and sensor networks

This paper describes a scalable key management and clustering scheme for secure group communications in ad hoc and sensor networks. The scalability problem is solved by partitioning the communicating devices into subgroups, with a leader in each subgroup, and further organizing the subgroups into hierarchies. Each level of the hierarchy is called a tier or layer. Key generation, distribution, and actual data transmissions follow the hierarchy. The distributed, efficient clustering approach (DECA) provides robust clustering to form subgroups, and analytical and simulation results demonstrate that DECA is energy-efficient and resilient against node mobility. Comparing with most other schemes, our approach is extremely scalable and efficient, provides more security guarantees, and is selective, adaptive and robust.     

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.     

A survey on service-oriented middleware for wireless sensor networks

Wireless sensor networks (WSN) are used for many applications such as environmental monitoring, infrastructure security, healthcare applications, and traffic control. The design and development of such applications must address many challenges dictated by WSN characteristics on one hand and the targeted applications on the other. One of the emerging approaches used for relaxing these challenges is using service-oriented middleware (SOM). Service-oriented computing, in general, aims to make services available and easily accessible through standardized models and protocols without having to worry about the underlying infrastructures, development models, or implementation details. SOM could play an important role in facilitating the design, development, and implementation of service-oriented systems. This will help achieve interoperability, loose coupling, and heterogeneity support. Furthermore, SOM approaches will provision non-functional requirements like scalability, reliability, flexibility, and Quality of Service (QoS) assurance. This paper surveys the current work in SOM and the trends and challenges to be addressed when designing and developing these solutions for WSN.     

Practical data compression in wireless sensor networks: A survey

Power consumption is a critical problem affecting the lifetime of wireless sensor networks. A number of techniques have been proposed to solve this issue, such as energy-efficient medium access control or routing protocols. Among those proposed techniques, the data compression scheme is one that can be used to reduce transmitted data over wireless channels. This technique leads to a reduction in the required inter-node communication, which is the main power consumer in wireless sensor networks. In this article, a comprehensive review of existing data compression approaches in wireless sensor networks is provided. First, suitable sets of criteria are defined to classify existing techniques as well as to determine what practical data compression in wireless sensor networks should be. Next, the details of each classified compression category are described. Finally, their performance, open issues, limitations and suitable applications are analyzed and compared based on the criteria of practical data compression in wireless sensor networks.     

A survey on routing techniques in underwater wireless sensor networks

Underwater Wireless Sensor Networks (UWSNs) are finding different applications for offshore exploration and ocean monitoring. In most of these applications, the network consists of significant number of sensor nodes deployed at different depths throughout the area of interest. The sensor nodes located at the sea bed cannot communicate directly with the nodes near the surface level; they require multi-hop communication assisted by appropriate routing scheme. However, this appropriateness depends not only on network resources and application requirements but also on environmental constraints. All these factors provide a platform where a resource-aware routing strategy plays a vital role to fulfill the different application requirements with dynamic environmental conditions. Realizing the fact, significant attention has been given to construct a reliable scheme, and many routing protocols have been proposed in order to provide an efficient route discovery between the sources and the sink. In this paper, we present a review and comparison of different algorithms, proposed recently in order to fulfill this requirement. The main purpose of this study is to address the issues like data forwarding, deployment and localization in UWSNs under different conditions. Later on, all of these are classified into different groups according to their characteristics and functionalities.     

A novel key pre-distribution scheme for wireless distributed sensor networks

A novel key pre-distribution scheme for sensor networks is proposed, which enables sensor nodes to communicate securely with each other using cryptographic techniques. The approach uses the rational normal curves in the projective space with the dimension n over the finite field F q . Both secure connectivity and resilience of the resulting sensor networks are analyzed. By choosing the parameters q and n properly, this key pre-distribution scheme has some advantages over the previous known schemes. In addit...     

Dynamic power management in wireless sensor networks

We propose an OS-directed power management technique to improve the energy efficiency of sensor nodes. Dynamic power management (DPM) is an effective tool in reducing system power consumption without significantly degrading performance. The basic idea is to shut down devices when not needed and wake them up when necessary. DPM, in general, is not a trivial problem. If the energy and performance overheads in sleep-state transition were negligible, then a simple greedy algorithm that makes the system enter the deepest sleep state when idling would be perfect. However, in reality, sleep-state transitioning has the overhead of storing processor state and turning off power. Waking up also takes a finite amount of time. Therefore, implementing the correct policy for sleep-state transitioning is critical for DPM success. It is argued that power-aware methodology uses an embedded microoperating system to reduce node energy consumption by exploiting both sleep state and active power management     

Approximation schemes for load balanced clustering in wireless sensor networks

Clustering sensor nodes is an efficient technique to improve scalability and life time of a wireless sensor network (WSN). However, in a cluster based WSN, the leaders (cluster heads) consume more energy due to some extra load for various activities such as data collection, data aggregation, and communication of the aggregated data to the base station. Therefore, balancing the load of the cluster heads is a crucial issue for the long run operation of the WSNs. In this paper, we first present a load balanced clustering scheme for wireless sensor networks. We show that the algorithm runs in O(nlogn) time for n sensor nodes. We prove that the algorithm is optimal for the case in which the sensor nodes have equal load. We also show that it is a polynomial time 2-approximation algorithm for the general case, i.e., when the sensor nodes have variable load. We finally improve this algorithm and propose a 1.5-approximation algorithm for the general case. The experimental results show the efficiency of the proposed algorithm in terms of the load balancing of the cluster heads, execution time, and the network life.     

基于标识的无线传感器网络密钥预分配方案

密钥分配是无线传感器网络中极具挑战性的安全问题之一.为了实现无线传感器网络中的安全通讯,需要对传感器结点间传递的信息进行加密.由于受每个传感器结点自身资源的限制,传统网络中使用的密钥分配策略,并不适用于无线传感器网络.提出了基于结点ID的密钥预分配方案,实现了非对称和对称密钥体制、分布式和集中式密钥管理的结合,有效地提高了传感器网络其安全性和连通性.