无线传感器网络中基于数据融合的移动代理曲线动态路由算法研究

和传统的C/S模型相比,移动代理模型在数据融合方面更适合无线传感器网络.在基于移动代理的数据融合算法中,移动代理访问传感节点的顺序以及总数对算法的效率、网络寿命等有着重大影响.为此提出了一种基于数据融合的移动代理曲线动态路由算法设计方案.通过构造特定数据结构的数据报文和数据表,给出了目标节点基本信息收集算法获取目标节点到处理节点的最优路径;将移动代理路由归结为一个优化问题,由静态路由算法求出移动代理迁移的静态最优路由节点序列,进而获得了移动代理基于曲线的动态路由算法.理论分析和模拟实验表明,随着传感器网络规模的增大和传感数据量的增加,和其它算法相比,该算法有更小的网络耗能和延时.     

无线传感器网络疑误数据节点自动诊断方法

为了提高无线传感器网络疑误数据检测能力,提出基于轮换调度的无线传感器网络疑误数据节点自动诊断方法。通过采用分块区域特征匹配的方法,得到无线传感器网络疑误数据传输的梯度模型,采用资源优化分配方案,进行数据传输信道的均衡调度,得到节点部署分布模型。通过传感信息跟踪采样方法,得到采样信息分布,建立无线传感器网络疑误数据信息特征分析,通过分组特征检测方法进行无线传感器网络疑误数据的信息融合和空间融合调度,提取无线传感器网络疑误数据的关联规则特征集,通过统计信息分析和融合调度的方法,进行无线传感器网络疑误数据的聚类挖掘,采用预算估计算法,得到疑误数据节点定位优化,结合自主学习算法,实现无线传感器网络疑误数据节点的优化定位和诊断检测。仿真结果表明,采用该方法进行无线传感器网络疑误数据节点检测的自适应性较好,特征辨识能力较强。     

Active node determination for correlated data gathering in wireless sensor networks

In wireless sensor network applications where data gathered by different sensor nodes is correlated, not all sensor nodes need to be active for the wireless sensor network to be functional. Given that the sensor nodes that are selected as active form a connected wireless network, the inactive sensor nodes can be turned off. Allowing some sensor nodes to be active and some sensor nodes inactive interchangably during the lifecycle of the application helps the wireless sensor network to have a longer lifetime. The problem of determining a set of active sensor nodes in a correlated data environment for a fully operational wireless sensor network can be formulated as an instance of the connected correlation-dominating set problem. In this work, our contribution is twofold; we propose an effective and runtime-efficient iterative improvement heuristic to solve the active sensor node determination problem, and a benefit function that aims to minimize the number of active sensor nodes while maximizing the residual energy levels of the selected active sensor nodes. Extensive simulations we performed show that the proposed approach achieves a good performance in terms of both network lifetime and runtime efficiency.     

基于高斯隶属度的融合算法在改进Leach中的应用

无线传感器网络中节点采集的数据具有较高的冗余度,对数据进行融合处理后再传送到汇聚节点,能有效地降低能量消耗,延长网络生命周期.设计了一种基于高斯隶属函数的数据融合算法,并改进无线传感网络Leach协议,对传感器节点进行二级分簇,多跳通信延长网络生命周期.在一级簇头节点依据分布图法剔除疏失数据,进而利用高斯隶属函数求得权...     

WSN中一种负载均衡的动态非均匀分簇方案

无线传感器网络(WSN)是由资源受限的传感器节点构成,节点能耗对网络的性能有着重要影响,对网络进行分簇可以有效地控制节点整体能耗。针对网络实际运行时节点状态和事件位置动态变化等特点,提出了一种负载均衡的动态非均匀分簇方案。方案主体思路是:首先网络利用O-LEACH算法自组织地进行非均匀分簇,接着动态地从簇头中选举出一定数量的决策节点用于网络的数据汇聚,并根据事件发生位置和节点状态变换而动态更改决策节点角色。仿真结果表明,与CAPNet方案相比,该方案均衡了网络能耗,提高了传输效率,延长了网络生命周期。     

无线传感器网络信息时空融合模型与算法研究

