基于剩余能量和睡眠控制的改进LEACH算法

无线传感器网络（WSN）路由协议研究的一个重要的目标是如何在有限的能源下降低整个网络的能耗,提高网络的生存时间。以分簇路由协议LEACH为研究基础,提出了一种改进算法。该算法改进了簇首选择规则,引入协调件协议算法,通过在成簇阶段降低剩余能量低的节点被选择成为簇首的概率,在稳定运行阶段使簇首节点尽可能多的保持睡眠状态,从而降低了网络能耗。仿真结果表明,与原LEACH算法相比,改进的算法能够明显地延长网络生存时间。     

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

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

一种基于剩余能量的LEACH算法改进

分析了LEACH(Low-EnergyAdaptiveClusteringHierarchy)路由协议,提出了一种改进算法。该算法在LEACH协议的基础上,同时考虑到节点剩余能量与初始能量的比值,对簇首的选举概率加以改进,修正了原协议的簇首选举概率公式。在改进公式中选择不同的调节参数,分别进行了模拟仿真试验。结果表明,改进后的算法降低了整个网络能量消耗,延长了网络的生存周期。     

一种基于位置和能量的WSN改进分簇协议

针对LEACH分簇路由协议中簇首随机选择,没有考虑节点的剩余能量和地理位置,可能导致分簇和网络能耗不均衡这一问题,研究了一种同时考虑了节点位置和剩余能量信息的改进分簇路由协议,使成为簇头的节点在簇的中心位置,从而使簇头在簇内的位置更加合理,避免了簇内的部分节点由于离簇头过远,增加传输损耗的缺点,有利于网络性能的提高。仿真结果表明,研究的分簇路由协议能使簇的划分更加均匀,能量的消耗更加节省,从而延长了WSN网络的生存时间。     

基于LEACH协议簇头选择研究与改进

在无线传感器网络中,传统的分簇路由协议的簇头选择不合理以及簇头到sink节点采用单跳传输,导致距离sink节点的簇头节点过快死亡,从而使整个网络的寿命降低。通过综合考虑节点的剩余能量、当选簇头的次数以及距离的影响修正Leach协议中节点成为簇头的概率,同时簇头到sink节点之间采用最短径传输数据。在MATLAB平台下,对节点死亡个数以及节点剩余能量与轮数关系进行仿真。仿真结果表明改进的算法能更好地均衡网络节点的能量、延长无线传感器网络的寿命。     

无线传感器网络LEACH协议的改进方案

基于LEACH协议,提出了一种改进方案,对LEACH协议的不足进行了改善。此方案中,簇头的选择取决于节点的剩余能量,且簇头数量与网络中的剩余节点数量相关,更符合网络特性。此外,改进方案对簇中节点数量进行了限制,使得分簇更加均匀,并采用了适应性信道分配原则,更加适用于动态网络。计算机仿真结果表明,与LEACH协议相比,采用改进方案后汇聚节点接收到的数据量明显增加,网络性能得到改善。     

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

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

一种新的无线可充电传感器网络分簇算法

为了弥补现有无线可充电传感器网络充电效率低下和节点能量冗余并存的问题,提出了一种基于节点信息的分簇算法。首先,根据传感器节点的剩余能量状态,选择候选簇首。其次,计算候选簇首集合中节点之间的距离,并与基于节点密度的距离阈值比较,最终筛选出合适的簇首。其他节点根据就近原则选择簇首,形成对应的簇。该算法由于同时考虑节点剩余能量和簇首之间的距离,可以使得具有较多剩余能量的节点成为簇首,且簇首均匀分布整个网络中。仿真结果表明,提出的算法可以提高充电效率,减少节点的能量冗余或节点能量消耗过快而死亡的现象,从而有效延长整个网络的寿命。     

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

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

无线传感器网络中簇首选择算法研究

传统的低功耗自适应集簇分层型协议（LEACH）算法在选择簇首时未能考虑到节点剩余能量对网络寿命的影响,使得簇首分布不够合理。为了克服该问题,在完全分布式成簇算法（HEED）协议的基础上,设计了一种根据节点剩余能量选择簇首的算法。在该算法中,剩余能量越大的节点越有可能成为簇首,进而承担更多数据传输责任,能量消耗更加平均,增强了算法的健壮性。仿真结果证实,提出的算法可以有效提高网络能量的使用效率,减少功耗,延长网络生存时间。     

基于改进SSA优化WSN分簇协议

无线传感器网络(Wireless Sensor Networks,WSN)的路由协议是无线传感器网络领域中的一个研究热点.针对LEACH协议的不足,提出一种基于自适应t分布改进麻雀搜索算法(Improved Sparrow Search Algorithm,ISSA)的改进LEACH协议(LEACH?ISSA),以解决...     

Clustering Based Two Dimensional Motion of Sink Node in Wireless Sensor Networks

The wireless sensor network (WSN) is always known for its limited-energy issues and finding a good solution for energy minimization in WSNs is still a concern for researchers. Implementing mobility to the sink node is used widely for energy conservation or minimization in WSNs which reduces the distance between sink and communicating nodes. In this paper, with the intention to conserve energy from the sensor nodes, we designed a clustering based routing protocol implementing a mobile sink called ‘two dimensional motion of sink node (TDMS)’. In TDMS, each normal sensor node collects data and send it to their respective leader node called cluster head (CH). The sink moves in the two dimensional direction to collect final data from all CH nodes, particularly it moves in the direction to that CH which has the minimum remaining energy. The proposed protocol is validated through rigorous simulation using MATLAB and comparisons have been made with WSN’s existing static sink and mobile sink routing protocols over two different geographical square dimensions of the network. Here, we found that TDMS model gives the optimal result on energy dissipation per round and increased network lifetime.

     

