具有上下文认知的高能效多径路由算法研究

针对移动Ad Hoc网络终端能量资源受限对全网路由的影响,提出了一种基于上下文认知的高能效多径Ad Hoc网络路由算法.该算法面向Ad Hoc网络环境综合考虑节点的能耗、传输路径的能耗和多径路由选择等要素.经过NS2仿真实验并且与其他相关路由算法进行比较,结果表明在相同的实验环境下,该路由算法能够有效地节约能量,降低了端到端的时延,提高网络的吞吐量.     

一种降低节点能量开销的ZigBee路由算法优化

为解决ZigBee网络由于不合理的路由策略导致节点能量浪费和网络陷入局部死亡的问题,提出一种降低节点能量开销的ZBR路由算法。所提ZBR优化算法在路由发送阶段,利用节点自动维护的邻居表信息,优先实现两跳路由传输;在路由发现过程中,根据最大传输跳数和节点间的父子关系,控制ZigBee网络中RN+节点RREQ分组的洪泛,减少能量浪费;在路由选择时,设计节点能量标志位和能量感知的路由成本函数,减少能量偏低节点的使用概率,降低网络开销和提高节点生存率。通过与原ZBR算法及其他几种改进ZBR算法进行剩余能量和节点生存率对比仿真实验,结果表明:改进的ZBR算法的平均剩余能量提高了7.74%,在网络运行80s时节点生存率提高了20.29%,也高于其他几种改进ZBR算法,该算法可有效减少网络能量消耗,大大提高节点生存率。     

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

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

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

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

基于能耗均衡的ZigBee火灾监控系统路由算法

在ZigBee网络中,传统的路由算法单纯的减少网络的总体能耗,而忽略了网络能耗的不平衡导致局部网络能量的枯竭,致使网络瘫痪的问题。针对这一问题,文中从网络中节点能耗均衡出发,提出了一种将剩余能量和能量阈值综合考虑的路由算法。实验表明,该算法能有效地减缓节点的死亡时间,大大延长网络寿命。     

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

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

基于三维胞元空间的能量高效性多通道协作路由算法

针对无线传感器网络中因空洞引起路由效率降低的问题,该文提出了基于3维胞元空间的能量高效性多通道协助路由算法(3D-EEMCR)。该算法根据能量损耗模型,权衡考虑节点的剩余能量和位置信息来选举胞父节点,从而平衡网络能耗;另外,算法采用主通道和辅助通道相互协助的周边路由模式完成空洞区域的路由。仿真结果表明,3D-EEMCR相比3D-GPR(Grid Position-based Routing)和3D-CSR(Cell Space Routing)能够有效提高消息包的发送率,降低网络的平均能耗,延长网络的生存周期。     

一种改进的基于能量优化的AODV路由协议

针对节点能量有限、消耗过快易导致网络分隔的问题,提出一种改进的基于能量优化的AODV路由协议(IEO-AODV)。以AODV路由协议为基础,通过综合考虑节点剩余能量和路由跳数进行路径选择,在路由过程中,中间节点在转发路由请求时进行一个与自身剩余能量有关延迟,在目的节点进行一个延迟记录,最后根据评估函数选取最优路由。仿真结果表明,与经典AODV相比,所改进的方案能均衡网络的能量消耗,在分组投递率、延长网络的生存时间等方面有较大的优势。     

基于节点特性的LR-WPAN网络能量优化路由算法

针对ZigBee网络混合路由算法的不足,考虑低速无线个域网(LR-WPAN)网络的能耗问题,提出了一种基于ZBR路由协议的改进算法(F-ZBR).本算法通过定义最小路由能量值和控制路由请求分组(RREQ)的传输方向、跳数以及在RREQ分组中加入能量标志位等措施,降低网络的整体能耗.仿真结果表明,F-ZBR算法的分组投递率、网络可用节点比率和网络剩余能量都较ZBR有明显提高,从而可以延缓ZigBee网络中大量数据传输造成的RN+节点能量过度损耗而导致的网络瘫痪等问题的发生,延长网络生命周期.     

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

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

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

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.     

An ant colony optimization based routing algorithm for extending network lifetime in wireless sensor networks

Reducing the energy consumption of network nodes is one of the most important problems for routing in wireless sensor networks because of the battery limitation in each sensor. This paper presents a new ant colony optimization based routing algorithm that uses special parameters in its competency function for reducing energy consumption of network nodes. In this new proposed algorithm called life time aware routing algorithm for wireless sensor networks (LTAWSN), a new pheromone update operator was designed to integrate energy consumption and hops into routing choice. Finally, with the results of the multiple simulations we were able to show that LTAWSN, in comparison with the previous ant colony based routing algorithm, energy aware ant colony routing algorithms for the routing of wireless sensor networks, ant colony optimization-based location-aware routing algorithm for wireless sensor networks and traditional ant colony algorithm, increase the efficiency of the system, obtains more balanced transmission among the nodes and reduce the energy consumption of the routing and extends the network lifetime.     

NHRPA: a novel hierarchical routing protocol algorithm for wireless sensor networks

Considering severe resources constraints and security threat hierarchical routing protocol algorithm. The proposed routing of wireless sensor networks （WSN）, the article proposed a novel protocol algorithm can adopt suitable routing technology for the nodes according to the distance of nodes to the base station, density of nodes distribution, and residual energy of nodes. Comparing the proposed routing protocol algorithm with simple direction diffusion routing technology, cluster-based routing mechanisms, and simple hierarchical routing protocol algorithm through comprehensive analysis and simulation in terms of the energy usage, packet latency, and security in the presence of node protocol algorithm is more efficient for wireless sensor networks. compromise attacks, the results show that the proposed routing     

