一种基于LEACH协议改进的簇间多跳路由协议

为了均衡无线传感器网络的能量消耗,延长网络的生存时间,在研究几种基于均匀分簇和非均匀分簇的路由协议基础上,提出一种基于LEACH协议改进的簇间多跳路由协议。该协议引入能量因子和距离因子修正了LEACH协议的阈值函数。在簇间通信过程,簇头节点与Sink节点之间采用多跳通信方式,簇头与簇头之间形成一条通向Sink节点的优化路径。实验结果表明,相比于LEACH协议和EEUC协议,本文提出的新协议能够有效的均衡网络的能量消耗,延长无线传感器网络的寿命。     

一种基于LEAC日协议的分簇路由算法

低能自适应聚类路由协议(LEACH协议)是为无线传感器网络设计的一种低功耗自适应分层路由协议,具有延长网络生命时间的作用.为了均衡无线传感器网络节点的能耗,延长整个网络的生命周期,通过对LEACH协议的研究,对簇首的选取和簇首与Sink的通信机制进行优化,提出了一种改进的LEACH协议的分簇路由算法.通过Madab仿真实验证明,改进后的LEACH算法在网络生命周期和网络能量消耗等方面比LEACH算法有较大的提高.     

基于LEACH协议节能路由算法的研究与优化

针对LEACH(Low-Energy Adaptive Clustering Hierarchy)协议在分簇算法中存在的未考虑节点的剩余能量,簇头节点分布位置不合理等缺陷,提出基于LEACH协议的节能路由改进算法。在原有协议的基础上,优化了成簇的条件,充分考虑了剩余能量与相对位置,使得无线传感器网络的寿命得到进一步延长。仿真实验结果表明改进后的算法有效降低了网络能耗,提高了无线传感器网络的性能。     

基于Fuzzy C-Means聚类算法的改进LEACH协议

LEACH协议是一种被广泛应用到无线传感器网络中的路由算法。针对经典LEACH算法存在簇头节点空间分布不均匀和传感器节点能耗不均衡等缺点。提出了一种改进LEACH协议,新的路由算法首先利用Fuzzy C-Means聚类算法和节点位置信息将整个网络分割为多个簇;在每个簇中再利用考虑了节点剩余能量的LEACH算法完成单簇头的选举,以完成数据簇内收集和双跳传输。计算机仿真表明,改进的LEACH协议能均衡网络节点能耗,有效延长整个网络的生存周期。     

基于小样本无梯度学习的无线传感器网络分簇路由方法

针对无线传感器网络由于某些样本数量较少、网络节点间剩余能量差高,导致路由分簇困难、分类准确率低的问题,提出基于小样本无梯度学习的无线传感器网络分簇路由方法。采用条件生成对抗网络处理小样本数据,在有限样本中获取更丰富的信息,通过LEACH协议算法划分无线传感器网络中各传感器节点为簇,通过无梯度学习的GABP算法优化簇首节点和簇首数量,构建无线传感器网络分簇路由方法。实验结果表明,所提方法的簇首数量均分布在4个～7个处,最高网络节点间剩余能量差为0.015 8,网络寿命达到241轮,因此,所提方法能够选择更理想的簇首数量、增强网络能耗均衡性、延长网络寿命。     

LEACH协议的簇头多跳（LEACH-M）改进算法

节能高效的实现路由转发是路由设计的一个关键点。总结了目前已有的无线传感器网络的传输路由模式,发现早先提出的LEACH协议虽是无线传感网中的低功耗自适应分层路由算法,但会造成簇头节点负载过重。成簇算法是传感器网络中减少能量消耗的一种关键技术。提出的是基于LEACH算法的多跳路由改进算法,并在考虑簇头最优个数的选择下,通过采用簇头之间的多跳算法达到减少能量消耗、延长传感网的寿命的目的。实验表明此方法有效。     

基于非均匀分簇的无线传感器网络路由协议设计与研究

