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

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

一种能量有效的无线传感器网络路由算法

无线传感器网络中传感器节点能量有限,为了提高能量利用率,针对现有算法随机选择簇首、簇结构不合理等缺陷提出了一种新的能量有效的分簇路由算法EERA.EERA采用新的簇首选举、成簇,以及构建簇间路由算法,基于节点剩余能量与节点的相对位置选择簇首、成簇,使剩余能量较多的节点优先成为簇首并且各簇首能较均匀的分布在网络区域内;构建簇间路由时将最小跳数路由算法与改进的MTE算法结合起来,在簇间形成最小跳数、最小能耗路径.仿真结果表明,EERA算法可以均衡全网能量消耗,延长网络的生命周期.     

无线传感器网络能量均衡路由博弈算法

针对无线传感器网络节点能耗不均匀,容易形成网络分区的问题,提出了一种基于博弈论的无线传感网络路由选择策略,建立传感器节点之间以剩余能量为效用的博弈模型,求解并确定节点剩余能量最优的路由。仿真结果表明,所提出的路由选择策略可以有效地最大化节点的剩余能量,同时当该模型处于纳什均衡解时,每条路径的能耗处于均衡状态,有效地利用了传感器节点的能量资源,避免了网络能量的空洞,延长了网络的生命周期。     

无线传感器网络路由中的能量预测及算法实现

基于无线传感器网络中路由协议高效合理利用能量的要求,提出一种基于剩余能量预测的地理位置路由(EPGR,energy prediction and geographical routing)算法。算法通过建立传感器网络节点运作模型,及相邻节点剩余能量预测机制,优化路由选择。仿真和分析表明,EPGR算法能够有效地优化数据传输路径,均衡传感器网络节点的能量消耗,延长网络寿命。     

一种基于UAV的无人海岛监控网络数据收集策略

针对传统的最小跳路由无线传感器网络（WSN）在数据汇聚上较高的能量开销问题,提出了一种基于无人机(UAV)数据收集的动态分簇算法,其主要思想是利用节点剩余能量来确定那些节点可以当选簇首,同时利用节点坐标位置和设定地分簇半径来划分簇的大小。该算法的优势是能最大程度地均衡每个传感器节点的能量,使整体的节点剩余的能量维持在同一水平。为了提高数据收集的效率,采用蚁群算法规划了无人机数据收集的最短路径。仿真结果表明,与相同的分簇算法下传统的最小跳路由无线传感器网络相比,所提出的基于无人机的无线传感器网络（UAV-WSN）在能量利用率和生命周期方面分别提升了15%和25%,并且以上两种网络的能量利用率高达70%。     

k跳受限泛洪的能量平衡组播路由算法

组播路由算法(Energy-Balanced Multicast Routing,EBMR)把无线传感器网络节点的剩余能量作为建立组播路由的重要因子,在不引入过长路径的同时优先选择剩余能量高的节点作为组播数据转发节点,构建组播能量平衡树(EB-Tree),从网络能量均衡消耗的角度来延长了无线传感器网络的生存时间.针对EBMR算法路由开销较大的问题,提出了k跳受限泛洪的能量平衡组播路由算法k-EBMR,控制组播路由报文在k跳范围内传播,并且研究了影响算法性能的关键因子的选取.仿真实验表明,与EBMR算法相比,k-EBMR算法较大程度上降低了路由控制报文的传输,提高了节点能量有效使用性,进一步延长了网络生存时间.     

一种用于紫外光通信网络的改进蚁群算法

由于紫外光通信网络信道时变性强,需要对应的自适应路由来解决组网过程中出现的网络传输时延大和节点能量消耗不均衡等问题。基于蚁群优化（ACO）算法,提出了一种用于紫外光通信网络中的改进ACO算法。该算法将网络节点能量引入到ACO算法状态转移概率公式中,并通过Mat l ab软件仿真分析了算法在不同收发角度、发射功率和数据传输速率条件下的时延性能。仿真结果表明：与ACO算法相比,当收发仰角为50°时,所提算法的时延降低了1 s,收敛速度提升了28%,收敛路径的平均剩余能量也明显提高,有效地延长了网络的生存周期。     

