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

在分簇协议LEACH和链状协议PEGASIS的基础上,提出一种新的基于数据融合的分簇路由算法.簇首节点采用多跳方式传输数据,并根据周围节点的密集程度构造不同大小的簇;簇内节点计算上行和下行节点构造数据融合树,采用时分复用调度算法进行多跳路由.NS2仿真结果表明该路由算法均衡了各个节点的能量消耗,延长了网络存活时间,并降低了网络延迟.     

无线传感器网络能量均衡分簇路由协议

LEACH是无线传感器网络(Wireless Sensor Network,WSN)中一种经典的分层式路由协议,在此基础上通过对LEACH成簇算法及簇间路由的改进,提出了一种新的均衡能量消耗分簇路由协议。该协议在无线传感器网络成簇过程中充分考虑了传感器节点的能量状态,同时簇首向基站的通信采用基于能量的簇间路由。理论分析及仿真结果表明,改进的协议能够均衡传感器节点的能量消耗,有效地延长网络寿命。     

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

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

无线传感器网络簇间节能路由算法

针对基于分簇网络的无线传感器网络簇间路由协议,让簇首和Sink节点直接通信或通过簇首节点转发数据造成能耗不均,节点过早死亡的缺陷。文中提出一种基于网关节点模型的无线传感器网络簇间路由算法,通过簇头与网关节点、网关节点自身建立虚电路,制定存储转发路由,将数据转发给Sink节点。并引入延时等待机制,增强了簇间信息的融合度,此算法适用于大规模无线传感器网络,有良好的可扩展性。仿真表明在能量节省等性能上与传统簇间路由算法相较有较大提高。     

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

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

一种WSN中分簇路由算法的改进

在无线传感器网络中,基于分簇的路由协议对提高网络的寿命有着重要作用,LEACH是一种应用比较广泛的层次路由协议。本文提出一种新的基于最优分簇的无线传感器网络分簇路由（LEACH-O）算法,在簇的形成过程考虑到节点的集中程度和节点的剩余能量,从而减少传感器节点的能量消耗,优化资源利用率。仿真实表明,与传统的LEACH算法相比,该算法配传感器节点间数据传输提供了高效路由,从而延长网络的生命周期。     

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

无线传感网络中低功耗自适应聚类分簇(LEACH)路由算法等概率选取簇首节点,容易导致整个网络节点能量损耗出现极端化,减少网络生存时间。为此,提出一种针对簇首节点选取和分簇的改进LEACH算法。该算法把整个网络区域分为四个扇形区域,在每个区域内独立进行分簇路由;然后基站根据节点剩余能量和与基站的距离进行簇首节点选择,节点根据簇首节点和基站接收信号强度选择路由方式,以均衡网络能量消耗。仿真结果表明,改进LEACH算法的网络寿命是原有LEACH算法的150%,数据吞吐量提升了3倍。     

有效降低无线网络节点能量的LEACH新算法

LEACH是一种低功耗自适应按簇分层路由算法.为了降低节点能耗,在LEACH协议的基础上提出了在选举簇头时,改变阈值T(n)的大小以降低节点成为簇头的概率,从而节省网络因分簇而消耗的能量.同时又提出了一种基于节点剩余能量的二层簇头的算法,该算法能使节点减少将冗余信息传输到基站,从而达到降低节点消耗能量的目的.通过实验仿真,表明这些方法能使网络节点能量的消耗减少,达到了延长网络生命周期的目的.     

无线传感器网络LEACH路由算法改进

在分析了无线传感器网络中分层路由LEACH算法的基础上,根据网络中节点初始能量的不同,提出了一种新型簇首节点选择方法,并通过MATLAB对改进后的LEACH算法进行了仿真,仿真结果显示改进后的LEACH算法充分利用了网络的功耗。     

无线传感网中基于sink节点的目标位置选择移动算法

在深入研究k-means算法和连续Hopfield神经网络算法的基础上,提出一种目标位置选择移动算法,该算法先利用k-means算法的原理,将网络中能量相近的节点进行聚簇,并选取每个簇的质心作为sink节点可以安放的目标位置,再利用连续Hopfield神经网络算法的思想,为sink节点的前进预设一条最优路径。Matlab仿真结果显示,该路由算法可以有效地抑制能量空洞的现象,对延长网络寿命具有重大意义,同时对解决能源问题也做出了一定贡献。     

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

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

An Energy-Efficient Routing Protocol for Event-Driven Dense Wireless Sensor Networks

The routing energy efficiency of a wireless sensor network is a crucial issue for the network lifetime. In this article, we propose MICRO (MInimum Cost Routing with Optimized data fusion), an energy-efficient routing protocol for event-driven dense wireless sensor networks. The proposed routing protocol is an improvement over the formerly proposed LEACH and PEGASIS protocol, which is designed to be implemented mainly with node computations rather than mainly with node communications. Moreover, in the routing computation the proposed scheme exploits a new cost function for energy balancing among sensor nodes, and uses an iterative scheme with optimized data fusions to compute the minimum-cost route for each event-detecting sensor node. Compared to the PEGASIS routing protocol, MICRO substantially improves the energy-efficiency of each route, by optimizing the trade-off between minimization of the total energy consumption of each route and the balancing of the energy state of each sensor node. It is demonstrated that the proposed protocol is able to outperform the LEACH and the PEGASIS protocols with respect to network lifetime by 100–300% and 10–100%, respectively.     

