基于双簇头非均匀分簇的LEACH协议的改进

在无线传感器网络中的LEACH协议是一种自适应聚类路由算法．由于LEACH协议存在着无法控制簇首在网络中的分布位置、簇首选择方式限制条件不够等缺点导致能量消耗太大．基于簇头能量限制和双簇头路由方式,对LEACH协议进行了改进,设计了一种降低能耗的双簇头非均匀分簇路由协议．双簇头非均匀分簇路由协议采用NS2进行网络仿真实验,通过仿真结果的分析以及与LEACH协议的对比,证明双簇头非均匀分簇路由协议有效提高了网络能耗的均衡性．     

基于不均匀分簇的LEACH协议的改进研究方案

LEACH协议是一种自适应聚类路由算法,针对协议在簇头选举时的不确定性和随机性,使节点消耗能量大、不利于延长网络的生命周期的缺点,提出基于簇头能量限制的双簇头路由方式的协议方案,对LEACH协议进行了改进。改进的协议采用仿真软件进行网络仿真实验,通过对仿真结果的分析及与LEACH协议的对比,证明了改进的不均匀分簇的路由协议可以有效地均衡网络能耗,延长网络的生命周期。     

一种改进的无线传感器网络分簇路由协议

针对无线传感器网络中节点能量受限的特征,提出了ILEACH(improved-LEACH)分簇路由协议,达到延长网络生存时间的目的,该分簇路由协议在簇头选取时,充分考虑了节点的剩余能量;簇形成时利用了距离阈值的约束来优化分簇方案;数据收集阶段,根据节点的权值在簇头节点之间建立到基站的路由树,利用NS2仿真软件对LEACH和ILEACH协议进行仿真、比较,结果显示ILEACH具有良好的性能.     

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

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

能量不均衡的传感器网络路由算法研究

结合实际应用中传感器网络能量分布不均衡的特点,分析了以低功耗自适应集簇分层型协议(Low Energy Adaptive Clustering Hierachy Protocol,LEACH)为代表的分簇路由协议存在的不足。在改进LEACH协议的基础上,提出了LEACH-SCE协议,并以二级能量异构网络为例通过MATLAB软件对协议的性能进行了仿真验证,仿真结果表明,通过优化高能节点的簇头选择概率,改进协议可以更加有效地利用网络能量,同等条件下,比LEACH协议的生存周期提高了31%,有效节约了网络成本。     

无线传感器网络LEACH改进算法的设计与仿真

在众多的无线传感器网络分簇路由协议中,低功耗自适应分簇(Low Energy Adaptive Clustering Hierarchy,LEACH)算法是其中比较流行的协议之一,但它并没有考虑到每个节点的能量状态,而且最优簇首数一旦确定,整个网络通信期间不再改变,因而不能更有效地提高网络的生存时间.文章在LEACH协议的基础上提出了一种改进的高能效无线传感器网络协议-EECRP(an Energy Efficient Cluster Routing Protocol).仿真结果表明,与LEACH相比,EECRP具有更好的能量有效性,并且提高了无线传感器网络的寿命.     

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

经典的分簇路由协议LEACH在无线传感器网络中有着非常广泛的应用,针对LEACH协议在成簇时没有考虑簇头节点的能量等因素的缺陷,为延长网络生存期在LEACH协议基础之上,在簇头选择公式中加入节点剩余能量的参数,使得选举能量较高的节点为簇头,提出改进的LEACH协议。并在网络模拟软件NS2平台下,对改进的LEACH协议与原LEACH协议进行仿真比较分析,结果表明改进后的协议中各个节点能耗均衡,避免个别节点过早衰亡,可以延长网络生存期。     

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

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

一种基于分簇的无线传感器网络路由协议的设计

