基于天牛须搜索的无线传感网分簇路由协议

针对无线传感器网络中的能耗不均衡问题,提出一种基于天牛须搜索算法的负载均衡分簇路由协议算法(LEACH-BAS)。该算法引入候选簇首选举机制,使用天牛须搜索算法对簇首分布进行搜索优化,形成合理分簇。此外,在簇间路由通信时,考虑剩余能量因子和传输能耗因子来选择中继节点。仿真结果表明,LEACH-BAS算法的网络生命周期相比LEACH、EAMMH、LEACH-GA和LEACH-PSO算法分别延长了39%、22%、15%和8%。LEACH-BAS算法应用在WSN监测场景,能有效解决WSN中能量不足的问题,优化簇首节点分布,降低节点能耗,有效地延长网络生命周期。     

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

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

能耗均衡和可靠的无线传感器网络分簇算法

为了解决热区问题和单点失效问题,提出了一种新的无线传感器网络分簇算法。算法将网络划分为非均匀的栅格,每个栅格的节点分别构成一个簇,根据节点失效概率确定栅格簇首的数目,并由栅格的多个簇首协作完成该栅格节点的数据收集。算法通过调整各个栅格中可参与簇首轮换的节点数目,从长远均衡节点之间的能耗。通过建立包含多个簇首的簇,算法降低了簇成员对单个簇首的依赖性。此外,算法还采取了一些降低能耗的措施。实验结果表明,该算法能够达到较高的能耗均衡程度和数据收集可靠性,并可以延长网络的生命周期。     

WSN中能量有效分簇多跳路由算法

针对现有无线传感器网络(WSN)分簇路由算法存在的能耗不均衡问题,提出一种能量有效分簇多跳路由算法,该算法包括两个方面:一是选举簇首时引入簇内平均剩余能量因子,根据上一轮结束后簇内各节点剩余能量和簇内节点的平均剩余能量的比值更新簇首在所有节点中所占的百分比;二是要求簇首根据MTE多跳路由协议与基站通信,从而均衡WSN整...     

基于动态簇半径的非均匀分簇算法

在无线传感器网络分簇路由算法中,针对节点能耗不均衡所引发的"热区"问题,提出了基于动态簇半径的非均匀分簇算法(UCDCR)。该算法在簇组建阶段,对网络进行区域划分,不同区域的候选簇首通过簇竞争半径来构建大小不同的簇,使簇首随网络的运行动态的改变簇竞争半径,为数据转发预留更多能量。仿真结果表明:与EEUC算法和CUCRA算法相比,UCDCR算法更加有效地均衡了节点能耗,延长了网络生命的周期。     

基于节点移动和协作转发的异构传感器网络路由协议

在异构传感器网络中,超级节点有着重要的意义.针对异构传感器网络中超级节点能量消耗过快的问题,提出了一种新的分簇路由协议（MCC）.通过在建簇阶段采用簇首移动控制策略来使簇内负载更加均衡;在簇间数据传输时引入了节点协作转发机制,提高了分簇协议的数据传输性能.通过NS2仿真验证,结果表明,MCC协议不仅降低了簇首能耗,而且使网络能耗更加均匀,延长了网络寿命.     

无线传感器网络中基于序列相关性的数据压缩算法

无线传感器网络(WSN)中传输的数据具有相关性和冗余性。如何有效降低网络中的数据量,延长网络生命周期,始终是WSN的研究热点之一。该文基于WSN中数据序列的相关性,提出一种两步数据压缩算法(TSC-SC)。网络中的簇首和簇内节点执行各自的压缩算法:簇首首先执行相关性分组算法,将数据分组,减少簇内节点的计算量以及消除簇内数据的空间相关性;簇内节点对多属性数据分类压缩,并将压缩参数传至簇首,簇首解压后再次进行分类压缩,进一步消除数据相关性,减少节点数据冗余度,降低通信能耗。为实现对压缩算法的综合性能评价,考虑基本的压缩要求和算法的计算能耗,提出了基于能量判别的算法评估模型(NCER)。仿真结果表明TSC-SC算法可以有效降低压缩比和压缩误差,充分减少数据传输量和网络的通信能耗,利用NCER指标能够直观地评价算法的性能。     

基于分簇的水下传感器网络覆盖保持路由算法

在基于分簇架构的水下传感器网络（Underwater Sensor Networks ,UWSNs）中,当簇首以单跳或多跳的通信方式将数据传输至Sink节点时,由于簇首转发大量数据而负载过重,会过早耗尽能量而死亡,这将导致提前出现对监测区域的覆盖盲区。以改善覆盖效果为目标的LEACH-Coverage-U算法由于选举簇首的分簇方法具有随机性,也无法很好解决该问题。本文提出了一种水下传感器网络单跳覆盖保持路由算法（Single-hop Coverage-Preserving Routing Algo-rithm ,SCPR）,首先定义了覆盖冗余度（Coverage Redundancy ,CR）,然后根据该度量来选举簇首,最终以单跳方式直接将数据传送至Sink节点。为减少簇首能耗并获得更高的网络覆盖率,本文还提出一种多跳覆盖保持路由算法（Multi-hop Coverage-Preserving Routing Algorithm ,MCPR ）,簇首之间通信时优先考虑父节点中CR较高的簇首作为其下一跳路由,以多跳路由将数据传送至Sink节点。仿真结果表明,与LEACH-Coverage-U算法相比,SCPR、MCPR算法避免了其选举簇首时的随机性,提高了网络覆盖率,降低了网络能耗,延长了网络生命周期。     

