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

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

无线传感器网络路由协议与改进

详细介绍无线传感器网络(WSN)的两种代表性协议:信息协商传感器(SPIN)协议和低能量自适应分簇路由(LEACH)协议的概念、原理和优缺点.提出路由协议中需要进一步解决的问题.改进的WSN路由算法应尽可能降低节点能耗.以延长网络生存时间.     

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

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

无线传感器网络路由协议与改进

详细介绍无线传感器网（WSN）两种代表性协议：信息协商传感器（SPIN）协议和低能量自适应分簇路由（LEACH）协议的概念、原理和优缺点。提出路由协议中需要进一步解决的问题。改进的WSN路由算法应尽可能降低节点能耗,以延长网络生存时间。     

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

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

基于节点位置的无线传感器网络分簇路由协议

针对LEACH协议生成非均匀簇造成能量损耗的问题,以网络簇头分布最优和降低能量损耗为目的,从选择簇头节点、形成簇、簇间路由等方面做了改进。经过理论分析和仿真实验与LEACH和LEACH-C算法比较,结果表明,该路由协议的设计使各节点较均衡地消耗能量,节点生存时间更长,延长了整个无线传感器网络的生命周期。     

无线传感器网络LEACH路由协议的簇头多跳算法

LEACH路由协议作为无线传感器网络常用的一种路由协议,存在簇头分布不均、网络拓扑及能量消耗不均衡等问题,不能有效的降低无线传感器网络的节能能耗和延长网络生存时间。针对这些问题,在LEACH协议基础上发展出一种新的协议---簇头多跳算法。     

LEACH协议的改进与仿真分析

在深入分析无线传感器网络路由协议设计目标的基础上,由于低功耗自适应分簇路由协议（LEACH,Low Energy Adaptive Clustering Hierarchy）簇头既要融合簇内节点发送来的数据又要将处理后的数据发送给基站,导致能量消耗较大。因此融入负载平衡和簇内成链的思想对LEACH协议进行改进,通过贪婪算法使簇内节点数据传输采用链式传输,让簇头工作时间尽量延长,使簇的稳定阶段时间提高,全网节点负载均衡。通过NS2对改进的LEACH协议进行仿真分析,结果表明改进的LEACH协议网络寿命极大延长。     

基于分簇的WSN路由算法研究及改进

为了更好地满足无线传感器网络（WSN）低功耗的要求,延长网络的生存周期。对WSN分簇路由算法LEACH（低功耗自适应分簇）的簇头节点选择机制进行改进,提出了改进算法LEACH-IMP,实现减少网络能耗、延长网络生存周期的目的。利用网络仿真工具NS2进行仿真,对LEACH算法与改进算法进行比较与分析,仿真结果表明,改进算法有效地延长了网络的生存周期。     

无线传感器网络中基于位置信息的低能耗路由算法简

许多研究表明,优秀的分簇路由算法能够有效的延长传感器网络的使用时间。在分析典型的分簇路由算法LEACH存在问题的基础上,提出了基于位置信息的低能耗路由算法,该算法在LEACH算法的簇头选取机制上进行了改进,综合考虑了位置和能量等信息,仿真实验表明,新算法较LEACH算法能更好的降低能耗,均衡网络能量,延长网络使用时间。     

Energy optimized micro genetic algorithm based LEACH protocol for WSN

This article presents the design, analyses and implementation of the novel routing protocol for energy optimization based on LEACH for WSN. Network Lifetime is the major problem in various routing protocols used in WSN. In order to overcome that problem, our proposed routing protocol is developed, which is a combination of Micro Genetic algorithm with LEACH protocol. Our proposed µGA-LEACH protocol, strengthen the cluster head (CH) selection and also reduce the energy consumption of the network when compared to existing protocols. This paper shows the improvement of network lifetime and energy consumption with the optimal CH selection based on a micro genetic algorithm and also compared the results with an existing hierarchical routing protocol like LEACH, LEACH-C, LEACH GA and GADA LEACH routing protocol with various packet sizes, and initial energy.

     

Double Cluster Based Energy Efficient Routing Protocol for Wireless Sensor Network

Reducing the energy consumption of sensor nodes and prolonging the life of the network is the central topic in the research of wireless sensor network (WSN) protocol. The low-energy adaptive clustering hierarchy (LEACH) is one of the hierarchical routing protocols designed for communication in WSNs. LEACH is clustering based protocol that utilizes randomized rotation of local cluster-heads to evenly distribute the energy load among the sensors in the network. But LEACH is based on the assumption that each sensor nodes contain equal amount of energy which is not valid in real scenarios. A developed routing protocol named as DL-LEACH is proposed. The DL-LEACH protocol cluster head election considers residual energy of nodes, distance from node to the base station and neighbor nodes, which makes cluster head election reasonable and node energy consumption balance. The simulation results of proposed protocols are compared for its network life time in MATLAB with LEACH protocol. The DL-LEACH is prolong the network life cycle by 75 % than LEACH.     

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

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

A new algorithm for cluster head selection in LEACH protocol for wireless sensor networks

