一种基于节点能量的机会网络概率路由算法

在机会网络中,节点之间可能不存在端到端的路径.为了节省网络中节点消耗的能量,在概率路由算法的基础上提出了一种基于节点能量的概率路由算法(Energy-based Probabilistic Routing Protocol using History of Encounters and Transitivity,EBPROPHET).首先,计算两个节点相遇时节点的通信开销,然后相遇节点的剩余能量作为一个参量引入算法,选择节点剩余能量多的节点作为转发节点,最后,进行消息的转发.仿真表明,EB-PROPHET算法具有良好的路由性能,降低了整个网络的能量消耗,延长了网络的生存周期.     

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

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

基于OLSR的Ad Hoc网络功率意识路由协议

针对Ad Hoc网络能量受限的特点,提出了一种基于OLSR的功率意识路由协议.该协议的路由选择策略考虑节点发射功率和剩余寿命,同时尽量选择寿命较长的节点作为MPR节点.针对网络流量的突发性和随机性,采用基于能量流失率的节点寿命预测模型.在兼顾传统路由指标之外,主要考虑数据分组传输成功率和网络维持时间等参数.仿真结果显示,该算法有效地提高了网络吞吐量,延长了网络寿命.     

基于灰色关联的ZigBee网络混合路由算法

ZigBee网络混合路由算法(ZigBee Routing,ZBR)中将源节点和目的节点之间的最小跳数作为唯一的路由度量因素.但随着节点能量消耗以及节点的频繁移动,ZBR算法的这一特性会造成网络间歇性连接,从而导致网络性能下降.提出一种选择最优分组转发路径的ZigBee网络混合路由算法(Grey Relational Algorithm based ZBR,GRA-ZBR).GRA-ZBR算法在目的节点选择路径时引入灰色关联算法,综合考虑节点剩余能量、链路质量、节点剩余队列长度以及路径长度等因素.仿真结果表明,GRA-ZBR算法可以有效提高网络分组投递率,降低平均端到端时延.     

基于代价函数的改进AODV协议

Ad Hoc网络中如何设计良好的路由协议使其网络均衡是当今研究的重点。针对网络负载和能量均衡等问题,提出了一种基于代价函数的改进按需距离矢量路由协议CF-AODV。该协议在路由建立过程中,通过能量阈值和缓存队列长度阈值进行RREQ转发判断;在目的节点选取路由时采用延迟应答方案,通过以路径长短、路径负载、路径剩余能量作为因子的代价函数进行判决来选取最佳路径。仿真结果表明,所提协议在网络负载和能量上得到了均衡,可以延长网络寿命,减轻网络拥塞,减少时延和丢包率。     

基于灰色关联的ZigBee网络混合路由算法研究

ZigBee网络混合路由算法(ZigBee Routing,ZBR)中将源目的节点之间的最小跳数作为唯一的路由度量因素。但随着节点能量消耗以及节点的频繁移动,ZBR算法的这一特性会造成网络间歇性连接,从而导致网络性能下降。本文提出一种选择最优分组转发路径的ZigBee网络混合路由算法—GRA-ZBR算法。GRA-ZBR算法在目的节点选择路径时引入灰色关联算法,综合考虑节点剩余能量、链路质量、节点剩余队列长度、以及路径长度等因素。仿真结果表明：GRA-ZBR算法可以有效提高网络分组投递率,降低平均端到端时延。     

能量采集型无线传感器网络的高能效路由算法

在能量采集型无线传感器网络中,虽然有能量吸收,但是因能量依然非常珍贵,如何优化路由协议,提高能量利用率,延长网络寿命仍然是值得研究的问题.为求解高能效的路由,提出了一种采用遗传算法的高能效路由算法,建立考虑节点的吸收能量、剩余能量、消耗能量和浪费能量的适应函数,用遗传算法寻找全局最优路径.将该适应函数与3种其他适应函数作对比,其他3种适应函数分别为只考虑路径能耗最小的适应函数,考虑路径能耗与路径上节点的吸收能量、剩余能量的适应函数以及考虑路径能耗与网络中所有节点的浪费能量的适应函数.采用遗传算法解出4种路由,通过仿真分析可知,所提出的路由算法能量利用效率最高.     

