无线传感器网络能量异构非均匀分簇路由协议

基于分簇的无线传感器网络路由协议,采用多跳路由方式传输数据至基站,容易造成靠近基站的节点转发大量数据而过早失效。另外,分簇协议通常假定网络节点是能量同构的,不能有效解决节点能量异构的问题。因此,从非均匀分簇的角度出发,结合局部竞争簇首机制,提出了一种基于能量异构的分簇协议（EHUC）。仿真结果表明该协议能够有效应用于能量异构的无线传感器网络,并延长网络的生命周期。     

压缩感知的能量异构WSN分簇路由协议

分簇路由协议对用于环境监测的无线传感器网络具有较好的节能性,数据压缩可以减少节点通信的数据量,但增加了分簇层次结构簇头的能耗和汇聚节点算法的复杂度,而由高能力节点担任簇头可以实现能量均衡并改善网络性能。针对无线传感器网络能量异构普遍存在的特点,提出了一种基于压缩感知的能量异构分簇路由协议（CSCH算法）。该算法根据异构节点能量确定多极簇头选举的概率,将簇内节点的信息集中在簇头上,而簇头对所采集的数据进行稀疏、压缩,以减少向汇聚节点传输数据的节点数和通信量,汇聚节点利用重构算法可从来自簇头的少量数据中恢复出信号源。同时设计了一种基于正态分布的权值系数,以优化在数据量过少情况下压缩感知算法的信号重构性能。仿真实验结果表明,该协议不仅能充分利用能量异构资源,均衡网络能耗,延长整个网络生命周期,而且能精确恢复信号源。     

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

针对异构无线传感器网络分簇路由协议存在节点能耗不均衡问题,提出一种基于差分进化算法的路由协议及基于节点能耗的分簇协议。该协议首先以最大化网络中簇头节点的最小生存周期为目标,建立函数优化模型,并采用差分进化算法对其进行优化,从而延长网络整体的生存周期;然后根据节点通信列表中的簇头数目进行分簇,将节点分配给能耗因子较低的簇头,以达到均衡网络能耗的目的,延长普通节点的生存周期。仿真结果表明,基于差分的路由分簇协议能有效均衡网络中节点的能量消耗,显著延长网络的生存周期并提高网络能量利用率。     

一种适用于煤矿井下无线传感网的能量均衡路由协议

矿井无线传感网的拓扑呈长距离带状,节点间能耗不均问题十分严重。非均匀分簇策略能从全局均衡节点能量负载,在矿井中具有良好的适用性。针对矿井传感网的带状特性提出了一个簇规模自适应调节的能量均衡分簇路由协议。协议根据节点离汇聚点的距离、剩余能量及分布密度来构造规模不等的簇。簇首的竞选以节点相对于周围候选者的能量水平为依据,避免了低能量节点被当选为簇首。簇间多跳路由算法依簇首近似线型的分布特点设计,不但考虑链路能耗最优,亦注重转发节点间的能量均衡。模拟实验结果表明,该路由协议显著平衡了网中节点能耗,延长了网络生存时间。     

一种异构传感器网络下的节能分簇路由算法

无线传感器网络存在着严重的能量约束,传统同构的传感网络路由协议和算法不适合异构网络,因此,设计异构传感网络下的节能路由算法具有现实意义。研究两种不同类型传感器节点构成的,具有不同的初始能量和不同感知数据能力的异构网络中基于簇头预测的节能分簇路由算法ECAH。根据簇内节点的剩余能量、能量消耗速率和跟上一轮簇头的距离预测出下一轮簇头,有效地减少了控制报文数量,降低了系统开销,节约了能量。仿真结果显示,在异构的网络中采用ECAH路由算法比LEACH算法网络生存时间大约提高了23%。     

基于剩余能量和距离信息的异构网络分簇协议

针对无线传感网络WSN(Wireless Sensor Network)的网络寿命问题,提出了面向异构网络环境下的基于剩余能量和距离分簇REDC(Residual Energy and Distance Clustering)协议。REDC协议考虑了普通节点、中级节点以及高级节点,具有较高的初始能量节点称为中级节点和高级节点,余下的称为普通节点。在簇头CH(Cluster head)选举中,考虑节点的剩余能量和离基站距离信息,使得具有较高的剩余能量节点、离基站距离较近的节点有更多的机会被选为簇头CH,进而避免了剩余能量较小的节点成头簇头CH而产生节点过早失效缩短网络寿命的问题,平衡了网络内的能量消耗。仿真结果表明,与LEACH、DDEEC和SEP协议相比,提出的REDC协议具有较长的网络寿命和良好的数据传输能力。     

一种能量均衡的无线传感器网络分簇算法*

为了延长网络的生存时间,提出了一种能量均衡的无线传感器网络分簇算法（EBCA）,该算法优先选择剩余能量较多的节点作为簇首,以平衡节点的能量消耗。仿真实验结果表明：无论同构网还是异构网,该算法都能显著地推迟网络第一个节点的死亡时间,其性能明显优于LEACH算法。     