Optimized priority based energy efficient routing algorithm for mobile ad hoc networks

Recently more and more research interest focuses on the energy efficient routing in mobile ad hoc networks and many related routing algorithms are reported. In this paper, a new optimized priority based energy efficient routing algorithm is presented and priority is added to the existing routing algorithm according to the residual energy proportion of the nodes. Lower residual energy means lower priority and the nodes with lower priority are less likely to forward packets to other nodes. The algorithm needs no global information of the networks and only a little modification is needed to the existing algorithm, so it is practical to be implemented. The algorithm can improve the performance of routing discovery, routing maintenance and cache management at the same time. Some optimization strategy is taken to reduce the network overhead and the lifetime of the network is much longer and the network with our algorithm can transfer much more effective data. Simulation with NS-2 is done and satisfying results are obtained with this algorithm. The results show that the algorithm is efficient.     

一种基于最低能量保护的分簇CCLP算法

PEGASIS协议是一种基于链式结构的协议,链中总有一个节点被选为头节点,这个节点没有考虑到基站的位置,导致PEGASIS协议造成冗余数据的传送.提出了基于同中心簇中最低能量保护的算法.仿真结果表明,该算法能考虑到基站的位置和充分保护能量最小的节点,来增强它的性能和延长WSN的生命周期.     

A New Energy Efficient Hierarchical Routing Protocol for Wireless Sensor Networks

Wireless sensor networks consist of low cost sensor nodes which have limited power supplies, memory capacity, processing capability and transmission rate. Sensor nodes gather information from the environment and send the collected information to base station with help of a routing cooperation. Because of limited resources in Wireless Sensor Networks, fulfilling these routing operations is a major problem. Routing protocols are used to perform these operations. The most important thing by considering while these protocols are designed is energy efficiency. Because wireless sensor networks are widely used in intelligent systems, the energy efficiency of these networks is very important in IoT. Researchers have proposed several hierarchical routing protocols such as LEACH, PEGASIS, TEEN and APTEEN. In this study, an energy efficient routing protocol is developed which is more efficient than currently avaliable routing protocols. The developed protocol involves mapping of the network, sleep–wake/load balancing, data merge processes. The proposed protocol gives better results than other protocols in number of surviving nodes and amount of energy consumed criterias.     

A centralized energy-efficient routing protocol for wireless sensor networks

Wireless sensor networks consist of small battery powered devices with limited energy resources. Once deployed, the small sensor nodes are usually inaccessible to the user, and thus replacement of the energy source is not feasible. Hence, energy efficiency is a key design issue that needs to be enhanced in order to improve the life span of the network. Several network layer protocols have been proposed to improve the effective lifetime of a network with a limited energy supply. In this article we propose a centralized routing protocol called base-station controlled dynamic clustering protocol (BCDCP), which distributes the energy dissipation evenly among all sensor nodes to improve network lifetime and average energy savings. The performance of BCDCP is then compared to clustering-based schemes such as low-energy adaptive clustering hierarchy (LEACH), LEACH-centralized (LEACH-C), and power-efficient gathering in sensor information systems (PEGASIS). Simulation results show that BCDCP reduces overall energy consumption and improves network lifetime over its comparatives.     

无线传感器网络分簇路由协议研究

在无线传感器网络中,分簇型路由在路由协议中占据重要的地位,该协议方便拓扑结构管理,能源利用率高,数据融合简单。文章从簇头生成、簇形成和簇路由3个角度对典型的分簇路由算法LEACH,HEED,EEUC,PEGASIS进行了系统描述,从网络生命周期和节点存活数量等方面,对比了其优缺点,结合该领域的研究现状,指出了未来研究的方向。     

无线传感器网络中基于PEGASIS协议的改进算法

 作为能量有效、基于链状结构的路由协议的典型代表,PEGASIS协议存在三个方面的不足,一是链的生成算法会导致相邻节点间产生长链;二是链头节点选取方法会导致节点间能量消耗不均衡;三是链头节点重选频率增加了通信开销.本文基于PEGASIS提出了一种新算法,新算法通过引入距离门限避免相邻节点间产生长链;通过综合考虑节点剩余能量以及节点到基站的距离来选取链头节点;通过降低链头节点重选频率来节省通信开销.分析和仿真结果表明,在未增加算法复杂度的情况下,新算法在平衡节点能耗和延长网络寿命方面比PEGASIS算法具有更优越的性能.     

移动自组网电力及负荷感知的构造最小连通支配集算法

在移动自组网络MANET(Mobile Ad-hoc Networks)中,移动节点之间的通信是多跳(Multi-hop)的,即需要网络中其他节点的参与得以进行,因此,节点之间的通信路径会因为节点的电力耗竭或节点的移动而中断.本文提出了根据移动节点当前电力及通信负荷来选择支配节点的最小连通支配集CDS(Connected Dominating Set)构造算法,这种算法可以减小由移动节点电力耗竭所致的通信路径失效的概率,也可以减少数据包通过各移动节点的延误时间,对设计MANET的高效稳定的路由策略有着重要的应用价值.