A secure channel code‐based scheme for privacy preserving data aggregation in wireless sensor networks

Data aggregation is an efficient method to reduce the energy consumption in wireless sensor networks (WSNs). However, data aggregation schemes pose challenges in ensuring data privacy in WSN because traditional encryption schemes cannot support data aggregation. Homomorphic encryption schemes are promising techniques to provide end to end data privacy in WSN. Data reliability is another main issue in WSN due to the errors introduced by communication channels. In this paper, a symmetric additive homomorphic encryption scheme based on Rao‐Nam scheme is proposed to provide data confidentiality during aggregation in WSN. This scheme also possess the capability to correct errors present in the aggregated data. The required security levels can be achieved in the proposed scheme through channel decoding problem by embedding security in encoding matrix and error vector. The error vectors are carefully designed so that the randomness properties are preserved while homomorphically combining the data from different sensor nodes. Extensive cryptanalysis shows that the proposed scheme is secure against all attacks reported against private‐key encryption schemes based on error correcting codes. The performance of the encryption scheme is compared with the related schemes, and the results show that the proposed encryption scheme outperforms the existing schemes.     

Efficient and distributed access control for sensor networks

Sensor networks are a promising computing paradigm for monitoring the physical environment and providing observations for various uses. In hostile situations, it is critical to enforce network access control to ensure the integrity, availability, and at times confidentiality of the sensor data. A natural idea is to adopt a centralized design where every access request from users goes through a trusted base station. However, this idea is not practical due to the cost and efficiency issues. This paper proposes two efficient and distributed access control methods, uni-access query and multi-access query. The uni-access query uses only symmetric cryptographic operations; it allows (1) a user to directly access the data on any sensor node in the network without going through the base station and (2) a sensor to protect its data so that only authorized users can access. Compared to existing solutions, this scheme is much more flexible and efficient. In addition, this scheme can also support privilege delegation, which allows a user to delegate all or part of its privilege to others without using the base station. The multi-access query applies public key cryptography to provide an additional feature, which allows a user to access the data on many sensor nodes via a single query. Compared to existing solutions that require a user to send at least one request for every sensor node to be queried, the multi-access query reduces the communication overhead significantly. The theoretical analysis and simulation evaluation show that the proposed schemes are practical for access control in sensor networks.     

Adaptive and dual data-communication trust scheme for clustered wireless sensor networks

In wireless sensor networks, trust management schemes are designed to preserve them against misbehavior of malicious sensor nodes. These schemes observe the behavior of nodes, check their conformity to what is expected, compute and assign them trust values, and avoid any interaction with untrustworthy nodes. In this paper, we introduce Adaptive and dual Data-Communication Trust scheme (ADCT) for clustered wireless sensor networks to effectively deal with untrustworthy nodes. Unlike prior works, we propose an adaptive trust function to assess the direct trust between nodes according to the application’s requirement in terms of trust severity. We also consider data trust to cope with untrustworthy nodes during the data collection despite their communication capabilities. Moreover, we use the duality data-communication trust to deal with untrustworthy recommendations when building cluster-member’s feedback at the cluster-head level. Theoretical analysis and simulation show that the trust mechanism presented in this paper provides a better cooperation with the same or even lower communication overhead compared to the latest trust management schemes proposed for clustered wireless sensor networks.     

Energy-Efficient Route Selection Strategies for Wireless Sensor Networks

Wireless Sensor Networks (WSNs) facilitate monitoring and controlling of physical environments from remote locations with the best possible accuracy. Sensor networks are wireless networks consisting of groups of small, inexpensive nodes, which collect and disseminate critical data. Also, sensor nodes have various energy and computational constraints due to their inexpensive nature and ad hoc method of deployment. Considerable research has been focused on overcoming these deficiencies through low-energy consumption schemes. Among other factors, the route selection strategy may have an impact on the sensors lifetime, and following on the network lifetime. In this paper, we study various route selection strategies that aim at prolonging the lifetime of WSNs. Also, a new route selection scheme is proposed, that increases further the network lifetime. The performance of these schemes is analyzed through simulation.     

FBDR-Fuzzy Based DDoS Attack Detection and Recovery Mechanism for Wireless Sensor Networks

