无线传感器网络基于分簇路由的数据融合研究

无线传感器网络节点资源有限,所以需要采用有效的路由算法与数据融合机制来节省资源,延长网络寿命,提升数据采集效率。LEACH是经典分簇路由协议,针对其在簇头选择机制、数据融合以及簇头与基站通信的路由方面的不足,提出了几点改进方法,在簇头选择的算法中加入了能量控制条件,簇头与基站的路由改为更适合数据融合的多跳反向组播树,并基于信息熵提出了有效数据融合机制。仿真实验表明,改进之后的算法比原LEACH算法更有效地利用了节点资源,延长了网络生存时间。     

UCRP—一种能量有效的WSN非均匀分簇路由协议

提出了一种新的能量有效的非均匀分簇路由协议—UCRP.根据距离基站的远近将网络分为大小不同的簇;簇内数据传输根据簇范围的大小采用单跳或多跳;簇间数据传输构建多跳路由,簇首选择下一跳节点时将能量与最小跳数路由算法相结合;最后在能量有效的前提下对LEACH协议易受到HELLO flooding攻击提出了安全设想.仿真结果表明:该协议能够有效地均衡簇首和全网能耗,延长网络生存时间.     

基于TinyOS的无线传感器网络LEACH算法的改进

LEACH协议是无线传感器网络中最流行的分簇路由协议之一.针对LEACH算法簇分布不均匀以及网络能耗不均衡等问题提出了一种高效节能多跳路由算法.在簇建立阶段,新算法根据网络模型计算出最优簇头间距值,调整节点通信半径以控制簇的大小,形成合理网络拓扑结构;在数据传输阶段,簇头与基站之间采用多跳的通信方式,降低了节点能耗.在TinyOS操作系统下,使用nesC语言设计实现了LEACH-EEMH算法.基于TOSSIM平台的仿真结果表明,新算法较LEACH算法在均衡网络能耗、延长网络寿命方面具有显著优势.     

基于剩余能量和节点度的多跳分簇算法的研究

LEACH协议是第一个在无线传感器网络中提出的分簇路由协议,由于其簇头产生的随机性,产生了一些不足,因此为了均衡整个网络的能耗,延长WSN的生命周期,提出了基于节点剩余能量和节点度的多跳分簇路由协议。其基本思想是在LEACH中加入门限,让剩余能量高且节点度高的节点优先成为簇头,簇头之间采用多跳路由传输机制。仿真结果表明,该协议能够有效地延长网络的生命期。     

基于最小生成树的LEACH协议改进

LEACH(Low Energy Adaptive Clustering Hierarchy)是一种被广泛应用于无线传感网络的路由协议.本文针对LEACH协议中,远距离节点作为簇首时能量消耗过多的缺点,提出了一种改进的无线传感网络路由协议.多跳传输LEACH改进协议在节点选出簇首之后,采用最小生成树中Prim算法,在簇首与基站间采用多跳传输.为克服多跳传输时距基站第一跳的簇首能量消耗较多的缺点,阈值需要采用节点距基站的距离和节点距簇首的平均距离来调整,已达到平衡节点能量消耗的目的.仿真结果表明,改进的算法可减少和均衡能量消耗,提高能量的使用,以及延长整个网络寿命方面具有很大的优势.     

WSN中能量有效分簇多跳路由算法

针对现有无线传感器网络(WSN)分簇路由算法存在的能耗不均衡问题,提出一种能量有效分簇多跳路由算法,该算法包括两个方面:一是选举簇首时引入簇内平均剩余能量因子,根据上一轮结束后簇内各节点剩余能量和簇内节点的平均剩余能量的比值更新簇首在所有节点中所占的百分比;二是要求簇首根据MTE多跳路由协议与基站通信,从而均衡WSN整...     

基于环形搜索的WSN簇间最优路由选择

为了解决LEACH协议中由单跳路由算法造成的节点能量消耗不均衡的问题,首先,计算分析得出簇间多跳的最优跳数,得到簇头节点到基站的一条理想路径;然后,提出一种环形搜索方法去寻找与理想路径最接近的最优路径;最后,提出了簇头到基站的多跳路由算法。仿真实验结果表明,簇头到基站的多跳路由算法较LEACH协议在均衡节点能量消耗和延长网络生命时间方面的性能有明显的提高。     

基于分环多跳的无线传感网分簇路由算法

