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.     

无线传感器网络中基于移动代理的自适应数据融合路由算法

该文提出在无线传感器网络中基于移动代理的自适应数据融合路由(AFMR)算法,解决移动代理如何以能量有效的方式融合、收集相关性数据的问题。该算法综合考虑了移动代理在路由过程中传输能量和融合能量的消耗,并根据数据融合算法的能量开销和节能增益,对移动代理迁移到各节点时是否执行数据融合操作进行自适应调整,以达到在各种不同的应用场景中优化移动代理能量开销的目的。通过仿真验证了在无线传感器网络的各种相关性数据收集的应用环境中,AFMR算法在节省能量方面比现有TSP和FMR的移动代理路由算法更加有效。     

数据融合技术在无线传感器网络中的应用

为了减少数据通信量,提高测量结果的准确度和网络的生存周期,在基于簇结构的无线网络环境中,分布式数据融合技术被应用于无线传感器网络.针对特定的应用,提出了一种简单的基于模糊数学、G校验方法的融合算法及其应用步骤.通过简单的室温监测实例说明了此方法的有效性.     

基于遗传算法的无线传感器网络自适应数据融合路由算法

针对移动代理以能量有效的方式收集相关性数据的问题,该文提出了一种新的基于遗传算法的自适应数据融合路由算法。算法选择移动代理路由时,根据数据传输和融合能量开销及节能增益,对移动代理迁移到每个传感器节点是否进行数据融合做自适应选择,以在信息收集过程中提高网络能量效率。仿真结果表明自适应数据融合路由算法的能量效率优于完全数据融合路由算法和最邻近启发式算法。     

D2F: A Routing Protocol for Distributed Data Fusion in Wireless Sensor Networks

Data fusion can be distributed into network and executed on network nodes, to reduce data from redundant sensor nodes, to fuse the information from complementary sensor nodes and to get the complete view from cooperative nodes. Consequently only the inference of interest is sent to end user. This distributed data fusion can significantly reduce the data transmission cost and there is no need for a powerful centralized node to process the collected information. However, to achieve the advantages of distributed data fusion and better utilization of network resources, each fusion function needs to be performed at particular network node for minimizing energy cost of data fusion application, both data transmission cost and computation cost. In this paper, distributed data fusion routing (D2F) is proposed, which is designed for deploying distributed data fusion application in wireless sensor networks. D2F can find the optimal route path and fusion placements for a given data fusion tree, which obtains the optimal energy consumption for in-network data fusion. D2F can also handle different link failures and maintain the optimality of energy cost of data fusion by adapting to the dynamic change of network.     

无线传感器网络数据融合研究

数据融合是无线传感器网络的一个研究热点,能减少传感器节点间传输的数据量和能量消耗,从而明显提高网络即时性能,延长网络生命周期,减小时间延迟。文章首先介绍了无线传感器网络中数据融合的必要性,然后介绍了数据融合的原理、层次、结构,重点介绍了多传感器数据融合的三个层次,并比较了三个融合层次的优缺点,最后对数据融合的发展趋势进行了展望。     

Battery-Aware Routing for Streaming Data Transmissions in Wireless Sensor Networks

Recent technological advances have made it possible to support long lifetime and large volume streaming data transmissions in sensor networks. A major challenge is to maximize the lifetime of battery-powered sensors to support such transmissions. Battery, as the power provider of the sensors, therefore emerges as the key factor for achieving high performance in such applications. Recent study in battery technology reveals that the behavior of battery discharging is more complex than we used to think. Battery powered sensors might waste a huge amount of energy if we do not carefully schedule and budget their discharging. In this paper we study the effect of battery behavior on routing for streaming data transmissions in wireless sensor networks. We first give an on-line computable energy model to mathematically model battery discharge behavior. We show that the model can capture and describe battery behavior accurately at low computational complexity and thus is suitable for on-line battery capacity computation. Based on this battery model we then present a battery-aware routing (BAR) protocol to schedule the routing in wireless sensor networks. The routing protocol is sensitive to the battery status of routing nodes and avoids energy loss. We use the battery data from actual sensors to evaluate the performance of our protocol. The results show that the battery-aware protocol proposed in this paper performs well and can save a significant amount of energy compared to existing routing protocols for streaming data transmissions. Network lifetime is also prolonged with maximum data throughput. As far as we know, this is the first work considering battery-awareness with an accurate analytical on-line computable battery model in sensor network routing. We believe the battery model can be used to explore other energy efficient schemes for wireless networks as well.     