Wireless sensor networks (WSN) is considered as one of the exploring technology for its deployment of the massive number of dedicated sensor nodes which sense the environment and collect the data. The collected data are sent to the sink node through the intermediate nodes. Since the sensors node data are exposed to the internet, there is a possibility of vulnerability in the WSN. The common attack that affects most of the sensor nodes is the Distributed Denial of Services (DDoS) attack. This paper aims to identify the DDoS (Flooding) attack quickly and to recover the data of sensor nodes using the fuzzy logic mechanism. Fuzzy based DDoS attack Detection and Recovery mechanism (FBDR) uses type 1 fuzzy logic to detect the occurrence of DDoS attack in a node. Similarly fuzzy- type 2 is used for the recovery of data from the DDoS attack. Both the type 1 fuzzy-based rule and type 2 fuzzy-based rule perform well in terms of identifying the DDoS attack and recover the data under attack. It also helps to reduce the energy consumption of each node and improves the lifetime of the network. The proposed FBDR scheme is also compared with other related existing schemes. The proposed method saves energy usage by up to 20% compared with the related schemes. The experimental results represent that the FBDR method works better than other similar schemes.

     

A Novel Energy Efficient and Lifetime Maximization Routing Protocol in Wireless Sensor Networks

The energy consumption is a key design criterion for the routing protocols in wireless sensor networks (WSN). Some of the conventional single path routing schemes may not be optimal to maximize the network lifetime and connectivity. Thus, multipath routing schemes is an optimal alternative to extend the lifetime of WSN. Multipath routing schemes distribute the traffic across multiple paths instead of routing all the traffic along a single path. In this paper, we propose a multipath Energy-Efficient data Routing Protocol for wireless sensor networks (EERP). The latter keeps a set of good paths and chooses one based on the node state and the cost function of this path. In EERP, each node has a number of neighbours through which it can route packets to the base station. A node bases its routing decision on two metrics: state and cost function. It searches its Neighbours Information Table for all its neighbours concerned with minimum cost function. Simulation results show that our EERP protocol minimizes and balances the energy consumption well among all sensor nodes and achieves an obvious improvement on the network lifetime.     

Dynamic clustering of distributed source coding in wireless sensor networks

There are correlations of data in adjacent sensor nodes in wireless sensor networks (WSNs). Distributed source coding (DSC) is an idea to improve the energy efficiency in WSNs by compressing the sensor data with correlations to others. When utilizing the DSC, the network architecture that, deciding which nodes to transmit the side information and which nodes to compress according to the correlations, influences the compression efficiency significantly. Comparing with former schemes that have no adaptations, a dynamic clustering scheme is presented in this article, with which the network is partitioned to clusters adaptive to the topology and the degree of correlations. The simulation indicates that the proposed scheme has higher efficiency than static clustering schemes.     

基于Bayes序贯估计的无线传感器网络数据融合算法

移动代理被认为是无线传感器网络中解决数据融合的有效方法,但代理访问节点的次序以及总数对算法有较大影响,为此该文提出一种基于Bayes序贯估计的移动代理数据融合算法.该算法通过构造特定数据结构的报文,在多跳环境中由Bayes序贯估计调整梯度向量,据此动态决定移动代理的访问路径,使移动代理有选择地在传感器节点之间移动,且在节点处由移动代理对数据进行融合,将多余的感知数据剔除,而不是把原始数据传输到Sink节点。理论分析和模拟实验表明,该算法有较小的能量消耗和传输延时。     

Dynamic key management in sensor networks

Numerous key management schemes have been proposed for sensor networks. The objective of key management is to dynamically establish and maintain secure channels among communicating nodes. Desired features of key management in sensor networks include energy awareness, localized impact of attacks, and scaling to a large number of nodes. A primary challenge is managing the trade-off between providing acceptable levels of security and conserving scarce resources, in particular energy, needed for network operations. Many schemes, referred to as static schemes, have adopted the principle of key predistribution with the underlying assumption of a relatively static short-lived network (node replenishments are rare, and keys outlive the network). An emerging class of schemes, dynamic key management schemes, assumes long-lived networks with more frequent addition of new nodes, thus requiring network rekeying for sustained security and survivability. In this article we present a classification of key management schemes in sensor networks delineating their similarities and differences. We also describe a novel dynamic key management scheme, localized combinatorial keying (LOCK), and compare its security and performance with a representative static key management scheme. Finally, we outline future research directions.     

Predistribution and local collaboration-based group rekeying for wireless sensor networks

When a sensor network is deployed in a hostile environment, an adversary may launch such attacks as eavesdropping the communications and compromising sensor nodes. Using the compromised nodes, he may inject false sensing reports or modify the reports sent by other nodes. To defend against these attacks, researchers have proposed symmetric group key-based schemes. In these schemes, however, if a large number of nodes are compromised, many (sub)group keys will be revealed. This greatly endangers the filtering schemes, making them very ineffective or even useless. To address this problem, we propose a family of predistribution and local collaboration-based group rekeying (PCGR) schemes, which update the compromised group keys to prevent the compromised nodes from understanding the communications between noncompromised nodes or injecting false data. These schemes are designed based on a simple while controversial idea – preload future group keys into sensor nodes before their deployment. To protect the preloaded keys from being disclosed by compromised nodes, we propose a novel technique that requires neighboring nodes to collaborate to derive the future group keys. To the best of our knowledge, our schemes are the first set of distributed group rekeying schemes for sensor networks without involving online key servers. Extensive analysis and simulations are conducted to evaluate the proposed schemes, and the results show that the proposed schemes can achieve a good level of security, outperform several previous group rekeying schemes, and significantly improve the effectiveness of false data filtering.     