为了提高无线传感网在大区域情形下的能量效率,提出了一种分环多跳分簇路由算法RBMC(ring based multi-hop clustering routing algorithm).RBMC算法采用分环的方式实现簇头间的多跳通信,通过在不同环内构建大小不同的簇解决传感器网络中存在的"热点"问题,在不同的簇头选举策略下,能够同时满足节点能量同构及异构两种情形.仿真结果表明,在大区域环境下,分环多跳分簇路由算法能在很大程度上均衡节点能量消耗,延长网络的生命周期.     

一种基于多级查表机制的分簇式路由协议

介绍传统分簇网络簇间通信采用集中接入方式的缺点和采用分散式接入的优点,并提出分散式接入的实现方案。在此基础上针对簇首节点负担重、部分路由不合理的问题,首次提出基于多级查表的分簇式路由协议。该协议基于多频分级结构,提出公共控制信道的概念,网络中所有节点在公共控制信道上周期性地广播心跳信息,节点据此感知邻居节点,使得不同簇一跳节点间可以直接通信,降低了簇首节点的负担。     

一种基于能量和距离的无线传感器网络分簇路由协议

在无线传感器网络的路由技术中,基于簇的路由算法在拓扑管理、能耗利用、数据融合等方面都有较强的优势.在分析EECS协议的基础上,提出了EECS协议存在的问题,并相应地修改了成簇算法,设计了ADEECS协议,增强了算法的能量均衡性能.在簇头选举阶段总是选择剩余能量最多的节点,在成簇阶段ADEECS协议同时考虑了节点的剩余能量和节点与基站的距离.仿真结果也证明了ADEECS协议相对于EECS很大地提高了网络的生命周期.     

Clustering routing protocol based on improved PSO algorithm in WSN

Aiming at the problem that the location distribution of cluster head nodes filtered by wireless sensor network clustering routing protocol was unbalanced and the data transmission path of forwarding nodes was unreasonable,which would increase the energy consumption of nodes and shorten the network life cycle,a clustering routing protocol based on improved particle swarm optimization algorithm was proposed.In the process of cluster head election,a new fitness function was established by defining the energy factor and position equalization factor of the node,the better candidate cluster head node was evaluated and selected,the position update speed of the candidate cluster head nodes was adjusted by the optimized update learning factor,the local search and speeded up the convergence of the global search was expanded.According to the distance between the forwarding node and the base station,the single-hop or multi-hop transmission mode was adopted,and a multi-hop method was designed based on the minimum spanning tree to select an optimal multi-hop path for the data transmission of the forwarding node.Simulation results show that the clustering routing protocol based on improved particle swarm optimization algorithm can elect cluster head nodes and forwarding nodes with more balanced energy and location,which shortened the communication distance of the network.The energy consumption of nodes is lower and more balanced,effectively extending the network life cycle.     

Dual head static clustering algorithm for wireless sensor networks

Clustering of nodes is often used in wireless sensor networks to achieve data aggregation and reduce the number of nodes transmitting the data to the sink. This paper proposes a novel dual head static clustering algorithm (DHSCA) to equalise energy consumption by the sensor nodes and increase the wireless sensor network lifetime. Nodes are divided into static clusters based on their location to avoid the overhead of cluster re-formation in dynamic clustering. Two nodes in each cluster, selected on the basis of the their residual energy and their distance from the sink and other nodes in the cluster, are designated as cluster heads, one for data aggregation and the other for data transmission. This reduces energy consumption during intra-cluster and inter-cluster communication. A multi-hop technique avoiding the hot-spot problem is used to transmit the data to the sink. Experiments to observe the energy consumption patterns of the nodes and the fraction of packets successfully delivered using the DHSCA suggest improvements in energy consumption equalisation, which, in turn, enhances the lifetime of the network. The algorithm is shown to outperform all the other static clustering algorithms, while being comparable with the performance of the best dynamic algorithm.     

Multi-factor and Distributed Clustering Routing Protocol in Wireless Sensor Networks