无线传感器网络路由协议

本文在简要地介绍了无线传感器网络体系结构的基础上,研究了当前主要的几种无线传感器网络路由协议模型,并进行了比较分析.     

Data Aggregation Routing for Rechargeable Wireless Sensor Networks in Forest Monitoring

In rechargeable wireless sensor networks (r-WSNs), higher data transmitted efficiency is required because sensor have to operate in a very low duty cycle owing to sporadic availability of energy. In r-WSNs, Data collected by many sensors is based on common phenomena, and hence there is a high probability that this data has some redundancy. In this work, we address the problem of jointly optimizing data aggregation and routing so that the network workload can be maximized. Establish the relationship model between data aggregation rate and throughput, so that the balanced was set up between the data aggregation rate and maximum network data traffic. Through the use of optimal candidate sample allocation, the algorithm can coverage efficiently and can make the maximum data aggregation rate flow to the network while maximizing network workload. Simulations are carried out to show that the proposed algorithm can significantly improve workload.     

Using Information Fusion to Assist Data Dissemination in Wireless Sensor Networks

Data dissemination is a fundamental task in wireless sensor networks. Because of the radio range limitation and energy consumption constraint, sensor data is commonly disseminated in a multihop fashion (flat networks) through a tree topology. However, to the best of our knowledge none of the current solutions deals with the moment when the dissemination topology needs to be rebuilt. This work addresses such a problem introducing the use of information fusion mechanisms, where the traffic is handled as a signal that is filtered and translated into evidences that indicate the likelihood of critical failures occurrence. These evidences are combined by a Dempster-Shafer engine to detect the need for a topology reconstruction. Our solution, called Topology Rebuilding Algorithm (TRA), is evaluated through a set of simulations. In the experiments, TRA showed to be efficient in avoiding unnecessary topology reconstructions. Compared to the periodic rebuilding, in some cases, TRA could reduce the traffic overhead in nearly 35% of the traffic produced by the periodicu rebuilding.     

无线传感器网络数据融合安全机制研究

由于WSNs本身资源方面存在的局限性和脆弱性,使其安全问题成为一大挑战。随着WSNs向大范围配置的方向发展,其安全问题越来越重要。围绕WSNs的安全需求,结合WSNs的分层网络结构,研究了其各层易遭受的攻击及防御对策。本文分析了基于明文的数据融合安全机制和基于密文的数据融合安全机制,并在此基础上提出了相应的解决思路。     

Opportunistic Routing Protocols in Wireless Sensor Networks

Wireless Personal Communications - Research on wireless sensor network (WSN) has mainly involved the use of a portable and limited power source, namely batteries, to power the sensors. Without...     

Directional Controlled Fusion in Wireless Sensor Networks

Though data redundancy can be eliminated at aggregation point to reduce the amount of sensory data transmission, it introduces new challenges due to multiple flows competing for the limited bandwidth in the vicinity of the aggregation point. On the other hand, waiting for multiple flows to arrive at a centralized node for aggregation not only uses precious memory to store these flows but also increases the delays of sensory data delivery. While traditional aggregation schemes can be characterized as “multipath converging,” this paper proposes the notation of “multipath expanding” to solve the above problems by jointly considering data fusion and load balancing. We propose a novel directional-controlled fusion (DCF) scheme, consisting of two key algorithms termed as directional control and multipath fusion. By adjusting a key parameter named multipath fusion factor in DCF, the trade-offs between multipath-converging and multipath-expanding can be easily achieved, in order to satisfy specific QoS requirements from various applications. We present simulations that verify the effectiveness of the proposed scheme.

Greedy Routing with Anti-Void Traversal for Wireless Sensor Networks