Integrated Energy and Trust-Based Semi-Markov Prediction for Lifetime Maximization in Wireless Sensor Networks

Many of today’s computing and communication models are distributed systems that are composed of autonomous computational entities that communicate with each other, usually by passing messages. Distributed systems encompass a variety of applications and wireless sensor networks (WSN) is an important application of it. The tiny, multiple functionality and low power sensor nodes are considered to be interconnected in the WSN for efficient process of aggregating and transmitting the data to the base station. The clustering-based schemes of sensor networks are capable of organizing the network through the utilization of a specifically designated node termed as the cluster head for the objective of energy conservation and data aggregation. Further, the cluster head is responsible for conveying potential information collected by the cluster member nodes and aggregate them before transmitting it to the base station. In this paper, a Reliable Cluster Head Selection Technique using Integrated Energy and Trust-based Semi-Markov Prediction (RCHST-IETSMP) is proposed with the view to extend the lifetime of sensor networks. This proposed RCHST-IETSMP incorporated two significant parameters associated with energy and trust for effective selection of cluster head facilitated through the merits of Semi-Markoc prediction integrated with the Hyper Erlang distribution process. The simulation results of the proposed RCHST-IETSMP scheme is proving to be efficient in upholding the residual energy of the network and the throughput to a maximum level of 23% and 19% predominant to the trust and energy-based clustering schemes considered for investigation.

     

Parameterized key assignment for confidential communication in wireless networks

Predistribution of cryptographic keys is a widely used approach for establishing secure communication between severely resource-constrained nodes with limited or no access to network infrastructure. Many proposed key predistribution schemes make the implicit assumption that message contents need not be kept private from nodes other than the intended recipient. Messages in such schemes are not guaranteed to be confidential—they may be read by nodes within the network other than the intended recipient. In this paper, we present TASK—a symmetric key predistribution scheme that enables secure and confidential communication within wireless networks. TASK distributes keys by generating and reinforcing a series of template key assignment instances. It is parameterized, which allows it to make use of key storage capacities that other recently proposed schemes cannot. We show, through analysis and simulation, that TASK can achieve a level of security superior to that of two recently proposed schemes that also provide confidentiality. We also demonstrate that the techniques used in TASK (namely parameterization, templatization, and selective reinforcement) can be applied to other key assignment schemes for star or bipartite networks.     

Hybrid trust and reputation management for sensor networks

Wireless sensor networks are characterised by the distributed nature of their operation and the resource constraints on the nodes. Trust management schemes that are targeted at sensor networks need to be lightweight in terms of computational and communication requirements, yet powerful in terms of flexibility in managing trust between nodes of heterogeneous deployments. In this paper, we propose a trust management model that can uniformly support the needs of nodes with highly diverse network roles and capabilities, by exploiting the pre-deployment knowledge on the network topology and the information flows, and by allowing for flexibility in the trust establishment process. The model is hybrid, combining aspects from certificate-based and behaviour-based approaches on trust establishment on common evaluation processes and metrics. It enables controlled trust evolution based on network pre-configuration, and controlled trust revocation through the propagation of behaviour evaluation results made available by supervision networks. The proposed model and trust metrics have been validated through simulation. The results and analysis demonstrate its effectiveness in managing the trust relationships between nodes and clusters, while distributing the computational cost of trust evaluation operations.     

基于博弈理论的无线传感器网络分布式节能路由算法

为了有效解决无线传感器网络路由节能问题,该文提出适合无线传感器网络的节能路由算法。在引入博弈理论概念建立网络模型的基础上,通过对于以往传感器网络簇首选择方法的研究,设计了一种基于博弈论的,兼顾节点剩余能量及簇首分布的节能路由DEER(DistributedEnergy-EconomicalRouting),大大节省了分布式决策网络协议的能量损耗。仿真证明了该方法在无线传感器网络中,能够有效地平衡网络负载,节省节点能量,延长网络寿命。     

Accelerating signature-based broadcast authentication for wireless sensor networks