针对目前均匀分簇路由协议中存在的簇间能耗不均衡问题和簇首选择的不合理等问题,提出改进方案,形成一个新的无线传感器网络非均匀分簇路由协议UCRP,这个协议充分考虑传感器节点的剩余能量,且基于剩余能量优先选择簇首．并改进LEACH路由协议中单跳通信消耗能量大的缺点。在NS2仿真平台上对协议进行仿真实验,将UCRP算法与原LEACH协议进行比较．结果表明。UCRP算法能很好地均衡网络耗能,并延长网络的生存时间。     

无线传感器路由算法中的仿真研究

在研究无线传感器优化的问题中,传感器的簇首节点选择的合理性直接决定传感器网络寿命的长短.由于传统的算法在确定簇首过程中忽略了邻居节点的状态信息,导致簇内节点过早的出现盲节点,从而降低网络的生存时间.针对传统LEACH 算法能量消耗快、网络生存时间短的缺点,提出了一种改进的 LEACH 算法(ILEACH).在分簇阶段簇首选择时充分考虑节点剩余能量和地理位置因素;在稳定传输阶段,采用改进的簇首间多跳路由机制,并在转发过程中再次进行数据融合.对 ILEACH 算法进行仿真实验,仿真结果表明,与经典分簇路由算法 LEACH 相比,ILEACH 算法有效平衡节点间开销,提高能量有效性,降低了网络整体能耗,有效地延长了网络的寿命.     

一种新的基于LEACH的WSN路由算法

研究无线传感器网络路由算法,无线传感器网络由能量有限的节点组成,因此高效节能的路由算法是无线传感器网络组网的基础.针对低功耗自适应分簇(LEACH)路由算法存在簇首节点选择不合理以及簇首节点与基站在远距离通信过程中能量消耗大的不足,提出了一种改进的LEACH路由算法.改进的算法在簇建立阶段的簇首选举过程中,引入节点剩余能量因素,且进行均匀分簇,有效地降低剩余能量较小和位置不佳节点成为簇首的可能性,均衡了网络的能量消耗,在簇稳定工作阶段,节点间的数据传输采用单跳和多跳相结合的通信方式,从而降低网络能耗.仿真结果表明,与传统的LEACH算法相比,改进的LEACH算法能量均衡性更好,并显著地延长了网络的存活时间.     

无线传感器网络节能路由协议的改进

无线传感器网络中节点的能量主要由电池供给,其能量严重受限.因此,设计新的更加节能的协议来支持无线传感器网络的运行,使网络的有效生存时间尽可能延长成为研究的热点之一.针对延长无线传感器网络的有效生存时间这一问题,展开以下两个方面的研究:第一,对传统的最大连通度分簇路由协议进行改进;第二,对LEACH协议中形成非簇头节点选择最优簇的算法进行改进,使节点在加入簇头时综合考虑距离和能量两方面的因素,实现负载均衡,从而延长网络的生存周期.仿真结果显示,新方法提高了传感器网络的能效,延长了系统的工作寿命.     

基于群智能算法无线传感网络分簇路由协议

无线传感网络路由协议——LEACH协议(Low Energy Adaptive Clustering Hierarchy)是一种经典的分簇路由协议,LEACH协议相比其他平面路由协议生命周期提高15%以上。然而LEACH协议还是存在不少使能耗过大的缺陷,为改进LEACH协议这些缺陷本文提出了一种节能高效的基于群智能算法的智能分簇路由协议SI-CRP协议(Swarm Intelligence-Clustering Routing Protocol)。     

无线传感器网络聚类改进层次路由协议

无线传感器网络（WSN）是一种全新的信息获取和处理技术,通常被部署在恶劣的环境中。因此能源供应一直是WSN研究的一个重要问题。层次路由协议能够有效地延长网络生存时间,已经成为无线传感器网络研究中的热点。提出了一个新的层次路由协议MHLAH,结合了LEACH和HeeD的优点,它能够合理地分布簇头节点,采用多跳的路由传输协议,延长网络的生存时间。仿真实验结果表明,与传统的LEACH和HeeD协议相比,MHLAH协议有效地平衡了网络中传感器节点的能量消耗,延长了无线传感器网络的生存周期。     

A chain-cluster based routing algorithm for wireless sensor networks