In wireless sensor network, a large number of sensor nodes are distributed to cover a certain area. Sensor node is little in size with restricted processing power, memory, and limited battery life. Because of restricted battery power, wireless sensor network needs to broaden the system lifetime by reducing the energy consumption. A clustering‐based protocols adapt the use of energy by giving a balance to all nodes to become a cluster head. In this paper, we concentrate on a recent hierarchical routing protocols, which are depending on LEACH protocol to enhance its performance and increase the lifetime of wireless sensor network. So our enhanced protocol called Node Ranked–LEACH is proposed. Our proposed protocol improves the total network lifetime based on node rank algorithm. Node rank algorithm depends on both path cost and number of links between nodes to select the cluster head of each cluster. This enhancement reflects the real weight of specific node to success and can be represented as a cluster head. The proposed algorithm overcomes the random process selection, which leads to unexpected fail for some cluster heads in other LEACH versions, and it gives a good performance in the network lifetime and energy consumption comparing with previous version of LEACH protocols.     

Energy Efficient Cluster Based Routing Protocol Using Charged System Harmony Search Algorithm in WSN

In general, Wireless Sensor Networks (WSNs) is developed with a group of distributed and locative sensor nodes for sensing different environmental conditions. The primary challenges faced by WSN are: low network time and transmission data delay. In crucial applications like monitoring the ecosystem, military and disaster management, and data routing, the incorporation of WSN is very critical. Henceforth, a Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol was proposed but it was found to be uneconomical for energy management. Also, the optimization of Cluster Head (CH) is considered as NP hard problem. This research work deals the issues in optimal path selection in routing of wireless sensor networks to increase the network lifetime. Various techniques are available in metaheuristics, such as the Charged System Search (CSS), that effectively used to resolve the routing problem. Despite of this, most of the meta-heuristics suffer from local optima issues. A charged system search and harmony search algorithm based routing protocol is presented in this research work. Experimental results present the efficient performance of proposed HS model with increased cluster structures, improved network lifetime and reduced end-to-end delay and average packet loss rate.

     

An Improved Fuzzy Unequal Clustering Algorithm for Wireless Sensor Network

This paper introduces IFUC, which is an Improved Fuzzy Unequal Clustering scheme for large scale wireless sensor networks (WSNs).It aims to balance the energy consumption and prolong the network lifetime. Our approach focuses on energy efficient clustering scheme and inter-cluster routing protocol. On the one hand, considering each node’s local information such as energy level, distance to base station and local density, we use fuzzy logic system to determine each node’s chance of becoming cluster head and estimate the cluster head competence radius. On the other hand, we use Ant Colony Optimization (ACO) method to construct the energy-aware routing between cluster heads and base station. It reduces and balances the energy consumption of cluster heads and solves the hot spots problem that occurs in multi-hop WSN routing protocol to a large extent. The validation experiment results have indicated that the proposed clustering scheme performs much better than many other methods such as LEACH, CHEF and EEUC.     

基于移动Agent的LEACH协议的研究与改进

无线传感器网络中路由协议最重要的设计目标是避免节点过早死亡,延长网络生存时间。文中在原有层次式路由协议LEACH的基础上,提出了一种新的MA-LEACH（Mobile Agent LEACH）路由协议,MA—LEACH中引入了移动Agent计算模式,避免了大量的感知数据在网络中传输,由移动Agent移动到感知节点进行本地处理。仿真实验表明,MA-LEACH比原有LEACH协议在降低节点能耗,延长网络寿命等方面上有了显著提高。     

Impact of the energy-based and location-based LEACH secondary cluster aggregation on WSN lifetime

The improvement of sensor networks’ lifetime has been a major research challenge in recent years. This is because sensor nodes are battery powered and may be difficult to replace when deployed. Low energy adaptive clustering hierarchical (LEACH) routing protocol was proposed to prolong sensor nodes lifetime by dividing the network into clusters. In each cluster, a cluster head (CH) node receives and aggregates data from other nodes. However, CH nodes in LEACH are randomly elected which leads to a rapid loss of network energy. This energy loss occurs when the CH has a low energy level or when it is far from the BS. LEACH with two level cluster head (LEACH-TLCH) protocol deploys a secondary cluster head (2CH) to relieve the cluster head burden in these circumstances. However, in LEACH-TLCH the optimal distance of CH to base station (BS), and the choicest CH energy level for the 2CH to be deployed for achieving an optimal network lifetime was not considered. After a survey of related literature, we improved on LEACH-TLCH by investigating the conditions set to deploy the 2CH for an optimal network lifetime. Experiments were conducted to indicate how the 2CH impacts on the network at different CH energy levels and (or) CH distance to BS. This, is referred to as factor-based LEACH (FLEACH). Investigations in FLEACH show that as CHs gets farther from the BS, the use of a 2CH extends the network lifetime. Similarly, an increased lifetime also results as the CH energy decreases when the 2CH is deployed. We further propose FLEACH-E which uses a deterministic CH selection with the deployment of 2CH from the outset of network operation. Results show an improved performance over existing state-of-the-art homogeneous routing protocols.     

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

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