基于冗余节点的LEACH协议的改进

无线传感器网络中LEACH协议是一种典型的能有效延长网络生命周期的节能通信协议。因为其优秀的节能效果和其简单的规程得到了广泛的认可。但是LEACH簇头算法存在簇头开销大、簇头没有确定的数量和位置等不足。而在成簇后的稳定阶段,节点通过一跳通信将数据传送给簇头,簇头也通过一跳通信将聚合后的数据传送给基站,这样会造成簇头节点...     

无线传感器网络的分区异构分簇协议研究

针对无线传感器网络能量受限和路由协议中节点能量消耗不均衡的问题,提出一种新的无线传感器网络的分区异构分簇协议(PHC协议).该协议的核心是将3种不同能量等级的节点根据能量的不同分别部署在不同区域,能量较高的高级节点和中间节点使用聚类技术通过簇头直接传输数据到汇聚点,能量较低的普通节点则直接传输数据到汇聚点.仿真结果表明,该协议通过对节点合理的分配部署,使簇头分布均匀,更好地均衡了节点的能量消耗,延长了网络的稳定期,提高了网络的吞吐量,增强了网络的整体性能.     

一种基于LEACH的无线传感器网络路由算法及仿真

在低功耗自适应分簇（LEACH,Low Energy Adaptive Clustering Hierarch）算法中,由于每一轮循环都要重新构造簇,距离较远的簇头节点可能会因长距离发送数据而过早耗尽自身能量,能量较低的节点当选为簇头节点时将会加速该节点的死亡,影响整个网络的生命周期。针对LEACH算法分簇机制中存在的不足,提出了一种改进的路由算法。仿真结果表明,改进算法通过考虑节点的剩余能量与固定分簇的方法,有效的改善了网络能量均衡,提高了网络生存时间。     

Energy Efficient Clustering Scheme (EECS) for Wireless Sensor Network with Mobile Sink

The participants in the Wireless Sensor Network (WSN) are highly resource constraint in nature. The clustering approach in the WSN supports a large-scale monitoring with ease to the user. The node near the sink depletes the energy, forming energy holes in the network. The mobility of the sink creates a major challenge in reliable and energy efficient data communication towards the sink. Hence, a new energy efficient routing protocol is needed to serve the use of networks with a mobile sink. The primary objective of the proposed work is to enhance the lifetime of the network and to increase the packet delivered to mobile sink in the network. The residual energy of the node, distance, and the data overhead are taken into account for selection of cluster head in this proposed Energy Efficient Clustering Scheme (EECS). The waiting time of the mobile sink is estimated. Based on the mobility model, the role of the sensor node is realized as finite state machine and the state transition is realized through Markov model. The proposed EECS algorithm is also been compared with Modified-Low Energy Adaptive Clustering Hierarchy (MOD-LEACH) and Gateway-based Energy-Aware multi-hop Routing protocol algorithms (M-GEAR). The proposed EECS algorithm outperforms the MOD-LEACH algorithm by 1.78 times in terms of lifetime and 1.103 times in terms of throughput. The EECS algorithm promotes unequal clustering by avoiding the energy hole and the HOT SPOT issues.     

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

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

Fuzzy-based unequal clustering protocol for underwater wireless sensor networks

Underwater wireless sensor network (UWSN) is a network made up of underwater sensor nodes, anchor nodes, surface sink nodes or surface stations, and the offshore sink node. Energy consumption, limited bandwidth, propagation delay, high bit error rate, stability, scalability, and network lifetime are the key challenges related to underwater wireless sensor networks. Clustering is used to mitigate these issues. In this work, fuzzy-based unequal clustering protocol (FBUCP) is proposed that does cluster head selection using fuzzy logic as it can deal with the uncertainties of the harsh atmosphere in the water. Cluster heads are selected using linguistic input variables like distance to the surface sink node, residual energy, and node density and linguistic output variables like cluster head advertisement radius and rank of underwater sensor nodes. Unequal clustering is used to have an unequal size of the cluster which deals with the problem of excess energy usage of the underwater sensor nodes near the surface sink node, called the hot spot problem. Data gathered by the cluster heads are transmitted to the surface sink node using neighboring cluster heads in the direction of the surface sink node. Dijkstra's shortest path algorithm is used for multi-hop and inter-cluster routing. The FBUCP is compared with the LEACH-UWSN, CDBR, and FBCA protocols for underwater wireless sensor networks. A comparative analysis shows that in first node dies, the FBUCP is up to 80% better, has 64.86% more network lifetime, has 91% more number of packets transmitted to the surface sink node, and is up to 58.81% more energy efficient than LEACH-UWSN, CDBR, and FBCA.     

基于灰色关联度的Leach算法的改进

Leach算法是无线传感器网络中应用最为广泛的分簇路由协议之一,但是该算法的簇头是随机产生的,有可能导致节点过早死亡,从而使整个网络崩溃。针对这一问题,提出一种基于优选簇头的改进Leach算法——gc Leach算法。改进算法引入灰色关联度思想对簇头进行分区选举,兼顾考虑了簇头的剩余能量以及位置分布,有效地避免了簇头分布不合理,以及簇头剩余能量过低导致的节点过早死亡的情况。仿真结果表明,改进后的gc Leach算法能够有效地降低网络能耗,延长网络生命周期。     

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.