Wireless sensor networks (WSNs) are an emerging technology for monitoring physical world. Different from the traditional wireless networks and ad hoc networks, the energy constraint of WSNs makes energy saving become the most important goal of various routing algorithms. For this purpose, a cluster based routing algorithm LEACH (low energy adaptive clustering hierarchy) has been proposed to organize a sensor network into a set of clusters so that the energy consumption can be evenly distributed among all the sensor nodes. Periodical cluster head voting in LEACH, however, consumes non-negligible energy and other resources. While another chain-based algorithm PEGASIS (power- efficient gathering in sensor information systems) can reduce such energy consumption, it causes a longer delay for data transmission. In this paper, we propose a routing algorithm called CCM (Chain-Cluster based Mixed routing), which makes full use of the advantages of LEACH and PEGASIS, and provide improved performance. It divides a WSN into a few chains and runs in two stages. In the first stage, sensor nodes in each chain transmit data to their own chain head node in parallel, using an improved chain routing protocol. In the second stage, all chain head nodes group as a cluster in a self- organized manner, where they transmit fused data to a voted cluster head using the cluster based routing. Experimental results demonstrate that our CCM algorithm outperforms both LEACH and PEGASIS in terms of the product of consumed energy and delay, weighting the overall performance of both energy consumption and transmission delay.     

A new evolutionary based routing protocol for clustered heterogeneous wireless sensor networks

Wireless sensor network (WSN) is a rapidly evolving technological platform with tremendous and novel applications. Recent advances in WSN have led to many new protocols specifically designed for them where energy awareness (i.e. long lived wireless network) is an essential consideration. Most of the attention, however, has been given to the routing protocols since they might differ depending on the application and network architecture. As routing approach with hierarchical structure is realized to successfully provide energy efficient solution, various heuristic clustering algorithms have been proposed. As an attractive WSN routing protocol, LEACH has been widely accepted for its energy efficiency and simplicity. Also, the discipline of meta-heuristics Evolutionary Algorithms (EAs) has been utilized by several researchers to tackle cluster-based routing problem in WSN. These biologically inspired routing mechanisms, e.g., HCR, have proved beneficial in prolonging the WSN lifetime, but unfortunately at the expense of decreasing the stability period of WSN. This is most probably due to the abstract modeling of the EA's clustering fitness function. The aim of this paper is to alleviate the undesirable behavior of the EA when dealing with clustered routing problem in WSN by formulating a new fitness function that incorporates two clustering aspects, viz. cohesion and separation error. Simulation over 20 random heterogeneous WSNs shows that our evolutionary based clustered routing protocol (ERP) always prolongs the network lifetime, preserves more energy as compared to the results obtained using the current heuristics such as LEACH, SEP, and HCR protocols. Additionally, we found that ERP outperforms LEACH and HCR in prolonging the stability period, comparable to SEP performance for heterogeneous networks with 10% extra heterogeneity but requires further heterogeneous-aware modification in the presence of 20% of node heterogeneity.     

面向智慧农业的无线传感器路由协议和节点定位算法研究

随着人类社会的的进步,物联网技术,云计算,区块链,大数据等先进的技术给人类社会的各个方面带来了翻天复地的改变,为了实现农业生产状态的智慧化,无人化管理,基于无线传感器网络技术的农业无线监控系统研究将从无线监控系统的路由协议算法和节点定位算法两方面进行探讨研究。在路由协议算法方面提出了基于划分四边形网格分簇的拓扑控制算法,并从网络拓扑结构,节点死亡、能量消耗三方面和LEACH算法进行对比,从仿真结果可以看出,基于划分四边形网络分簇的算法比LEACH算法性能更优。节点定位算法方面提出基于临时锚节点逐步定位算法,对节点定位算法从不同节点的邻居节点图和节点误差两方面做对比,仿真对比的结果表明农田面积为1000m*1000m,锚节点为50,传感器的数量为200时,网络连通性最大,节点定位误差最小,构建的无线监控系统适合于农田,温室大棚等农业应用。     

基于簇首能量均衡分布的无线传感器网络LEACH协议改进

