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

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

一种改进的多簇头路由协议

传统分簇路由协议轮叫调度算法(RRCH)只进行一次簇的建立过程,当需要更换簇头时,在每个簇内选举一个剩余能量最高的成员节点作为下一轮的簇头。但是每轮只为每个簇选择一个簇头,且可能分布在簇的边缘,这将导致簇头节点能量浪费。提出了一种多簇头路由算法(MCHB),其主要思想是在簇的形成阶段为每个簇中选择2个簇头,由这2个簇头承担能耗,防止了单一簇头节点过早死亡。算法仿真结果表明,与传统算法RRCH相比,改进后的多簇头路由协议延长了约30%的网络寿命,大大降低了能耗。     

基于多级能量阈值的簇头更新策略

簇路由是节省无线传感网络(WSNs)能量的有效策略。簇头的选择是簇路由的关键。然而,传统的簇路由是采用固定周期更新簇头,并没有考虑到簇头的剩余能量。为此,针对稳定簇头选择协议(SEP)进行改进,提出基于多级能量阈值的簇头更新策略,记为I-SEP。I-SEP路由考虑三类节点,这三类节点的初始能量不同。并针对三类节点的能量以及比例,计算它们成为簇头的概率和阈值。同时,每轮计算簇头的剩余能量,只有簇头剩余能量小于预定的阈值,才进行簇头更新,否则原来的簇头仍作为簇头,进而减少了更换簇头所带来的能耗。仿真结果表明,相比于SEP,提出的I-SEP路由有效地降低了能耗,延长了网络寿命。     

一种基于能量和距离的无线传感器网络分簇路由协议

在无线传感器网络的路由技术中,基于簇的路由算法在拓扑管理、能耗利用、数据融合等方面都有较强的优势.在分析EECS协议的基础上,提出了EECS协议存在的问题,并相应地修改了成簇算法,设计了ADEECS协议,增强了算法的能量均衡性能.在簇头选举阶段总是选择剩余能量最多的节点,在成簇阶段ADEECS协议同时考虑了节点的剩余能量和节点与基站的距离.仿真结果也证明了ADEECS协议相对于EECS很大地提高了网络的生命周期.     

一种多媒体传感器网络低能耗分簇协议

多媒体传感器网络面临的主要挑战是在能量受限的情况下传输大量数据。在经典分簇协议LEACH的基础上,提出一种考虑数据量的多媒体传感器网络低能耗分簇协议。在簇头选举阶段,选择剩余能量多和数据量大的节点作为簇头;在成簇阶段,同时考虑节点到簇头的通信距离和节点的数据量让节点加入簇。仿真结果表明,提出的协议能有效提高网络的生命周期。     

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

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

基于全局信息的LEACH协议改进算法

传统LEACH协议在选举簇头节点时,采用动态簇头选举算法,每轮选举产生簇头节点个数为最佳簇头数的概率并不是最大,使得每轮选举的簇头数偏差较大,不能使节点能量达到最优化。针对这一问题,提出了改进的LEACH-P协议,该协议在簇头选举阶段通过簇头节点间的相互协作,以少量的能量消耗来获取全局信息,消除了LEACH协议簇头选举算法的盲目性,从而改善簇头选举算法。实验结果表明,LEACH—P协议相比传统LEACH协议有效地节省了节点能量,延长了网络生命周期。     

基于簇头间距均匀部署的LEACH协议改进算法

针对无线传感器网络中各节点能量消耗和簇头节点位置分布不均导致网络寿命下降的问题,在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.     

A Green Clustering Protocol for Mobile Sensor Network Using Particle Swarm Optimization

Energy consumption of sensor nodes is one of the crucial issues in prolonging the lifetime of wireless sensor networks. One of the methods that can improve the utilization of sensor nodes batteries is the clustering method. In this paper, we propose a green clustering protocol for mobile sensor networks using particle swarm optimization (PSO) algorithm. We define a new fitness function that can optimize the energy consumption of the whole network and minimize the relative distance between cluster heads and their respective member nodes. We also take into account the mobility factor when defining the cluster membership, so that the sensor nodes can join the cluster that has the similar mobility pattern. The performance of the proposed protocol is compared with well-known clustering protocols developed for wireless sensor networks such as LEACH (low-energy adaptive clustering hierarchy) and protocols designed for sensor networks with mobile nodes called CM-IR (clustering mobility-invalid round). In addition, we also modify the improved version of LEACH called MLEACH-C, so that it is applicable to the mobile sensor nodes environment. Simulation results demonstrate that the proposed protocol using PSO algorithm can improve the energy consumption of the network, achieve better network lifetime, and increase the data delivered at the base station.     

Non-interference topology scheme in wireless sensor networks

A novel topology scheme, cell with multiple mobile sinks method (CMMSM), is proposed in this article for the collection of information and for the environment monitoring in wireless sensor networks. The system consists of many static sensors, scattered in a large scale sensing field and multiple mobile sinks, cruising among the clusters. Conservation of energy and simplification of protocol are important design considerations in this scheme. The noninterference topology scheme largely simplifies the full-distributed communication protocol with the ability of collision avoidance and random routing. The total number of cluster heads in such a topology was analyzed, and then an approximate evaluation of the total energy consumption in one round was carried out. Simulation results show that CMMSM can save considerable energy and obtain higher throughput than low-energy adaptive clustering hierarchy (LEACH) and geographical adaptive fidelity (GAF).     

一种基于LEACH的改进分簇路由协议

经典LEACH算法在每轮数据传输过程中,所有子节点均向汇聚节点传输数据,成员节点充当簇头次数不均匀,导致信息冗余与节点能量浪费,使网络生存时间变短。针对这一问题,提出了一种基于部分成员节点随机转发机制的分簇算法,让子节点在数据传输过程中,按照均匀分布规律,选择部分节点工作。仿真结果显示,与经典的LEACH算法相比,改进后的协议延长了约38%的网络寿命,推迟了第一节点死亡时间约13%,大大地降低了能耗。在大规模网络仿真方面,优势更明显。     

Two-Level Linear Clustering Protocol Based on Wireless Sensor Networks

Aiming at the defects of the nodes in the low energy adaptive clustering hierarchy (LEACH) protocol, such as high energy consumption and uneven energy consumption, a two-level linear clustering protocol is built. The protocol improves the way of the nodes distribution at random. The terminal nodes which have not been a two-level cluster head in the cluster can compete with the principle of equivalent possibility, and on the basis of the rest energy of nodes the two-level cluster head is selected at last. The single hop within the cluster and single hop or multiple hops between clusters are used. Simulation experiment results show that the performance of the two-level linear clustering protocol applied to the Hexi corridor agricultural field is superior to that of the LEACH protocol in the survival time of network nodes, the ratio of success, and the remaining energy of network nodes.     

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

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

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

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