三维固定分簇异构传感网络路由协议

基于高楼三维空间中家居监测的应用背景,提出了一种三维空间中LEACH路由协议的改进算法:三维固定分簇异构传感网络路由协议(3D-FHSR).在3D-FHSR中,使用了异构网络的方式让部分能量充裕的节点固定充当簇头节点,并且事先划分好簇的区域范围,这样减少了簇头选举时的能量消耗,同时增加了整个网络的能量.3D-FHSR还改进了LEACH协议的通信模式,减少簇间长距离通信的次数.仿真结果表明,3D-FHSR协议比LEACH协议更能延长网络的生命周期.     

基于最优分簇的能量异构无线传感器网络路由协议

为了进一步均衡网络能耗,延长网络生命周期,提出了一种基于最优分簇的能量异构无线传感器网络路由协议(OCRP).OCRP协议考虑了最优簇首数K,将待测区域划分为K个固定分区,优化了成簇过程;在簇首选择阶段,充分考虑了节点的剩余能量、整个网络的能量以及节点与基站之间的距离,改进了簇头选举机制.仿真结果表明,该协议在延长网络寿命和能量消耗方面的性能优于EH-LEACH和DEEC路由协议.     

基于节点剩余能量的能量异构网络分簇算法

针对无线传感器网络中如何利用有限能量延长网络生存时间的问题,研究了分簇算法在能量异构传感器网络环境下的性能特点,设计出一种基于节点剩余能量,适用于多级能量异构网络的分簇算法。在该算法的网络簇头选举加权概率中引入了参量γ,使得在簇头选举过程中,具有较高的初始能量和剩余能量的节点在簇头选举过程中当选簇头的机会增多。避免了剩余能量较小的节点担任簇头引起节点过早死亡使网络覆盖度降低的问题,从而均衡消耗网络中的各节点能量,延长网络的生存时间。同时,引入簇头管理机制保证了网络每轮簇头数目的稳定,进而提高了网络的传输质量。实验仿真结果表明,该算法在多级能量异构网络下比LEACH、SEP和DEEC具有较长的网络生存时间和稳定的数据传输能力。     

PEACH: Power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks

The main goal of this research is concerning clustering protocols to minimize the energy consumption of each node, and maximize the network lifetime of wireless sensor networks. However, most existing clustering protocols consume large amounts of energy, incurred by cluster formation overhead and fixed-level clustering, particularly when sensor nodes are densely deployed in wireless sensor networks. In this paper, we propose PEACH protocol, which is a power-efficient and adaptive clustering hierarchy protocol for wireless sensor networks. By using overhearing characteristics of wireless communication, PEACH forms clusters without additional overhead and supports adaptive multi-level clustering. In addition, PEACH can be used for both location-unaware and location-aware wireless sensor networks. The simulation results demonstrate that PEACH significantly minimizes energy consumption of each node and extends the network lifetime, compared with existing clustering protocols. The performance of PEACH is less affected by the distribution of sensor nodes than other clustering protocols.     

异构传感器网络的分布式能量有效成簇算法

为了延长网络的生存时间,需要设计能量有效的协议,以适应传感器网络的特点.成簇算法是传感器网络中减少能量消耗的一种关键技术,它能够增强网络的扩展性和延长网络的生存时间.研究了异构传感器网络中成簇算法在节省能量方面的性能,提出一种适应异构无线传感器网络的分布式能量有效的成簇方案.此方案基于节点剩余能量与网络节点的平均能量的比例来选举簇头节点.较高初始能量和剩余能量的节点比低能量节点拥有更多的机会成为簇头节点,从而使网络能量均匀消耗,延长网络的生存时间.模拟实验结果显示,与现有的重要成簇方案相比,新的成簇算法在异构网络下提供了更长的网络生存时间和更大的网络有效吞吐量.     

T-LEACH: The method of threshold-based cluster head replacement for wireless sensor networks

In wireless sensor networks, power is the most essential resource because each sensor node has limited batteries. Many kinds of existing clustering protocols have been developed to balance and maximize lifetime of the sensor nodes in wireless sensor networks. These protocols select cluster heads periodically, and they considered only ‘How can we select cluster heads energy-efficiently?’ or ‘What is the best selection of cluster heads?’ without considering energy-efficient period of the cluster heads replacement. Unnecessary head selection may dissipate limited battery power of the entire sensor networks. In this paper, we present T-LEACH, which is a threshold-based cluster head replacement scheme for clustering protocols of wireless sensor networks. T-LEACH minimizes the number of cluster head selection by using threshold of residual energy. Reducing the amount of head selection and replacement cost, the lifetime of the entire networks can be extended compared with the existing clustering protocols. Our simulation results show that T-LEACH outperformed LEACH in terms of balancing energy consumption and network lifetime.     

一种基于时间延迟机制的无线传感器网络分簇算法