信息融合是解决无线传感器网络能量和通信带宽受限的有效途径,提出了一种无线传感器网络信息时间和空间多级混合融合的结构模型。首先对距离汇聚节点较远的节点信息进行时间融合和对距离汇聚节点较近的节点信息在汇聚节点进行时空融合,然后在汇聚节点对两种节点的融合结果进行全网络的空间融合。就该模型提出了基于DS证据理论的多级时空融合算法。数据分析结果表明:该模型能够降低节点能耗,延长网络寿命。     

A novel data fusion scheme using grey model and extreme learning machine in wireless sensor networks

With the increasing presence and adoption of wireless sensor networks (WSNs), the demand of data acquisition and data fusion are becoming stronger and stronger. In WSN, sensor nodes periodically sense data and send them to the sink node. Since the network consists of plenty of low-cost sensor nodes with limited battery power and the sensed data usually are of high temporal redundancy, prediction- based data fusion has been put forward as an important issue to reduce the number of transmissions and save the energy of the sensor nodes. Considering the fact that the sensor node usually has limited capabilities of data processing and storage, a novel prediction-based data fusion scheme using grey model (GM) and optimally pruned extreme learning machine (OP-ELM) is proposed. The proposed data fusion scheme called GM-OP-ELM uses a dual prediction mechanism to keep the prediction data series at the sink node and sensor node synchronous. During the data fusion process, GM is introduced to initially predict the data of next period with a small number of data items, and an OPELM- based single-hidden layer feedforward network (SLFN) is used to make the initial predicted value approximate its true value with extremely fast speed. As a robust and fast neural network learning algorithm, OP-ELM can adaptively adjust the structure of the SLFN. Then, GM-OP-ELM can provide high prediction accuracy, low communication overhead, and good scalability. We evaluate the performance of GM-OP-ELM on three actual data sets that collected from 54 sensors deployed in the Intel Berkeley Research lab. Simulation results have shown that the proposed data fusion scheme can significantly reduce redundant transmissions and extend the lifetime of the whole network with low computational cost.     

无线传感网中一种智能数据融合算法的实现及仿真分析

在无线传感网中,传感器节点一般都由自身装配的电池供电,难以进行电量补充,因此节约电量对于无线传感网来说至关重要.为了提高无线传感网能量使用效率,延长网络生存时间,提出了一种结合遗传算法和粒子群算法优化BP神经网络的智能数据融合算法 GAPSOBP(BP Neural Network Data Fusion algorithm optimized by Genetic algorithm and Particle swarm).GAPSOBP算法将无线传感网的节点类比为BP神经网络中的神经元,通过神经网络提取无线传感网采集的感知数据并结合分簇路由对收集的传感数据进行融合处理,从而大幅减少发往汇聚节点的网络数据量.仿真结果表明,与经典LEACH算法和PSOBP算法相比,GAPSOBP算法能有效减少网络通信量,节约节点能量,显著延长网络生存时间.     

蚁群优化算法在WSN路由中的应用研究

介绍了基本蚁群算法的原理和适用范围,总结出了基本蚁群算法在求解最优路径问题时,虽然具有很强的发现较优解的能力,但是存在容易陷入局部最优解和收敛时间过长等问题。考虑到基本蚁群算法在无线传感器网络路由上应用的不足,提出了一种改进后的蚁群算法,并将其应用到传感器网络路由中。该算法不仅在状态转移概率公式中引入罚函数和动态权重因子,而且采用局部信息素更新和全局信息素更新结合的方式更新路径信息,充分考虑到传感器节点与节点间的传输距离,并且充分考虑传感器节点的剩余能量。最后通过仿真实验,得到了基本蚁群算法和改进后的蚁群算法在传感器节点剩余能量和传输数据包时网络延迟的不同曲线,验证了改进后的蚁群算法在无线传感器网络路由选择上的高效性。     

医院无线网络信息节点安全性度量方法研究

为了提高医院无线网络信息节点安全性,确保医院无线网络通信的畅通,提出一种基于传感器量化融合跟踪检测的医院无线网络信息节点安全性度量方法。构建医院无线网络信息节点的自适应转发控制模型,采用节点剩余能量融合识别方法进行节点的自适应调度,在物联网环境下实现医院无线网络信息节点的优化定位部署,构建节点的路由探测协议,利用医院无线网络信息节点自身的存活度进行无线传感网络模式下的节点转发链路均衡处理,采用传感器量化融合跟踪测试方法实现医院无线网络信息节点的安全性度量。仿真测试结果表明,采用该方法进行医院无线网络信息节点安全性度量的准确性较高,节点的能量开销较小,提高了节点数据转发的准确率。     