基于LEACH协议的兄弟节点算法——LEACH-BN

为了延长无线传感器网络的工作时间,针对LEACH算法中能量分布不均衡以及簇头节点能量浪费的问题,提出了一种基于LEACH协议的兄弟节点算法（LEACH-BN,LEACH-Brother Node）：通过簇内兄弟节点调整节点密度、簇头兄弟节点改进簇头选取和转发机制、簇间兄弟节点向基站转发数据。分析和仿真同时表明,改进后的算法实现了WSN中节点能量的全面均衡,提升了首节点和网络的生存时间,均衡弱势节点,增强系统的可靠性。     

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

在大规模无线传感器网络中以最节能的方式将数据发送到sink是该领域研究的热点之一。针对LEACH算法的不足之处,提出了一种能耗均衡的路由算法。此算法在考虑节点剩余能量的基础上采用两分法选举簇首,然后簇首通过能耗代价函数计算出一条能耗最小的路径,以多跳转发的方式将数据传送到sink.,为了进一步减少节点的能耗,算法在簇内采用了数据聚合机制。仿真结果表明,算法有效地均衡了网络能耗,延长了网络生存期。     

A Centralized Balance Clustering Routing Protocol for Wireless Sensor Network

Routing protocol plays a role of great importance in the performance of wireless sensor networks (WSNs). A centralized balance clustering routing protocol based on location is proposed for WSN with random distribution in this paper. In order to keep clustering balanced through the whole lifetime of the network and adapt to the non-uniform distribution of sensor nodes, we design a systemic algorithm for clustering. First, the algorithm determines the cluster number according to condition of the network, and adjusts the hexagonal clustering results to balance the number of nodes of each cluster. Second, it selects cluster heads in each cluster base on the energy and distribution of nodes, and optimizes the clustering results to minimize energy consumption. Finally, it allocates suitable time slots for transmission to avoid collision. Simulation results demonstrate that the proposed protocol can balance the energy consumption and improve the network throughput and lifetime significantly.     

Energy-Efficient Routing Algorithm Based on Unequal Clustering and Connected Graph in Wireless Sensor Networks

Clustering and multi-hop routing algorithms substantially prolong the lifetime of wireless sensor networks (WSNs). However, they also result in the energy hole and network partition problems. In order to balance the load between multiple cluster heads, save the energy consumption of the inter-cluster routing, in this paper, we propose an energy-efficient routing algorithm based on Unequal Clustering Theory and Connected Graph Theory for WSN. The new algorithm optimizes and innovates in two aspects: cluster head election and clusters routing. In cluster head election, we take into consideration the vote-based measure and the transmission power of sensor nodes when to sectionalize these nodes into different unequal clusters. Then we introduce the connected graph theory for inter-cluster data communication in clusters routing. Eventually, a connected graph is constituted by the based station and all cluster heads. Simulation results show that, this new algorithm balances the energy consumption among sensor nodes, relieves the influence of energy-hole problem, improve the link quality, achieves a substantial improvement on reliability and efficiency of data transmission, and significantly prolongs the network lifetime.     

无线传感器网络簇间节能路由算法

针对基于分簇网络的无线传感器网络簇间路由协议,让簇首和Sink节点直接通信或通过簇首节点转发数据造成能耗不均,节点过早死亡的缺陷。文中提出一种基于网关节点模型的无线传感器网络簇间路由算法,通过簇头与网关节点、网关节点自身建立虚电路,制定存储转发路由,将数据转发给Sink节点。并引入延时等待机制,增强了簇间信息的融合度,此算法适用于大规模无线传感器网络,有良好的可扩展性。仿真表明在能量节省等性能上与传统簇间路由算法相较有较大提高。     

无线传感器网络泊松分布最优簇首数目的研究

在无线传感器网络分簇路由协议中,簇首节点通常会消耗更多的能量。簇首节点过多或过少都会增加网络能耗。因此,为延长整个网络的生存周期,需要合理设置簇首节点的个数。在节点服从二维泊松分布的基础上,为最小化网络能耗,提出了一种求解网络最优簇首数目的方法。网络仿真表明,簇首个数为最优簇首数时,整个网络能量消耗最低。将求解的最优簇首数用于LEACH协议中,不仅延长了第一个节点的死亡时间,也提高了整个网络的生存周期。     

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.     

A grid based clustering and routing algorithm for solving hot spot problem in wireless sensor networks