面向智慧园区的WSN路由优化算法

为解决智慧园区中无线传感器网络(WSN)的能耗不均衡问题,构建了路由代价函数,并提出了一种新的能耗均衡路由算法.该算法结合智慧园区中无线传感器网络的特点,综合考虑节点地理位置和剩余能量来构建路由代价函数.传感器节点通过选择其邻居节点中路由代价最小的节点进行数据转发.仿真结果表明,该算法可以有效节约网络能耗,同时延长了网络的生命周期.     

基于能量均衡的无线传感器网络路由算法

为了提高无线传感器网络的生存时间,针对当前LEACH算法存在的能量不均衡难题,提出一种能量均衡的无线传感器网络节点路由算法。首先将监测区域看成以基站为中心的扇形区域,并将扇形区域分割成不同大小的弧形方块,每个弧形方块中的节点组成一个簇,根据节点剩余能量产生簇头,然后采用单跳和多跳相结合的簇间通信机制,最后采用仿真实验测试算法的性能。结果表明,本文算法有效提高了网络的能量利用率,能够实现节点之间的能耗均衡,使无线传感器的网络生存时间得到延长,适用于对网络生命周期要求较高的应用。     

一种响应型无线传感器网络路由算法

提出一种节能型无线传感器网络路由算法——TEENNEW.该算法利用能量模型确定了最优簇头数,在簇头选取阶段考虑了节点剩余能量;在数据传输阶段,该算法根据距离和能量建立簇头与基站之间的多跳通信路径.与传统的TEEN协议相比,TEENNEW算法延长了网络的生命周期,有效均衡了节点能耗.     

An Energy-Efficient Routing Protocol for Event-Driven Dense Wireless Sensor Networks

The routing energy efficiency of a wireless sensor network is a crucial issue for the network lifetime. In this article, we propose MICRO (MInimum Cost Routing with Optimized data fusion), an energy-efficient routing protocol for event-driven dense wireless sensor networks. The proposed routing protocol is an improvement over the formerly proposed LEACH and PEGASIS protocol, which is designed to be implemented mainly with node computations rather than mainly with node communications. Moreover, in the routing computation the proposed scheme exploits a new cost function for energy balancing among sensor nodes, and uses an iterative scheme with optimized data fusions to compute the minimum-cost route for each event-detecting sensor node. Compared to the PEGASIS routing protocol, MICRO substantially improves the energy-efficiency of each route, by optimizing the trade-off between minimization of the total energy consumption of each route and the balancing of the energy state of each sensor node. It is demonstrated that the proposed protocol is able to outperform the LEACH and the PEGASIS protocols with respect to network lifetime by 100–300% and 10–100%, respectively.     

Energy efficient fault-tolerant multipath routing scheme for wireless sensor networks

In wireless sensor network （MSN）, reliability is the main issue to design any routing technique. To design a comprehensive reliable wireless sensor network, it is essential to consider node failure and energy constrain as inevitable phenomena. In this paper we present energy efficient node fault diagnosis and recovery for wireless sensor networks referred as energy efficient fault tolerant multipath routing scheme for wireless sensor network. The scheme is based on multipath data routing. One shortest path is used for main data routing in our scheme and other two backup paths are used as alternative path for faulty network and to handle the overloaded traffic on main channel. Shortest pat data routing ensures energy efficient data routing. Extensive simulation results have revealed that the performance of the proposed scheme is energy efficient and can tolerates more than 60% of fault.     

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.     

Implementation of depth‐based routing and its enhancement in AquaSim–Next Generation for underwater wireless sensor networks

