基于LEACH的WSN节能改进及仿真

如何节约能量,一直是无线传感器网络(WSN)的关键问题.通过将能量问题与无线传感器网络的通信协议进行结合,在低能量自适应聚类(LEACH)协议的基础上进行可行的改进,并采用NS2进行仿真验证.仿真结果表明,与原来的协议LEACH相比,改进后的协议L-NEW能有效地平衡节点能量消耗,延长了网络的生存时间.     

无线传感器网络LEACH协议的研究与改进

无线传感器网络(WSN)的数据传输不能与路由协议分离,高效的能量传输是无线传感器网络中最重要的因素之一。针对LEACH簇头分布的不均匀以及与基站距离的不同,提出了一种改进的LEACH算法,该算法考虑剩余能量和最优簇头,与现有的LEACH协议相比,该协议降低了能耗。     

一种基于LEACH路由协议的改进算法

无线传感器网络的生存时间受传感器节点软硬件条件的限制,改进传感器网络路由协议是延长网络生存时间的有效途径。LEACH协议是最早提出的经典分层路由协议,文中基于LEACH协议提出改进,应用K-medoids算法改进LEACH协议的簇首分簇机制,并通过Matlab仿真实验,证实了改进后的LEACH算法在均衡化网络能耗,延长网络的生命周期方面具有优越性。     

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

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

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

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

基于能量均衡的LEACH改进协议

能量有限性是无线传感器网络（WSN）的最重要的特性,在网络路由算法中也是优先考虑的一个主要因素。LEACH路由协议是无线传感器网络中被广泛应用的分层协议,但其簇头选取的随机性,不可避免的使该协议存在着簇头选择不合理,节点能耗不均衡的缺点。本文对一些LEACH的改进协议进行研究,在此基础上提出了一种新的LEACH改进协议,并通过理论分析证明了该协议的可靠性。     

基于分簇的无线传感器网络安全路由协议研究

无线传感器网络（Wireless Sensor Networks,简称WSNs）作为一种新的获取信息的方式和处理模式,已成为通信领域的研究重点。而路由协议则是无线传感器网络当前的热点研究之一。目前,针对较为典型的分簇式路由协议LEACH路由协议的研究,是无线传感器网络目前研究的一个热点。介绍了无线传感器网络路由协议常见的攻击类型,并从路由安全的角度建议性的提出了一种对LEACH路由协议针对安全性的改进方案,并应用NS2仿真平台,对改进协议做了仿真并进行了性能分析。     

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

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

无线传感器网络功率路由算法研究

无线传感器网络的应用越来越广泛,主要是军事、工业、医疗等方面。然而无线传感器网络具有节点能量、存储和计算能力非常有限等特点,文中在传统的LEACH（低功耗自适应集簇分层型）协议的基础上进行了改进,并提出了一种新的无线传感器网络路由算法LEACH-N。新算法沿用了LEACH协议簇的结构,在簇头选择方法上基于传统DCHS算法的簇头选择算法,簇内成员与簇头之间直接通信,簇头与基站之间轮流进行单跳和多跳通信;多跳通信则是采用一种改进的MTE（最小传输能量）路由算法。通过NS2仿真软件对LEACH-N协议与LEACH协议分别进行了性能测试。实验结果表明,相比LEACH协议,LEACH—N协议系统能耗低、网络生命周期长,且具有更好的规模可扩展性。     

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

介绍了无线传感器网络的概念、特点和应用,以及无线传感器网络中几个代表性的簇类路由协议,包括LEACH以及由LEACH稍加改进的LEACH—EE、DEEAC、LEACH—NEW、LEACH—C,TEEN,PEGASIS。这几种协议都使用了簇的概念,基于不同的应用,在簇头选择、簇内数据传输、簇头间数据传输等方面各有特色。分别介绍了这几种路由算法的基本原理、优缺点,以及它们之间的异同。最后,根据衡量无线传感器网络性能的一些重要标准进行了比较和总结。     

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.     

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

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

无线传感网络中基于蚁群的路由算法