为了延长网络的生存时间,需要设计能量有效的路由协议以适应传感器网络的特点.成簇算法是传感器网络中减少能量消耗的一种关键技术,它能够提高网络的生存时间.本文提出一种基于时间延迟机制的分簇算法,称为CHTD.该算法建立了节点的时间延迟机制模型,使得能量较多的节点能够在每一轮中被优先选为簇首.同时,通过维持每个节点的簇首信息集合使得每轮产生的簇首数目稳定且位置均匀分布.模拟实验表明,CHTD有效地均衡了网络中节点的能量消耗,并显著地延长了网络的存活时间.     

EEHC: Energy efficient heterogeneous clustered scheme for wireless sensor networks

In recent years, there has been a growing interest in wireless sensor networks. One of the major issues in wireless sensor network is developing an energy-efficient clustering protocol. Hierarchical clustering algorithms are very important in increasing the network’s life time. Each clustering algorithm is composed of two phases, the setup phase and steady state phase. The hot point in these algorithms is the cluster head selection. In this paper, we study the impact of heterogeneity of nodes in terms of their energy in wireless sensor networks that are hierarchically clustered. We assume that a percentage of the population of sensor nodes is equipped with the additional energy resources. We also assume that the sensor nodes are randomly distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. Homogeneous clustering protocols assume that all the sensor nodes are equipped with the same amount of energy and as a result, they cannot take the advantage of the presence of node heterogeneity. Adapting this approach, we introduce an energy efficient heterogeneous clustered scheme for wireless sensor networks based on weighted election probabilities of each node to become a cluster head according to the residual energy in each node. Finally, the simulation results demonstrate that our proposed heterogeneous clustering approach is more effective in prolonging the network lifetime compared with LEACH.     

Research of energy efficient clustering algorithm for multilayer wireless heterogeneous sensor networks prediction research

In designing wireless sensor networks of image transmitting, it is important to reduce energy dissipation and prolong network lifetime. This paper presents the research on existing clustering algorithm applied in heterogeneous sensor networks and then puts forward an energy-efficient prediction clustering algorithm, which is adaptive to sensor networks with energy and objects heterogeneous. This algorithm enables the nodes to select the cluster head according to factors such as energy and communication cost, thus the nodes with higher residual energy have higher probability to become a cluster head than those with lower residual energy, so that the network energy can be dissipated uniformly. In order to reduce energy consumption when broadcasting in clustering phase and prolong network lifetime, an energy consumption prediction model is established for regular data acquisition nodes. Simulation results and the application in image clustering show that compared with current clustering algorithms, this algorithm can achieve longer sensor network lifetime, higher energy efficiency, and superior network monitoring quality.     

CRPD: a novel clustering routing protocol for dynamic wireless sensor networks

A wireless sensor network (WSN) consists of a large number of static or mobile, low-cost, and low-power sensor nodes. And energy is one of the most important factors that should be considered. In this paper, we propose clustering-based routing protocol for dynamic networks (CRPD) to reduce energy consumption and improve energy efficiency through clustering and routing algorithms. The basic idea is to periodically update the network topology and select the node with larger degree and high residual energy as the cluster head to be responsible for data aggregation and transmission. With the nodes moving, joining, and choosing the optimal clustering radius, the energy load of the whole network can be evenly distributed to each sensor node, which can significantly prolong the network lifetime. Extensive simulations show that CRPD is more energy-efficient than the existing protocols.     

一种基于能量和时延的动态分簇算法

在无线传感器网络中,传感器节点的能量由电池提供,有时难以更换。因此,降低能耗是目前无线传感器网络设计中一个很重要的技术问题。通过对层次型路由协议的研究,提出了一种基于能量和时延的动态分簇算法,该算法通过动态地确定每一轮数据收集时无线传感器网络中的簇头数目,从而在满足不超过网络最大延迟时间的基础上,使网络能耗达到最小,最大延迟时间由Sink节点确定。通过仿真实验与传统的LEACH和PEGASIS协议进行比较,结果表明,该算法有效地减少了网络能耗,同时显著降低了传输时延。     

基于能量强度的簇区分路由方法研究

传感器节点体积微小,通常携带能量十分有限的电池。由于传感器节点个数多,成本要求低廉,分布区域广,而且部署区域环境复杂,有些区域甚至是人员不能到达的,所以传感器节点通过更换电池的方式来补充能量是不现实的。如何高效使用能量来最大化网路的生命周期是无线传感器网络面临的首要挑战。为了提高网络的寿命,目前人们已经提出了很多基于网络层的路由协议。比较研究了传感器网络现有的路由协议,参考LEACH分簇算法和MTP协议,提出了一种在MTP协议基础上将LEACH分簇思想引入进来的改进方法,即在基于能量强度将网络节点分层后,再在各层上进行簇区分,均衡各传感器节点的能量来提高网络的寿命。实验表明该路由算法可提高网络寿命。