In the last decade, underwater wireless sensor networks have been widely studied because of their peculiar aspects that distinguish them from common terrestrial wireless networks. Their applications range from environmental monitoring to military defense. The definition of efficient routing protocols in underwater sensor networks is a challenging topic of research because of the intrinsic characteristics of these networks, such as the need of handling the node mobility and the difficulty in balancing the energy consumed by the nodes. Depth‐based routing protocol is an opportunistic routing protocol for underwater sensor networks, which provides good performance both under high and low node mobility scenarios. The main contribution of our work is presenting a novel simulator for studying depth‐based routing protocol and its variants as well as novel routing protocols. Our simulator is based on AquaSim–Next Generation, which is a specialized tool for studying underwater networks. With our work, we improve the state of the art of underwater routing protocol simulators by implementing, among other features, a detailed cross‐layer communication and an accurate model of the operational modes of acoustic modem and their energy consumption. The simulator is open source and freely downloadable. Moreover, we propose a novel and completely distributed routing protocol, named residual energy–depth‐based routing. It takes into account the residual energy at the nodes' batteries to select the forwarder nodes and improve the network lifetime by providing a more uniform energy consumption among them. We compare its performance with that of depth‐based routing protocol and a receiver‐based routing protocol implementing a probabilistic opportunistic forwarding scheme.     

一种基于ZigBee协议的DSDV改进型路由算法

大量的研究人员也投入精力研究和改进无线传感网。其中,ZigBee协议在无线传感网中扮演着举足轻重的角色,其可使大量传感器高效互连的能力,是有线网络所不能及的。提出了一种基于ZigBee协议DSDV路由算法的改进型路由算法,根据仿真,改进后的算法在处理存在移动节点通信时有一定的优势。     

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

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.     

基于ERPMT改进启发式方法的WSN寿命最大化算法

针对传感器节点的电池容量限制导致无线传感网络寿命低的问题,基于容量最大化(CMAX)、线上最大化寿命(OML)两种启发式方法以及高效路由能量管理技术(ERPMT),提出了基于ERPMT改进启发式方法的无线传感网络寿命最大化算法。首先,通过启发式方法初始化每个传感器节点,将节点能量划分为传感器节点起源数据和其它节点数据延迟;然后利用加入的一种优先度量延迟一跳节点的能量消耗;最后,根据路径平均能量为每个路由分配一个优先级,并通过ERPMT实现最终的无线传感网络优化。针对不同分布类型网络寿命的实验验证了本文算法的有效性及可靠性,实验结果表明,相比较为先进的启发式方法CMAX及OML,本文算法明显增大了无线传感网络的覆盖范围,并且大大地延长了网络的寿命。     

Opportunistic routing with in-network aggregation for asynchronous duty-cycled wireless sensor networks

We propose an opportunistic routing protocol for wireless sensor networks designed to work on top of an asynchronous duty-cycled MAC. Opportunistic routing can be very effective when used with asynchronous duty-cycled MAC because expected waiting time of senders—when they stay on active mode and transmit packet streams—is significantly reduced. If there are multiple sources, energy consumption can be reduced further through in-network aggregation. The idea proposed in this paper is to temporarily increase duty cycle ratio of nodes holding packets, in order to increase chance of in-network aggregation and thus reduce energy consumption and extend network lifetime. In the proposed protocol called opportunistic routing with in-network aggregation (ORIA), whenever a node generates a packet or receives a packet to forward, it waits for a certain amount of time before transmitting the packet. Meanwhile, the node increases its duty cycle ratio, hoping that it receives packets from other nodes and aggregate them into a single packet. Simulation results show that ORIA saves considerable amount of energy compared to general opportunistic routing protocols, as well as tree-based protocols.     

无线传感器网中一种支持固定路由结构的协作机制

针对无线传感器网络中由于衰落信道等原因导致存在大量不可靠的链路,定义了机会节点集,在机会节点集里的节点可以协助完成数据的发送任务.机会节点集的协助机制,一方面利用无线传感网络的节点冗余度大,从而存在节点来协作;另一方面利用了无线信道的广播特性,从而使节点有机会来协助.定义了协助增益来评价协作机制带来的好处,推导出了解析表达式.基于机会节点集的协作机制可以用在大部分现有的路由协议中.仿真表明,采用协作机制后带来的协作增益可达1.18.     

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.