The unreachability problem (i.e., the so-called void problem) that exists in the greedy routing algorithms has been studied for the wireless sensor networks. Some of the current research work cannot fully resolve the void problem, while there exist other schemes that can guarantee the delivery of packets with the excessive consumption of control overheads. In this paper, a greedy anti-void routing (GAR) protocol is proposed to solve the void problem with increased routing efficiency by exploiting the boundary finding technique for the unit disk graph (UDG). The proposed rolling-ball UDG boundary traversal (RUT) is employed to completely guarantee the delivery of packets from the source to the destination node under the UDG network. The boundary map (BM) and the indirect map searching (IMS) scheme are proposed as efficient algorithms for the realization of the RUT technique. Moreover, the hop count reduction (HCR) scheme is utilized as a short-cutting technique to reduce the routing hops by listening to the neighbor's traffic, while the intersection navigation (IN) mechanism is proposed to obtain the best rolling direction for boundary traversal with the adoption of shortest path criterion. In order to maintain the network requirement of the proposed RUT scheme under the non-UDG networks, the partial UDG construction (PUC) mechanism is proposed to transform the non-UDG into UDG setting for a portion of nodes that facilitate boundary traversal. These three schemes are incorporated within the GAR protocol to further enhance the routing performance with reduced communication overhead. The proofs of correctness for the GAR scheme are also given in this paper. Comparing with the existing localized routing algorithms, the simulation results show that the proposed GAR-based protocols can provide better routing efficiency.     

无线传感器网络中基于数据融合树的压缩感知算法

针对无线传感器网络能量有限等特点,将路由策略考虑到投影矩阵的设计中,该文提出了基于数据融合树的压缩感知算法(Compressed Sensing algorithm based on Data Fusion Tree,CS-DFT)。该算法采用稀疏投影矩阵最小化通信消耗,在生成数据融合树的同时减小投影矩阵与稀疏基之间的相关度以保证数据的重构质量。仿真结果表明,该文提出的算法不仅在重构质量和能量消耗之间做到了很好的平衡,同时对于不同稀疏基下的数据也有较高的适应性。     

Virtual-Coordinate-Based Delivery-Guaranteed Routing Protocol in Wireless Sensor Networks

In this paper, we first propose a method, ABVCap, to construct a virtual coordinate system in a wireless sensor network. ABVCap assigns each node multiple 5-tuple virtual coordinates. Subsequently, we introduce a protocol, ABVCap routing, to route packets based on the ABVCap virtual coordinate system. ABVCap routing guarantees packet delivery without the computation and storage of the global topological features. Finally, we demonstrate an approach, ABVCap maintenance, to reconstruct an ABVCap virtual coordinate system in a network with node failures. Simulations show ABVCap routing ensures moderate routing path length, as compared to virtual-coordinate-based routing, GLIDER, Hop ID, GLDR, and VCap.      

基于分簇的无线传感器网络路由算法

在大规模无线传感器网络中以最节能的方式将数据发送到sink是该领域研究的热点之一。针对LEACH算法的不足之处,提出了一种能耗均衡的路由算法。此算法在考虑节点剩余能量的基础上采用两分法选举簇首,然后簇首通过能耗代价函数计算出一条能耗最小的路径,以多跳转发的方式将数据传送到sink.,为了进一步减少节点的能耗,算法在簇内采用了数据聚合机制。仿真结果表明,算法有效地均衡了网络能耗,延长了网络生存期。     

无线传感网络中基于蚁群的路由算法

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.     

高能量有效性的无线传感器网络数据收集和路由协议

 提出了一种分布式高效节能的无线传感器网络数据收集和路由协议HEEDC.此协议中传感器节点根据自身状态(综合考虑剩余能量、节点密度等因素计算得出的代价因子)自主的竞争簇首,同时为减少簇首节点的能量开销,簇首之间通过多跳方式将各个簇内收集到的数据发送给特定簇首节点,并由此簇首节点将整个网络收集的数据发送给汇聚节点.仿真实验表明,HEEDC协议比起现有的几种重要路由协议(如LEACH、PEGASIS等),能提供更加有效的能量使用效率,延长无线传感器网络的生存周期.因此,使用HEEDC协议的无线传感器网络具有更好的使用性,其监测结果具有更高的可靠性.