能量有限性是无线传感器网络(WSN)的最重要的特性,在网络路由算法中也是优先考虑的一个主要因素。分析了传统LEACH算法的不足,并对一些改进协议的LEACH进行认真研究,在此基础上提出了一种新的LEACH改进协议,仿真结果表明,改进后的协议能均衡节点能耗,提高了负载均衡度,并延长了无线传感器网络的生存时间。     

一种无线传感器网络数据安全免疫体系结构

LEACH协议是提出较早、较为完整的无线传感器网络协议之一。在LEACH协议的基础上,借鉴生物免疫系统的原理,提出了一种新的适用于无线传感器网络的免疫体系结构。为构建这个体系,提出了基于覆盖面的备份簇头选举算法,嵌入数字基因的免疫应答算法,以及各状态节点的转换机制。备份簇头的引入,大大降低了恶意簇头对整个簇造成的破坏,免疫应答算法通过各功能节点的相互协作,能够有效地抵御恶意节点的攻击,减小和消除恶意数据的影响。仿真验证了该体系的有效性,在提高了安全性的同时,并不影响网络的生命期。     

C-DTB-CHR: centralized density- and threshold-based cluster head replacement protocols for wireless sensor networks

Advances introduced to electronics and electromagnetics leverage the production of low-cost and small wireless sensors. Wireless sensor networks (WSNs) consist of large amount of sensors equipped with radio frequency capabilities. In WSNs, data routing algorithms can be classified based on the network architecture into flat, direct, and hierarchal algorithms. In hierarchal (clustering) protocols, network is divided into sub-networks in which a node acts as a cluster head, while the rest behave as member nodes. It is worth mentioning that the sensor nodes have limited processing, storage, bandwidth, and energy capabilities. Hence, providing energy-efficient clustering protocol is a substantial research subject for many researchers. Among proposed cluster-based protocols, low-energy adaptive clustering hierarchy (LEACH) and threshold LEACH (T-LEACH), as well as modified threshold-based cluster head replacement (MT-CHR) protocols are of a great interest as of being energy optimized. In this article, we propose two protocols to cluster a WSN through taking advantage of the shortcomings of these protocols (i.e., LEACH, T-LEACH, and MT-CHR), namely centralized density- and threshold-based cluster head replacement (C-DTB-CHR) and C-DTB-CHR with adaptive data distribution (C-DTB-CHR-ADD) protocols that mainly aim at optimizing energy through minimizing the number of re-clustering operations, precluding cluster heads nodes premature death, deactivating some nodes located at dense areas from cluster’s participation, as well as reducing long-distance communications. In particular, in C-DTB-CHR protocol, some nodes belong to dense clusters are put in the sleeping mode based on a certain node active probability, thereby reducing the communications with the cluster heads and consequently prolonging the network lifetime. Moreover, the base station is concerned about setting up the required clusters and accordingly informing sensor nodes along with their corresponding active probability. C-DTB-CHR-ADD protocol provides more energy optimization through adaptive data distribution where direct and multi-hoping communications are possible. Interestingly, our simulation results show impressive improvements over what are closely related in the literature in relation to network lifetime, utilization, and network performance degradation period.     

无线传感器网络中基于节点密度的簇算法

能量有效的路由协议对于无线传感器网络至关重要,它能够延长整个网络的生存时间.首先简要介绍了无线传感器网络中的路由算法,分析了Leach算法的优缺点.在Leach的基础上,结合节点密度,提出了一种基于节点密度的簇算法.算法在选举簇头的过程中,能够根据节点密度均衡划分各个簇的规模,从而平衡各簇的网络负载,降低网络中能量分布的不均.仿真表明,与Leach相比,该算法延长了网络生存时间,降低了能耗.     

一种无线传感器网络路由协议的研究与改进

无线传感器网络由许多具有低功率无线收发装置的传感器节点组成,能够有效地感知、采集和处理网络覆盖区域中的相关信息,并发送给远处的基站进一步处理。由于传感器节点能量有限,路由协议必须尽可能地减少能量消耗,延长网络生命周期。对经典的LEACH路由协议进行研究,并针对簇头节点和基站的通信方式提出改进,用M atlab平台下对LEACH算法和改进后的算法进行仿真分析,结果显示:改进后的算法在延长网络生命周期和减少能量消耗上比LEACH算法有了很大改善。