一种基于WSN时变性与节点剩余能量均衡的机会路由算法

 为了解决数据报文在无线传感网络中动态路由以及网络内各节点剩余能量均衡问题,该文提出了一种机会路由算法。首先,利用热力学第2定律描述数据报文在无线传感器网络中动态路由的传输过程,其中,为了表征网络内各节点状态的时变性以及剩余能量,提出了机会熵模型;其次,以机会熵模型作为选择下一跳节点的理论依据,并结合蚁群优化(ACO)算法,设计并实现了考虑网络中各节点时变性与剩余能量均衡的机会路由算法(ACO for Time Dependent Opportunistic-routing Protocol, ATDOP),使得数据报文在转发过程时,能够有效地选择下一跳节点,从而使网络内各节点的通信资源和能量资源达到负载均衡。最后,通过实验证明,相对于已有的机会路由协议,ATDOP具有报文成功传输率高、网络有效吞吐量大以及网络工作寿命长等优点。     

一种基于节能目的改进的AODV路由算法

移动AdHoc网络广泛用于各种条件比较艰苦的环境中,常用的AODV协议在设计之初没有考虑节点的能量问题,使用时可能导致某一关键节点的能量急剧下降而使链路失效。针对这一情况,新设计的IAODV协议在源节点新增了一条备用路径,各节点在周期性广播HELLO消息时主动报告节点的能量状态,在转发路由请求消息前,将节点的剩余能量和当前负载考虑进去,改进路由请求转发机制,通过这些方式,加强了整个协议的网络平衡和协调性,节省了单个节点的能量。在NS2这个模拟平台下,通过仿真可知IAODV协议平均端到端时延更短,丢包率更低。     

能量感知和链路稳定度的多径MANET路由

在移动自组织网络中,相对于单路径路由算法而言,多路径路由算法可以均衡网络负载、提高路由的可靠性。通过对AOMDV路由协议进行改进,提出了基于能量感知和链路稳定度的多径MANET路由协议ELMRP。ELMRP协议综合考虑了节点的剩余能量和链路稳定度,根据路径的剩余能量和稳定度计算代价值,按照代价值在多条节点不相交路径上分配数据流量。仿真结果表明,和AOMDV路由协议相比,ELMRP协议延长了网络的生存时间,提高了数据分组递送率,降低了路由发现频度。     

Clustering routing protocol based on improved PSO algorithm in WSN

Aiming at the problem that the location distribution of cluster head nodes filtered by wireless sensor network clustering routing protocol was unbalanced and the data transmission path of forwarding nodes was unreasonable,which would increase the energy consumption of nodes and shorten the network life cycle,a clustering routing protocol based on improved particle swarm optimization algorithm was proposed.In the process of cluster head election,a new fitness function was established by defining the energy factor and position equalization factor of the node,the better candidate cluster head node was evaluated and selected,the position update speed of the candidate cluster head nodes was adjusted by the optimized update learning factor,the local search and speeded up the convergence of the global search was expanded.According to the distance between the forwarding node and the base station,the single-hop or multi-hop transmission mode was adopted,and a multi-hop method was designed based on the minimum spanning tree to select an optimal multi-hop path for the data transmission of the forwarding node.Simulation results show that the clustering routing protocol based on improved particle swarm optimization algorithm can elect cluster head nodes and forwarding nodes with more balanced energy and location,which shortened the communication distance of the network.The energy consumption of nodes is lower and more balanced,effectively extending the network life cycle.     

一种无线多媒体传感器网络路径最优路由算法

介绍了无线多媒体传感网络(WMSN)路由的设计原则与策略,描述了路径最优的基本原理,最后从最优路径的选择、信息转发策略、节点能量消耗3个方面考虑,设计出路径最优路由算法。该算法与蚁群算法进行比较,实验结果表明,该算法在节点能量消耗、信息传送速度上都优于蚁群算法,尤其传速率提高了30%左右。     

一种基于QoS的空间延迟/中断容忍网络拥塞控制方法

为缓解网络拥塞对空间延迟/中断容忍网络产生的影响,该文提出一种基于QoS的网络拥塞控制算法。该算法包括接触拥塞判断和基于QoS的数据转发两种机制,分别从接触剩余可用容量和节点剩余存储空间两方面对每一段接触的拥塞程度进行预测,将接触划分为不同的拥塞等级。在计算路由时,以整段路径中所包含接触的最高拥塞等级为该路径的拥塞等级,并根据该拥塞等级发送不同优先级的数据。实验表明,基于QoS的拥塞控制算法可以提高低优先级数据的传递率并在节点存储空间不足时降低最高优先级数据的传递时延。     