在典型分簇协议LEACH的基础上,设计了一种新的路由协议LACHS.与LEACH不同,协议LACHS根据网络中节点的剩余能量动态选择集中式或分布式分簇算法.将协议LACHS与LEACH相比较,模拟实验结果表明:LACHS优于LEACH,能有效延长网络的生命周期;还考虑了拓扑结构的变化,从而保证了网络的稳定性.     

基于LEACH的改进型无线传感器网络路由算法研究

针对经典分簇路由算法LEACH在选取簇头时没有充分考虑节点剩余能量的问题,在LEACH协议的基础上,改进了簇首选择、最优簇首数和簇形成过程,提出一个自适应分布式算法,即ADCP-LEACH算法,该算法可以应用干周期性的采集数据,根据每个节点竞选簇头时的阈值不同,让剩余能量大的节点当选簇头的概率更大.NS2仿真实验表明,改进的协议有效延长了网络的存活时间,性能优于LEACH协议.     

PEAL: Power Efficient and Adaptive Latency Hierarchical Routing Protocol for Cluster-Based WSN

In wireless sensor networks, one of the most important constraints is the low power consumption requirement. For that reason, several hierarchical or cluster-based routing methods have been proposed to provide an efficient way to save energy during communication. However, their main challenge is to have efficient mechanisms to achieve the trade-off between increasing the network lifetime and accomplishing acceptable transmission latency. In this paper, we propose a novel protocol for cluster-based wireless sensor networks called PEAL (Power Efficient and Adaptive Latency). Our simulation results show that PEAL can extend the network lifetime about 47% compared to the classic protocol LEACH (Low-Energy Adaptive Clustering Hierarchy) and introduces an acceptable transmission latency compared to the energy conservation gain.     

基于分簇的无线传感器网络通信协议LEACH研究

针对于直接传输（DT,DirectTransmission）和最小化传输能量（MTE,MinimumTransmissionEnergy）两种传统通信协议的缺点和无线传感器网络（WSNs,WirelessSensorNetworks）的特点,分析了基于分簇的无线传感器网络通信的低功耗自适应分簇协议（LEACH,Low—EnergyAdaptiveCluste—ringHierarchy）的基本原理,并对三者进行仿真分析。分析与仿真结果表明,使用LEACH协议比使用DT协议要节约大约7到8倍的能源,同时也比MTE协议方式要减少4到8倍能源消耗。更适用于无线传感器网络。     

基于LEACH的WSN路由算法研究

为了提高无线传感器网络的可扩展性在其路由协议中通常会采用分簇技术。由于无线传感器网络由能量有限的节点组成,网络中节点的能量多为电池供电,因此高效节能以延长网络生命周期是无线传感器网络必须要充分考虑的问题。针对LEACH(低功耗自适应分簇)路由算法在簇首选择时存在的问题,提出一种改进建议。对改进算法利用仿真工具NS2进行仿真,并对节点存活率和网络能耗两个方面进行比较与分析,仿真结果表明,改进算法很好地延长了网络的寿命。     

安全高效的无线传感器网络远程身份验证协议

针对无线传感器网络节点资源受限及通信链路易出错的问题,给出一种安全高效的无线传感器网络远程身份验证协议.该协议采用集中式基于簇的分层无线传感器网络选出最优百分比的簇头,并对其与相邻节点的通信进行授权,再最小化节点能耗实现网络负载平衡,然后每个簇头作为服务器在每个传递消息的有效负载内保证数据认证与交换,对相邻节点进行身份...     

Stable-Aware Evolutionary Routing Protocol for Wireless Sensor Networks