In the wireless sensor networks, high efficient data routing for the limited energy resource networks is an important issue. By introducing Ant-colony algorithm, this paper proposes the wireless sensor network routing algorithm based on LEACH. During the construction of sensor network clusters, to avoid the node premature death because of the energy consumption, only the nodes whose residual energy is higher than the average energy can be chosen as the cluster heads. The method of repeated division is used to divide the clusters in sensor networks so that the numbers of the nodes in each cluster are balanced. The basic thought of ant-colony algorithm is adopted to realize the data routing between the cluster heads and sink nodes, and the maintenance of routing. The analysis and simulation showed that the proposed routing protocol not only can reduce the energy consumption, balance the energy consumption between nodes, but also prolong the network lifetime.     

一种LEACH协议的改进方法

针对无线传感网络中如何有效平衡节点的能量分布,文中在LEACH协议的基础上,提出了一种改进方法,在选取簇头时,考虑簇头在监测区域的平均分布,判断簇头间的距离,大于某一阈值,则确定簇头选取成功。同时将改进后的协议与原LEACH协议进行仿真比较,结果表明,改进后的协议可更有效地进行能量平衡,且到达了延长网络寿命的目的。     

Low-Energy Adaptive Unequal Clustering Protocol Using Fuzzy c-Means in Wireless Sensor Networks

Clustering technique in wireless sensor networks incorporate proper utilization of the limited energy resources of the deployed sensor nodes with the highest residual energy that can be used to gather data and send the information. However, the problem of unbalanced energy consumption exists in a particular cluster node in the network. Some more powerful nodes act as cluster head to control sensor network operation when the network is organized into heterogeneous clusters. It is important to assume that energy consumption of these cluster head nodes is balanced. Often the network is organized into clusters of equal size where cluster head nodes bear unequal loads. Instead in this paper, we proposed a new protocol low-energy adaptive unequal clustering protocol using Fuzzy c-means in wireless sensor networks (LAUCF), an unequal clustering size model for the organization of network based on Fuzzy c-means (FCM) clustering algorithm, which can lead to more uniform energy dissipation among the cluster head nodes, thus increasing network lifetime. A heuristic comparison between our proposed protocol LAUCF and other different energy-aware protocol including low energy adaptive clustering hierarchy (LEACH) has been carried out. Simulation result shows that our proposed heterogeneous clustering approach using FCM protocol is more effective in prolonging the network lifetime compared with LEACH and other protocol for long run.     

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

一种基于LEACH协议的改进算法

作为能量有效、基于层次结构的路由协议的典型代表,LEACH协议存在的不足表现为网络中会出现极大簇和极小簇并存;当节点能量不同时簇头选择不合理;在簇头死亡后簇内节点仍会消耗能量.本文基于LEACH提出了一种改进算法,使用引入簇成员数门限和合并极小簇的方法避免极大簇和极小簇同时存在;通过对簇头能量消耗的估计,在簇头能量耗尽...     

A novel residual energy‐based distributed clustering and routing approach for performance study of wireless sensor network

Non‐uniform energy consumption during operation of a cluster‐based routing protocol for large‐scale wireless sensor networks (WSN) is major area of concern. Unbalanced energy consumption in the wireless network results in early node death and reduces the network lifetime. This is because nodes near the sink are overloaded in terms of data traffic compared with the far away nodes resulting in node deaths. In this work, a novel residual energy–based distributed clustering and routing (REDCR) protocol has been proposed, which allows multi‐hop communication based on cuckoo‐search (CS) algorithm and low‐energy adaptive‐clustering–hierarchy (LEACH) protocol. LEACH protocol allows choice of possible cluster heads by rotation at every round of data transmission by a newly developed objective function based on residual energy of the nodes. The information about the location and energy of the nodes is forwarded to the sink node where CS algorithm is implemented to choose optimal number of cluster heads and their positions in the network. This approach helps in uniform distribution of the cluster heads throughout the network and enhances the network stability. Several case studies have been performed by varying the position of the base stations and by changing the number of nodes in the area of application. The proposed REDCR protocol shows significant improvement by an average of 15% for network throughput, 25% for network scalability, 30% for network stability, 33% for residual energy conservation, and 60% for network lifetime proving this approach to be more acceptable one in near future.     

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.