An adaptive‐aware energy and queue improvement of AOMDV

Because the node energy and network resources in the wireless sensor network (WSN) are very finite, it is necessary to distribute data traffic reasonably and achieve network load balancing. Ad hoc on‐demand multipath distance vector (AOMDV) is a widely used routing protocol in WSN, but it has some deficiencies: establishes the route by only using hop counts as the routing criterion without considering other factors such as energy consumption and network load; forwards route request in fixed delay resulting in building the nonoptimal path; and cannot update the path status after built paths. For the deficiency of AOMDV, this paper proposes a multipath routing protocol adaptive energy and queue AOMDV (AEQAOMDV) based on adaptively sensing node residual energy and buffer queue length. When sending a routing request, the forwarding delay of the routing request is adaptively adjusted by both the residual energy and the queue length of the intermediate node; when establishing routes, a fitness is defined as a routing criterion according to the link energy and the queue load, predicting the available duration of the node based on the energy consumption rate and adjusting the weight of the routing criterion by the available duration of the node; after the routes are established, the path information status are updated via periodically broadcasting Hello that carries the path information with the minimum fitness, making the source node update the path information periodically. By using NS‐2, simulations demonstrate that compared with AOMDV, AEQAOMDV has obvious improvements in increasing packet delivery ratio, reducing network routing overhead, reducing route discovery frequency, and decreasing the network delay. And AEQAOMDV is more suitable for WSN.     

Energy Efficient Routing Technique for Wireless Sensor Networks Using Ant-Colony Optimization

Wireless sensor networks (WSN) consists of numerous number of nodes fitted with energy reserves to collect large amount of data from the environment on which it is deployed. Energy conservation has huge importance in wsn since it is virtually impossible to recharge the nodes in their remote deployment. Forwarding the collected data from nodes to the base station requires considerable amount of energy. Hence efficient routing protocols should be used in forwarding the data to the base station in order to minimize the energy consumption thereby increasing the life-time of the network. In this proposed routing protocol, we consider a hierarchical routing architecture in which nodes in the outer-level forwards data to the inner-level nodes. Here we optimized the routing path using ant-colonies where data moves along minimal congested path. Further, when ant-colony optimization is used, certain cluster-head nodes may get overloaded with data forwarding resulting in early death due to lack of energy. To overcome this anomaly, we estimated the amount of data a neighboring Cluster-head can forward based on their residual energy. We compared the energy consumption results of this proposed Routing using Ant Colony Optimization (RACO) with other existing clustering protocols and found that this system conserves more energy thereby increasing lifetime of the network.

     

An energy aware algorithm for OLSR clustering

One of the important aspects of a mobile ad hoc network (MANET) is the limitation of the amount of available energy and the network lifetime. The tremendous amount of using mobile nodes in wireless communication medium makes energy efficiency a fundamental requirement for MANETs. In this paper, we propose a novel energy aware clustering algorithm for the optimized link state routing (OLSR) routing protocol. This algorithm takes into account the node density and mobility and gives major improvements regarding the number of elected cluster heads. Our objective is to elect a reasonable number of cluster heads that will serve for hierarchical routing based on OLSR. The proposed algorithm aims to increase the network lifetime by considering the ad hoc residual energy while taking routing decisions. It also optimizes the delay of carried flows by adopting a selective forwarding approach based on a hierarchical routing model.     

基于链路质量的WSN代价均衡路由选择算法

该文针对无线传感器网络中不可靠链路通信耗能过大的问题,基于链路质量进行路由代价函数构建,并为各条路径分配适当的选择概率,采用最小跳数转发策略设计了代价均衡的路由选择算法CBLQ;为了进一步降低和均衡路由代价,分析同跳节点的备选转发条件,又扩展形成了新的路由选择算法CBLQ-E。仿真实验结果证明,两种算法均使网络的能量利用率得到有效提高,同时还降低了网络的数据传输时延。     

基于下一跳可用带宽和链路利用率的路径选择算法

路径选择算法的优劣直接影响着网络性能。基于最大可用带宽选路的ESG算法在下一跳链路带宽不同时,存在次优选路决策问题。本文提出一种ESG的改进算法——IESG,该算法将下一跳链路的可用带宽和链路利用率统一考虑,生成反映下一跳链路传输能力的链路传输能力因子,以其作为路径选择决策的依据。仿真结果表明,IESG算法克服ESG算法的不足,具有较高的选路成功概率且执行复杂度相当。