无线传感器网络中非均匀的节点布置

在无线传感器网络中,传感器节点将收集到的数据传输到簇头,经簇头聚合后数据包以多跳方式发送到基站。靠近基站的节点,因转发的数据较多而提早死亡,出现所谓的能量空洞问题。为此,对无线传感器网络中节点的能耗情况进行了研究,提出了一种非均匀的节点布置算法,得出了一个布置传感器节点的密度函数,在靠近基站的区域内布置较多的节点。仿真实验表明,非均匀的节点布置算法能有效延长网络的生命周期。     

UAV-assisted data gathering in wireless sensor networks

An unmanned aerial vehicle (UAV) is a promising carriage for data gathering in wireless sensor networks since it has sufficient as well as efficient resources both in terms of time and energy due to its direct communication between the UAV and sensor nodes. On the other hand, to realize the data gathering system with UAV in wireless sensor networks, there are still some challenging issues remain such that the highly affected problem by the speed of UAVs and network density, also the heavy conflicts if a lot of sensor nodes concurrently send its own data to the UAV. To solve those problems, we propose a new data gathering algorithm, leveraging both the UAV and mobile agents (MAs) to autonomously collect and process data in wireless sensor networks. Specifically, the UAV dispatches MAs to the network and every MA is responsible for collecting and processing the data from sensor nodes in an area of the network by traveling around that area. The UAV gets desired information via MAs with aggregated sensory data. In this paper, we design a itinerary of MA migration with considering the network density. Simulation results demonstrate that our proposed method is time- and energy-efficient for any density of the network.     

An energy-saving routing architecture with a uniform clustering algorithm for wireless body sensor networks

Wireless body sensor networks are expected to extend human-centered applications in large-scale sensing and detecting environments. Energy savings has become one of the most important features of the sensor nodes to prolong their lifetime in such networks. To provide reasonable energy consumption and to improve the network lifetime of wireless body sensor network systems, new and efficient energy-saving schemes must be developed. An energy-saving routing architecture with a uniform clustering algorithm is proposed in this paper to reduce the energy consumption in wireless body sensor networks. We adopted centralized and cluster-based techniques to create a cluster-tree routing structure for the sensor nodes. The main goal of this scheme is to reduce the data transmission distances of the sensor nodes by using the uniform cluster structure concepts. To make an ideal cluster distribution, the distances between the sensor nodes are calculated, and the residual energy of each sensor node is accounted for when selecting the appropriate cluster head nodes. On the basis of the uniform cluster location, the data transmission distances between the sensor nodes can be reduced by employing an adaptive multi-hop approach. The energy consumption is reduced, and the lifetime is extended for the sensor nodes by balancing the network load among the clusters. Simulation results show that the proposed scheme outperforms the previously known schemes in terms of the energy consumption and the network lifetime for the wireless body sensor networks.     

Effective fault detection and routing scheme for wireless sensor networks

In a wireless sensor network (WSN), random occurrences of faulty nodes degrade the quality of service of the network. In this paper, we propose an efficient fault detection and routing (EFDR) scheme to manage a large size WSN. The faulty nodes are detected by neighbour node’s temporal and spatial correlation of sensing information and heart beat message passed by the cluster head. In EFDR scheme, three linear cellular automata (CA) are used to manage transmitter circuit/ battery condition/microcontroller fault, receiver circuit fault and sensor circuit fault representation. On the other hand, L-system rules based data routing scheme is proposed to determine optimal routing path between cluster head and base station. The proposed EFDR technique is capable of detecting and managing the faulty nodes in an efficient manner. The simulation results show 86% improvement in the rate of energy loss compared to an existing algorithm.     

Integration of sensing and computing in an intelligent decision support system for homeland security defense