Energy conservation of the sensor nodes is the most important issue that has been studied extensively in the design of wireless sensor networks (WSNs). In many applications, the nodes closer to the sink are overburdened with huge traffic load as the data from the entire region are forwarded through them to reach the sink. As a result, their energy gets exhausted quickly and the network is partitioned. This is commonly known as hot spot problem. Moreover, sensor nodes are prone to failure due to several factors such as environmental hazards, battery exhaustion, hardware damage and so on. However, failure of cluster heads (CHs) in a two tire WSN is more perilous. Therefore, apart from energy efficiency, any clustering or routing algorithm has to cope with fault tolerance of CHs. In this paper, we address the hot spot problem and propose grid based clustering and routing algorithms, combinedly called GFTCRA (grid based fault tolerant clustering and routing algorithms) which takes care the failure of the CHs. The algorithms follow distributed approach. We also present a distributed run time management for all member sensor nodes of any cluster in case of failure of their CHs. The routing algorithm is also shown to tolerate the sudden failure of the CHs. The algorithms are tested through simulation with various scenarios of WSN and the simulation results show that the proposed method performs better than two other grid based algorithms in terms of network lifetime, energy consumption and number of dead sensor nodes.     

A boolean spider monkey optimization based energy efficient clustering approach for WSNs

Wireless sensor network (WSN) consists of densely distributed nodes that are deployed to observe and react to events within the sensor field. In WSNs, energy management and network lifetime optimization are major issues in the designing of cluster-based routing protocols. Clustering is an efficient data gathering technique that effectively reduces the energy consumption by organizing nodes into groups. However, in clustering protocols, cluster heads (CHs) bear additional load for coordinating various activities within the cluster. Improper selection of CHs causes increased energy consumption and also degrades the performance of WSN. Therefore, proper CH selection and their load balancing using efficient routing protocol is a critical aspect for long run operation of WSN. Clustering a network with proper load balancing is an NP-hard problem. To solve such problems having vast search area, optimization algorithm is the preeminent possible solution. Spider monkey optimization (SMO) is a relatively new nature inspired evolutionary algorithm based on the foraging behaviour of spider monkeys. It has proved its worth for benchmark functions optimization and antenna design problems. In this paper, SMO based threshold-sensitive energy-efficient clustering protocol is proposed to prolong network lifetime with an intend to extend the stability period of the network. Dual-hop communication between CHs and BS is utilized to achieve load balancing of distant CHs and energy minimization. The results demonstrate that the proposed protocol significantly outperforms existing protocols in terms of energy consumption, system lifetime and stability period.     

Multi-factor and Distributed Clustering Routing Protocol in Wireless Sensor Networks

One of important issues in wireless sensor networks is how to effectively use the limited node energy to prolong the lifetime of the networks. Clustering is a promising approach in wireless sensor networks, which can increase the network lifetime and scalability. However, in existing clustering algorithms, too heavy burden of cluster heads may lead to rapid death of the sensor nodes. The location of function nodes and the number of the neighbor nodes are also not carefully considered during clustering. In this paper, a multi-factor and distributed clustering routing protocol MFDCRP based on communication nodes is proposed by combining cluster-based routing protocol and multi-hop transmission. Communication nodes are introduced to relay the multi-hop transmission and elect cluster heads in order to ease the overload of cluster heads. The protocol optimizes the election of cluster nodes by combining various factors such as the residual energy of nodes, the distance between cluster heads and the base station, and the number of the neighbor nodes. The local optimal path construction algorithm for multi-hop transmission is also improved. Simulation results show that MFDCRP can effectively save the energy of sensor nodes, balance the network energy distribution, and greatly prolong the network lifetime, compared with the existing protocols.     

Proposal for Efficient Routing Protocol for Wireless Sensor Network in Coal Mine Goaf

The existing uneven clustering algorithm have disadvantages of coal mine with long strip structure. This paper proposed a UCEB-CMF protocol to improve the safety of coal mine monitoring system. The new protocol optimize the selection mechanism of the cluster head, avoid the lower residual energy nodes become the cluster head. Improve the calculation method of non-uniform competition radius and the competition way of the candidate cluster head, so the new protocol can ensure the node which close to the Sink node and has the more energy to priority become the cluster head. Propose a multipath routing algorithm according to the characteristics of the node in the coal mine goaf is die easily, it can ensure the persistence of the data transmission. Simulation results show that the routing protocol effectively balances the energy consumption among cluster heads and achieves an obvious improvement on the network life time.     

基于能量和密度的WSNs动态分区成簇路由算法

针对传统的层次型网络存在的分簇不合理和能耗不均衡等问题,提出了一种基于能量和密度的动态非均匀分区成簇路由算法。该算法先根据节点与基站之间的距离将网络合理地进行动态的区域划分,在区域内成簇,使靠近基站的簇规模小于距离基站较远的簇,减少靠近基站的簇首负担和能量消耗;通过综合考虑节点剩余能量和节点密度等因素来优化簇的非均匀划分和簇首的选择,簇首间采取基于数据聚合的多跳传输机制。仿真结果表明,与经典路由算法LEACH相比,该算法能有效均衡节点能耗,延长网络生命周期。