In wireless sensor networks (WSNs), broadcast authentication is a crucial security mechanism that allows a multitude of legitimate users to join in and disseminate messages into the networks in a dynamic and authenticated way. During the past few years, several public-key based multi-user broadcast authentication schemes have been proposed to achieve immediate authentication and to address the security vulnerability intrinsic to μTESLA-like schemes. Unfortunately, the relatively slow signature verification in signature-based broadcast authentication has also incurred a series of problems such as high energy consumption and long verification delay. In this contribution, we propose an efficient technique to accelerate the signature verification in WSNs through the cooperation among sensor nodes. By allowing some sensor nodes to release the intermediate computation results to their neighbors during the signature verification, a large number of sensor nodes can accelerate their signature verification process significantly. When applying our faster signature verification technique to the broadcast authentication in a 4 × 4 grid-based WSN, a quantitative performance analysis shows that our scheme needs 17.7-34.5% less energy and runs about 50% faster than the traditional signature verification method. The efficiency of the proposed technique has been tested through an experimental study on a network of MICAz motes.     

Routing Correlated Data in Wireless Sensor Networks: A Survey

Sensory data gathered from sensor nodes in physical proximity tend to exhibit strong correlation. To minimize such redundancy and hence curtail the load in wireless sensor networks with a goal to conserve energy, effective in-network fusion schemes have been extensively proposed in the literature. To this end, routing schemes supporting data fusion are extremely important as they dictate where and when sensory data streams shall intersect with each other and thus fusion will be performed. In this article we briefly articulate this problem and classify recently proposed routing schemes supporting data fusion in wireless sensor networks into three categories: routing-driven, coding-driven, and fusion-driven. We also give an overview of various algorithms in each category by summarizing their design approaches, benefits, and drawbacks.     

查询驱动模式下两层传感器网络Top-k查询汇聚算法研究

在两层传感器网络中,查询驱动模式是将查询请求在下层传感器网络层进行分布式处理的一种查询处理模式.在传感器节点产生数据的频率较高而用户发出查询请求的频率较低的情况下,查询驱动模式能够大大减少数据传输量,降低节点的能量消耗.在这种模式下,如何有效支持局部区域性Top-k查询是一个很有挑战性的问题.针对这一问题,本文首先构造了一种新的数据汇聚树(DAT),接着在DAT的基础上提出了一种支持区域性Top-k查询的数据汇聚方案.理论分析和仿真实验表明,与已有算法相比,本文提出的方案更加高效.     

SENDROM: Sensor networks for disaster relief operations management

SENDROM is a new sensor network architecture to manage the rescue operations after large scale disasters. This architecture mainly consists of sensor nodes deployed prior to a disaster and central nodes that can query sensor nodes. Central nodes are stored nearby the emergency operation centers and airports before a disaster. Following a disaster rescue teams are assigned one mobile central node and guided to a region based on the data in the SENDROM database. This paper explains the SENDROM architecture as well as our new task and data dissemination, localization of a detected person, and end-to-end reliable event transfer schemes introduced for SENDROM. Then it evaluates the performance of these schemes analytically and through simulation.     

Energy-Efficient Routing Protocol for Wireless Sensor Networks with Static Clustering and Dynamic Structure

Data gathering is an essential operation in wireless sensor networks. For periodic data gathering applications, each sensor node has data that must be sent to a distant base station in a round of communication. Due to the limited battery power of sensor nodes, each sensor node transmitting its sensed data to the base station directly significantly consumes its energy. This work presents a hierarchical ring-based data gathering (HRDG) scheme for dense wireless sensor networks. A hierarchical grid structure is constructed, and only some sensor nodes are elected as grid heads for gathering data, subsequently reducing the total energy consumption per round. Grid heads are then organized into hierarchical rings to decrease the transmission delay of a round. The proposed HRDG scheme focuses on reducing the energy × delay cost in a round of data gathering. Moreover, the energy × delay cost of HRDG is analyzed. Simulation results indicate that the proposed HRDG scheme outperforms other data gathering schemes in terms of the number of rounds, the energy × delay cost and coverage ratio.     

基于拨备满足模型的无线传感网节点覆盖算法

针对无线传感网预覆盖过程中存在覆盖盲区以及数据频繁重传而导致的节点覆盖抑制现象,提出了一种基于拨备满足模型的无线传感网网络覆盖算法。设计一种新的无线传感网节点覆盖模型,并构建覆盖指数、覆盖强度、覆盖均衡评估系数等评估维度,快速评估节点覆盖质量。再计算覆盖均衡评估系数,并采用拨备模型优化覆盖质量,确定覆盖性能优越的备用工作节点。随后,基于覆盖相似性原则评估工作节点覆盖性能,设计了节点首次覆盖评估方法,按节点移动路径依次评估覆盖指数统计均值,并根据目标节点进入覆盖区域的先后,逐次激活性能最佳的工作节点进行监测。仿真实验表明：与当前无线传感网常数节点覆盖方案相比,所提方案具有更高的网络覆盖率、更短的覆盖启动时间和更少的工作节点数目。