One of important issues in wireless sensor networks is how to effectively use the limited node energy to prolong the lifetime of the networks. Clustering is a promising approach in wireless sensor networks, which can increase the network lifetime and scalability. However, in existing clustering algorithms, too heavy burden of cluster heads may lead to rapid death of the sensor nodes. The location of function nodes and the number of the neighbor nodes are also not carefully considered during clustering. In this paper, a multi-factor and distributed clustering routing protocol MFDCRP based on communication nodes is proposed by combining cluster-based routing protocol and multi-hop transmission. Communication nodes are introduced to relay the multi-hop transmission and elect cluster heads in order to ease the overload of cluster heads. The protocol optimizes the election of cluster nodes by combining various factors such as the residual energy of nodes, the distance between cluster heads and the base station, and the number of the neighbor nodes. The local optimal path construction algorithm for multi-hop transmission is also improved. Simulation results show that MFDCRP can effectively save the energy of sensor nodes, balance the network energy distribution, and greatly prolong the network lifetime, compared with the existing protocols.     

传感器网络中基于时空相关性的压缩感知算法

传感器网络节点的能量有限,为节省传感器节点的能耗,提出了利用节点内及节点间的时空相关性的压缩感知模型及算法,减少了通信的数据量,进一步节省了能耗,延长了网络的生命周期。算法在分簇协议和多跳路由优化的基础上,在簇头节点运用较为简单的压缩感知压缩测量方法,降低了计算复杂度。通过对实测数据的误差分析及能耗仿真,验证了该模型及算法的有效性和实用性。     

交通路灯监控系统的无线传感网链状路由算法

在交通路灯监控系统中为节省网络节点能耗和降低数据传输时延,提出一种无线传感网链状路由算法（CRASMS）。该算法根据节点和监控区域的信息将监控区域分成若干个簇区域,在每一个簇区域中依次循环选择某个节点为簇头节点,通过簇头节点和传感节点的通信建立簇内星型网络,最终簇头节点接收传感节点数据,采用数据融合算法降低数据冗余,通过簇头节点间的多跳路由将数据传输到Sink节点并将用户端的指令传输到被控节点。仿真结果表明：CRASMS算法保持了PEGASIS算法在节点能耗方面和LEACH算法在传输时延方面的优点,克服了PEGASIS 算法在传输时延方面和LEACH算法在节点能耗方面的不足,将网络平均节点能耗和平均数据传输时延保持在较低水平。在一定的条件下,CRASMS算法比LEACH和PEGASIS算法更优。     

Reliable and Energy Efficient Communication Algorithm in Hierarchical Wireless Sensor Networks

Wireless sensor networks are data centric networks, which transmit gathered data to sink nodes. Considering energy constraints, how to make full use of the limited energy to reliably transmit data as much as possible becomes a main research region in sensor networks. In this paper, we focus on energy consumption and reliability of different communication modes. Single hop communication mode is simple and easy to implement, but the distant cluster members, especially those on the edge of the networks, need to enlarge transmission power. On the other hand multi-hop communication is not constrained by the communication distance. The relay communication mode guarantees data transmission to a remote cluster head. Considering of the reliability and energy consumption, we propose a voting based clustering communication algorithm. And the optimal cluster number is calculated based on the geometry locations. Finally, several experiments have been done to validate the analysis in this paper.     

基于静态分簇的LEACH算法改进研究

LEACH算法是为满足高效节能需要而提出的一种典型的分簇协议.在此基础上,提出了一种改进算法：主要体现在在网络开始工作时使用静态分簇,以簇为单位进行簇内节点轮换当选为簇首,簇间以及簇与基站间的通讯采用单跳与多跳结合的方式.最后使用NS2对LEACH算法和改进的算法进行仿真对比,证实了改进后的算法在与LEACH算法相比性能有了很大的提高.     

Design guidelines for wireless sensor networks: communication, clustering and aggregation

When sensor nodes are organized in clusters, they could use either single hop or multi-hop mode of communication to send their data to their respective cluster heads. We present a systematic cost-based analysis of both the modes, and provide results that could serve as guidelines to decide which mode should be used for given settings. We determine closed form expressions for the required number of cluster heads and the required battery energy of nodes for both the modes. We also propose a hybrid communication mode which is a combination of single hop and multi-hop modes, and which is more cost-effective than either of the two modes. Our problem formulation also allows for the application to be taken into account in the overall design problem through a data aggregation model.     

一种无线传感器网络分簇路由算法研究

在分析LEACH协议的基础上提出一种基于能量和距离的多跳路由算法（CAED）。由基站依据节点剩余能量和簇头与基站的距离分别选出二层簇头,簇内节点利用单跳和多跳模式与簇头进行通信。仿真实验表明,新算法有效地平衡了节点的能量消耗,并显著地延长了网络的生命周期。