Multi-objective fractional artificial bee colony algorithm to energy aware routing protocol in wireless sensor network

Due to the promising application of collecting information from remote or inaccessible location, wireless sensor networks pose big challenge for data routing to maximize the communication with more energy efficient. Literature presents different cluster-based energy aware routing protocol for maximizing the life time of sensor nodes. Accordingly, an energy efficient clustering mechanism, based on artificial bee colony algorithm and factional calculus is proposed in this paper to maximize the network energy and life time of nodes by optimally selecting cluster-head. The hybrid optimization algorithm called, multi-objective fractional artificial bee colony is developed to control the convergence rate of ABC with the newly designed fitness function which considered three objectives like, energy consumption, distance travelled and delays to minimize the overall objective. The performance of the proposed FABC-based cluster head selection is compared with LEACH, PSO and ABC-based routing using life time, and energy. The results proved that the proposed FABC maximizes the energy as well as life time of nodes as compared with existing protocols.     

基于网格和遗传算法的移动代理路由算法研究

针对一类基于移动代理的无线传感器网络内移动代理的迁移路由问题,提出了一种基于网格和遗传算法的移动代理迁移路由算法.该方法通过改进的自适应遗传算法获取迁移的基路径信息,再结合网络网格化和路由修复策略来实现路由节点失效时的路由修复,从而有效降低能耗和实现成功迁移.     

A Tabu search based routing algorithm for wireless sensor networks

In this paper, a Tabu search based routing algorithm is proposed to efficiently determine an optimal path from a source to a destination in wireless sensor networks (WSNs). There have been several methods proposed for routing algorithms in wireless sensor networks. In this paper, the Tabu search method is exploited for routing in WSNs from a new point of view. In this algorithm (TSRA), a new move and neighborhood search method is designed to integrate energy consumption and hop counts into routing choice. The proposed algorithm is compared with some of the ant colony optimization based routing algorithms, such as traditional ant colony algorithm, ant colony optimization-based location-aware routing for wireless sensor networks, and energy and path aware ant colony algorithm for routing of wireless sensor networks, in term of routing cost, energy consumption and network lifetime. Simulation results, for various random generated networks, demonstrate that the TSRA, obtains more balanced transmission among the node, reduces the energy consumption and cost of the routing, and extends the network lifetime.     

无线传感网络移动分簇路由策略

无线传感网络(WSN)路由协议中,分簇路由具有拓扑管理方便、能量高效和数据融合简单等优点,成为当前重点研究的路由技术。通过研究各种环境下的移动传感器网络,有效地降低能耗则是研究移动无线传感器网络的重要目的之一。针对无线传感网络中移动性问题,基于LEACH协议,利用移动传感器网络中节点距离、速度和剩余能量等因素提出了能量高效的移动分簇路由算法。实验结果表明此算法能够较好地支持节点移动,从而降低网络能耗,延长网络生存时间。     

基于博弈理论的无线传感器网络分布式节能路由算法

为了有效解决无线传感器网络路由节能问题,该文提出适合无线传感器网络的节能路由算法。在引入博弈理论概念建立网络模型的基础上,通过对于以往传感器网络簇首选择方法的研究,设计了一种基于博弈论的,兼顾节点剩余能量及簇首分布的节能路由DEER(DistributedEnergy-EconomicalRouting),大大节省了分布式决策网络协议的能量损耗。仿真证明了该方法在无线传感器网络中,能够有效地平衡网络负载,节省节点能量,延长网络寿命。     

Network coding and competitive approach for gradient based routing in wireless sensor networks

Energy efficiency is a key design criterion for routing protocols in wireless sensor networks since sensor nodes are strongly constrained in terms of energy supply. Gradient-Based Routing (GBR) is a well known energy efficient routing protocol that is used in WSNs. However, there exist shortcomings in the GBR scheme such as: (1) sinks make use of flooding to broadcast interest messages which leads to a lot of duplication packets which are transmitted. This leads to the waste of a lot of energy in the network and (2) nodes deliver messages in a point to point manner. As a result, the potential of data retransmissions in the network is high due to the unstable network environment in WSNs. In this study, network coding and a competitive approach are proposed to solve the above two problems. Firstly, an energy efficient broadcast algorithm using network coding for GBR (GBR-NC) is proposed. This algorithm aims to reduce network traffic, and furthermore, reduce the energy consumption and prolong the lifetime of the network. Secondly, two competing algorithms (GBR-C and auto-adaptable GBR-C) are proposed for GBR. The basic idea of the proposed competing algorithms is to reduce the retransmission attempts and save the energy by considering two forward candidates. Simulation results show that the proposed schemes give better results when compared to the traditional GBR in terms of energy efficiency.     

基于离散多目标优化粒子群算法的多移动代理协作规划

无线传感器网络中多移动代理协作能快速高效地完成感知数据汇聚任务,但是随着移动代理访问数据源节点数的增加,移动代理携带的数据分组会逐渐增大,导致传感器节点能量负载不均衡,部分数据源节点能耗过快,网络生存期缩短。目前,针对该问题所设计的能耗均衡算法,多以降低多移动代理总能耗为目标,却未充分考虑部分数据源节点能量消耗过快对网络生存期造成的影响。提出离散多目标优化粒子群算法,以网络的总能耗和移动代理负载均衡作为适应度函数,在多移动代理协作路径规划中寻求近似最优解。通过仿真实验验证,所提出的多移动代理协作路径规划,在网络总能耗和网络生存期方面的性能优于同类其他算法。