In real life scenario for wireless sensor networks (WSNs), energy heterogeneity among the sensor nodes due to uneven terrain, connectivity failure, and packet dropping is a crucial factor that triggered the race for developing robust and reliable routing protocols. Prolonging the time interval before the death of the first sensor node, viz. the stability period, is critical for many applications where the feedback from the WSN must be reliable. Although Low Energy Adaptive Clustering Hierarchy (LEACH) and LEACH-like protocols are fundamental and popular clustering protocols to manage the system’s energy and thus to prolong the lifespan of the network, they assume a near to a perfect energy homogeneous system where a node failure, drainage and re-energizing are typically not considered. More recent protocols like Stable Election Protocol (SEP) considers the reverse, i.e., energy heterogeneity, and properly utilizes the extra energy to guarantee a stable and reliable performance of the network system. While paradigms of computational intelligence such as evolutionary algorithms (EAs) have attracted significant attention in recent years to address various WSN’s challenges such as nodes deployment and localization, data fusion and aggregation, security and routing, they did not (to the best of our knowledge) explore the possibility of maintaining heterogeneous-aware energy consumption to guarantee a reliable and robust routing protocol design. By this, a new protocol named stable-aware evolutionary routing protocol (SAERP), is proposed in this paper to ensure maximum stability and minimum instability periods for both homogeneous/heterogeneous WSNs. SAERP introduces an evolutionary modeling, where the cluster head election probability becomes more efficient, to well maintain balanced energy consumption in both energy homogeneous and heterogeneous settings. The performance of SAERP over simulation for 90 WSNs is evaluated and compared to well known LEACH and SEP protocols. We found that SAERP is more robust and always ensures longer stability period and shorter instability period.     

An Energy-Efficient Threshold-Based Clustering Protocol for Wireless Sensor Networks

Energy-constrained wireless sensor networks (WSNs) have been deployed widely for monitoring and surveillance purposes. Since sensor nodes (SNs) have significant power constraints (battery life), energy-efficient protocols must be employed to prolong the network lifetime. In this paper, we propose an energy-efficient protocol which provides a new way of creating distributed clusters. This protocol is a modified version of Low Energy Adaptive Clustering Hierarchy (LEACH) protocol. The experimental results show that our protocol that takes into account both the residual energy at each SN and the distance between the SNs outperforms LEACH protocol in terms of first node death time and average residual energy.     

An efficient elite group-based routing protocol for wireless sensor network

ABSTRACT

In recent days, due to the wide verities of applications of Wireless Sensor Networks, it gets recognition from research communities. As the sensor nodes are operated through limited battery capacity, how to utilise the battery power or energy in an optimum way is a major concern. In this paper, we have addressed the energy issue of wireless sensor networks. We have developed an energy-efficient routing protocol. This paper proposes the Novel Elite group concept where the cluster-head selection process is restricted to only a few high-energy nodes rather than all nodes in the network, which substantially reduces the number of cluster-head selection overhead in every iteration, decreases the energy consumption and increases network lifetime. Our method is compared with three well-known routing protocols, i.e. EECRP (Energy Efficient Centroid-Based Routing Protocol) protocol, NCBR (New Cooperative Balancing Routing Protocol) and Mod-LEACH (Modified low-Energy Adaptive Clustering Hierarchy Protocol). We have conducted a simulation in NS-2 simulator. We have computed various network quality parameters like Throughput, transmission delay, analysis of the number of dead nodes (reciprocal of alive nodes) and energy dissipation with respect to the number of simulation rounds. The simulation results show that our proposed methodology outperforms the rest of the protocol.     

Survey on cluster-based routing protocols for cognitive radio sensor networks

Routing protocols could achieve efficient convergecast transmission of sensed data in cognitive radio sensor network (CRSN),and it is of vital importance for the whole network performance.In particular,cluster-based routing protocols could further lower routing selection complexity and improve scalability.Therefore,an overview of cluster-based routing protocols for CRSN was provided.Firstly,after a brief introduction to the concept and advantages of clustering in CRSN,the major factors concerning clustering algorithm design were pointed out.Secondly,the challenges faced by routing protocol design in CRSN and basic design principles were explored.Thirdly,the previous work of cluster-based routing protocols for CRSN was systematically analyzed and summarized.Finally,issues that require urgent solutions and future research directions were suggested.