We propose an intelligent decision support system based on sensor and computer networks that incorporates various component techniques for sensor deployment, data routing, distributed computing, and information fusion. The integrated system is deployed in a distributed environment composed of both wireless sensor networks for data collection and wired computer networks for data processing in support of homeland security defense. We present the system framework and formulate the analytical problems and develop approximate or exact solutions for the subtasks: (i) sensor deployment strategy based on a two-dimensional genetic algorithm to achieve maximum coverage with cost constraints; (ii) data routing scheme to achieve maximum signal strength with minimum path loss, high energy efficiency, and effective fault tolerance; (iii) network mapping method to assign computing modules to network nodes for high-performance distributed data processing; and (iv) binary decision fusion rule that derive threshold bounds to improve system hit rate and false alarm rate. These component solutions are implemented and evaluated through either experiments or simulations in various application scenarios. The extensive results demonstrate that these component solutions imbue the integrated system with the desirable and useful quality of intelligence in decision making.     

无线传感器网络分簇路由节能研究

在大规模传感和环境监测中,节约能源延长传感器节点生命已成为无线传感器网络最重要的研究课题之一。提供合理的能源消耗和改善无线网络生命周期的传感器网络系统,必须设计一种新的有效的节能方案和节能路由体系。方案采用一种聚类算法减少无线传感器网络的能量消耗,创建一种cluster-tree分簇路由结构的传感器网络。该方案主要目标是做一个理想的分簇分配,减少传感器节点之间的数据传输距离,降低传感器节点能源消耗,延长寿命。实验结果表明,该方案有效地降低了能源消耗从而延长无线传感器网络生命。     

基于改进ACO的WSN感知数据传输策略研究

无线传感器网络(WSN)能够利用传感器节点快速准确地获取物理世界的信息从而作为物联网的感知层在监控领域得到了广泛的应用,而能量利用率是能量受限无线传感器网络的一个关键属性,直接影响网络的生命周期.经典的分层路由LEACH(及其变种)算法是无线传感器网络中最常见的节能路由协议.该文提出了一种改进的LEACH算法,由sin...     

An improved ant colony optimization-based approach with mobile sink for wireless sensor networks

Traditional wireless sensor networks (WSNs) with one static sink node suffer from the well-known hot spot problem, that of sensor nodes near the static sink bear more traffic load than outlying nodes. Thus, the overall network lifetime is reduced due to the fact some nodes deplete their energy reserves much faster compared to the rest. Recently, adopting sink mobility has been considered as a good strategy to overcome the hot spot problem. Mobile sink(s) physically move within the network and communicate with selected nodes, such as cluster heads (CHs), to perform direct data collection through short-range communications that requires no routing. Finding an optimal mobility trajectory for the mobile sink is critical in order to achieve energy efficiency. Taking hints from nature, the ant colony optimization (ACO) algorithm has been seen as a good solution to finding an optimal traversal path. Whereas the traditional ACO algorithm will guide ants to take a small step to the next node using current information, over time they will deviate from the target. Likewise, a mobile sink may communicate with selected node for a relatively long time making the traditional ACO algorithm delays not suitable for high real-time WSNs applications. In this paper, we propose an improved ACO algorithm approach for WSNs that use mobile sinks by considering CH distances. In this research, the network is divided into several clusters and each cluster has one CH. While the distance between CHs is considered under the traditional ACO algorithm, the mobile sink node finds an optimal mobility trajectory to communicate with CHs under our improved ACO algorithm. Simulation results show that the proposed algorithm can significantly improve wireless sensor network performance compared to other routing algorithms.     

一种能量有效的平面式无线传感器网络的信任管理模型

信任管理机制解决了来自无线传感器网络的内部攻击问题,但同时产生由信任评价带来的额外开销。现有的信任管理模型对节点信任度的评价缺乏公平性,导致节点使用率的降低。为了解决信任机制在无线传感器网络的耗能问题,提出了一种能量有效的平面式无线传感器网络信任模型。通过节点的自身性能与任务难度的关系定义节点的执行度,在确保信任管理有效性的同时,增强节点信任度评价的公平性,从而提高传感器节点的使用率,降低了能量消耗。最后通过模拟实验,证明该信任模型与传统信任模型相比,能够有效检测恶意节点,同时大大降低了节点的能量消耗,提高了网络生存周期。     

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.