基于蚁群算法的无线自组网络能量控制路由研究

在深入分析现有路由协议的基础上,提出了一种基于蚁群算法的能量控制路由模型。首先分析网络特性,建立节点移动和能量消耗数学模型;然后,建立基于蚁群算法的能量控制路由模型,通过计算节点剩余能量和节点度等确定数据传输过程中节点被选择的概率;最后选择高概率节点作为中间节点进行数据转发。仿真结果显示:相比典型的DSR路由协议,该算法可以为网络提供能量保障,延长网络生存时间,弥补已有算法的不足。     

基于移动Ad Hoc网络的多路路由算法

移动Ad Hoc网络中有限的节点能量和带宽给路由协议设计带来了困难,对此考虑使用多路径机制来平衡负载,并提出了两种多路路由算法。其中,简单相关多路路由算法规定替换路径只能由主路径节点或其相邻节点构成,从而减小了替换路径的平均长度。仿真结果显示简单相关多路路由算法比节点不相关多路路由算法具有更好的性能,它将为无线网络中实现节能及可靠传输提供一种有效的途径。     

一种基于负载均衡和能量感知的移动自组网路由算法

在移动自组网中，减少移动节点电池能量消耗，延长网络总的使用时间，已经成为路由协议性能评价的重要方面。提出了一种新的路由选择度量，它综合考虑了节点负载及当前的剩余能量，试图通过路由机制均衡网络流量、保护网络中的低能量节点。结合此度量方式提出一种路由选择算法LBEAR（Load—Balanced ＆ Energy—Aware Routing），仿真结果表明，该算法能够使节点能耗与负载的分布更为均匀，相比以前相关的路由算法有效提高了吞吐量。     

一种新的基于DSR的移动自组网节能路由策略

移动自组网是由一组带有无线收发装置的移动节点组成的一个支持多跳的临时性的网络自治系统。由于移动自组网的大多数节点是由有限寿命的电池来提供的，因此能量保护策略成为制定路由协议的一个重要依据。该文提出了一种新的基于动态源路由协议的节能路由策略。仿真表明该策略有效地延长了网络的生存时间。并很好地均衡了节约能耗和保护网络传统性能的需求。     

一种能量感知的无线移动自组网路由协议

无线移动自组网中的大多数节点都是由有限寿命的电池来提供的,能量保护策略就成为设计网络协议的一个重要条件。提出一种能量感知的无线移动自组网路由协议,综合考虑了节点的剩余能量和路由跳数,有效保护网络中能量低的节点,减少了节点能量损耗,延长了网络的使用时间。该路由协议中采用了局部路由修复机制,减少了数据包丢失,提高了数据传输率。最后,仿真结果证明了协议的有效性。     

结合拥塞控制和能量均衡策略DSR路由协议

为了改善AdHoc网中拥塞状况,提高网络生存时间,通过分析DSR(Dynamic Source Routing)协议,利用对节点拥塞和能量状态的划分,提出了一种结合拥塞控制和能量均衡的CE-DSR(congestion&energy DSR)路由协议。NS-2进行仿真表明,新策略不但减轻了网络的拥塞程度,而且延长了整个网络的生存时间。改进后的CE-DSR路由协议性能明显优于传统的DSR路由协议性能。最后给出了改进后的CE-DSR协议在移动自组网络控制系统中的应用效果。     

基于AODV的节能改进措施

能源问题对于移动自组网是非常重要的,因为移动节点只能依靠它们有限的电池供应.原先的路由算法中,选路时不考虑节点的剩余能量,选定了一条路由后就一直用下去,直到数据传完或拓扑变更引起重选路由.这样很容易会耗完这条路由上节点的能量,特别是某些有多条路由通过的关键节点.针对移动ad hoc网络中节点的有限能量供给问题,提出了一种基于搜索具有较大可持续能量路由的节能策略,并对已存的EA-AODV协议进行改进保护低能量路由的算法就是通过保护能量偏低的节点,延长网络的可操控时间.该策略考虑路由上的节点可用能量的下限低到某一域值就拒绝服务,某一中间值时则设定延迟以避免被选择,然后选择所通过节点的能量都比较充足的路由,从而延长了整个网络可用路由的持续时间.仿真结果验证了该思路,并有较好的性能提升.因此通过实践证明,文中提到的算法与改进都是行之有效的.     

概率转发的移动自组织网络路由协议

Ad Hoc网络节点能量受限的路由协议的研究是目前的一个热点,IETF的MANET小组提出的几种经典的路由协议,属于最短路由,即最小跳数路由,没有考虑能量因素。由于Ad Hoc网络中的节点是由电池供电,整个网络是一个能量受限系统,如何节省节点的能量,尽可能延长网络的可操控时间逐渐成为衡量路由协议性能的重要指标。基于移动节点的能量级别,采取不同的转发概率,提出了一种Ad Hoc网络基于概率的路由协议——PBR,并与AODV协议进行了性能比较,仿真结果显示,PBR明显改善了系统的能量消耗,延长了网络的存活时间,并且具有较优的可扩展性。     

WSN中基于能量代价的能量优化路由算法

针对无线传感器网络路由算法中的节点能耗问题,提出了一种基于能量代价的能量优化路由算法。算法综合考虑数据传输中节点能耗的有效性和均衡性,设计了一种新的能量代价函数,实现了二者的优化匹配。传感器节点按此函数计算前向部居节点的能量代价,选择能量代价最小的节点作为下一跳。算法基于部居节点信息进行路由选择,具有较低的计算时间复杂度。最后,对路由算法的性能进行了仿真分析,并与典型的路由算法进行了对比,结果表明,本路由算法能够有效延长网络生存时间,节约并均衡节点的能量消耗。     

移动模型对Ad hoc网络路由协议能耗的影响

Ad hoc网络节点能量受限的路由协议的研究是目前的一个热点,IETF的MANET小组提出的几种经典的路由协议,属于最短路由,即最小跳数路由,没有考虑能量因素。由于Ad hoc网络中的节点是由电池供电,整个网络是一个能量受限系统,如何节省节点的能量,尽可能延长网络的可操控时间成为衡量路由协议性能的重要指标。目前针对这几种路由协议基于节点能量约束的评估很少。基于移动模型,该文以能量消耗程度为指标,对Ad hoc 4种典型的路由协议在不同的运动场景下进行了比较系统的仿真研究,得出了一些有益的结论,为进一步研究基于能耗的Ad hoc网络路由协议提供一些参考。     

Power-aware localized routing in wireless networks

A cost aware metric for wireless networks based on remaining battery power at nodes was proposed for shortest-cost routing algorithms, assuming constant transmission power. Power-aware metrics, where transmission power depends on distance between nodes and corresponding shortest power algorithms were also proposed. We define a power-cost metric based on the combination of both node's lifetime and distance-based power metrics. We investigate some properties of power adjusted transmissions and show that, if additional nodes can be placed at desired locations between two nodes at distance d, the transmission power can be made linear in d as opposed to d^α dependence for α ⩾ 2. This provides basis for power, cost, and power-cost localized routing algorithms where nodes make routing decisions solely on the basis, of location of their neighbors and destination. The power-aware routing algorithm attempts to minimize the total power needed to route a message between a source and a destination. The cost-aware routing algorithm is aimed at extending the battery's worst-case lifetime at each node. The combined power-cost localized routing algorithm attempts to minimize the total power needed and to avoid nodes with a short battery's remaining lifetime. We prove that the proposed localized power, cost, and power-cost efficient routing algorithms are loop-free and show their efficiency by experiments     

MANET网络中一种节约能量的负载平衡路由

节约能量的负载平衡路由(PELBR)协议是针对无线Adhoc网络提出的一种路由协议。PELBR定义了一种称为节点活动度的标准,节点活动度定义了节点的通信负载。在PELBR中,路由发现过程中目标节点从候选路径中寻找负载最小,即路径上活动度之和最小的路径;而节点在传送数据时适当调节能量以保证网络拓扑结构的连接性,同时节约电池能量从而延长节点的工作时间。     

Enhancing DSR maintenance with power awareness

A power-aware route maintenance protocol for Mobile Ad Hoc Networks (MANETs) is introduced. Termed Dynamic Path Switching (DPS), the new protocol puts an overloaded node to sleep before a route link breaks because that node runs out of energy, and brings other suitable nodes into play instead. When the battery charge of a node reaches a stated level, the node can advance a request to change to a sleep state for a while. The request is honoured unless survival of some path rests on the forwarding activity of that very node. All nodes are assumed to be collaborative. The DPS protocol is fully backward compatible, as it can be implemented within existing routing protocols such as Dynamic Source Routing (DSR). The new protocol has been extensively simulated with the established network simulator NS2. The findings indicate a much improved power awareness of the updated routing protocol with respect to the unadorned one. Power saving is particularly effective during long-lived sessions.     

基于OLSR的能量有效路由新方案

本文建议了一种计算能量有效路由的新量度,提出了OLSR协议中选择能量有效路由的新机制,主要设计目标是延长低电节点寿命的同时尽量降低数据分组的传输能耗。使用NS2仿真器将它们与OLSR及MMBCR协议进行了比较,说明新机制可以提供更好性能。     

Signal strength based routing for power saving in mobile ad hoc networks

The transmission bandwidth between two nodes in mobile ad hoc networks is important in terms of power consumption. However, the bandwidth between two nodes is always treated the same, regardless of what the distance is between the two nodes. If a node equips a GPS device to determine the distance between two nodes, the hardware cost and the power consumption increase. In this paper, we propose using a bandwidth-based power-aware routing protocol with signal detection instead of using GPS devices to determine the distance. In our proposed routing protocol, we use the received signal variation to predict the transmission bandwidth and the lifetime of a link. Accordingly, the possible amount of data that can be transmitted and the remaining power of nodes in the path after data transmission can be predicted. By predicting the possible amount of data that can be transmitted and the remaining power of nodes after data transmission, we can design a bandwidth-based power-aware routing protocol that has power efficiency and that prolongs network lifetime. In our simulation, we compare our proposed routing protocol with two signal-based routing protocols, SSA and ABR, and a power-aware routing protocol, MMBCR, in terms of the throughput, the average transmission bandwidth, the number of rerouting paths, the path lifetime, the power consumed when a byte is transmitted, and the network lifetime (the ratio of active nodes).     

基于ARIMA-ANN预测模型的能量感知路由算法

针对传统能量感知OLSR协议在减少传输功率消耗和均衡节点剩余能量之间不能兼顾的特点,提出了一种新型的基于剩余能量比例和传输功率消耗的OLSR路由协议OLSR_RC,它利用上述两方面的指标构造复合能量开销,并将其作为路由选择的度量值。在减小网络开销的同时,也防止了部分低电量节点的能量被快速耗尽,延长了网络的生存周期。此外,新路由还采用ARIMA-ANN组合能量预测模型对节点的剩余电量进行预测,降低了由于拓扑控制(TC)消息丢失对选择路由所造成的影响。这种新型路由协议在无线传感器网络领域有比较广阔的应用前景。     

WIA-PA网络中的基于节能的AODV路由算法改进

能源问题对于WIA-PA工业无线网络是非常重要的;因为在恶劣的环境中它们只能依靠其有限的电池供电;传统的路由算法中,选路时没有考虑节省能量的策略,它会造成一些关键节点的过度使用而过早的退出无线网络;针对WIA-PA网络的能量受限问题,提出了一种基于搜索有较大可持续能量路由的节点方法,并对AODV协议进行改进,逸免了低能量节点的使用,从而延长了网络的生存时间;该路由协议经过了理论分析和计算机仿真的验证,具有可行性和有效性,对于WIA-PA网络的节能路由协议研究以及实现具有一定的参考价值。     

Improvement of battery lifetime in software-defined network using particle swarm optimization based cluster-head gateway switch routing protocol with fuzzy rules

The software-defined network (SDN) is one of the network architectures, in which the data plane and control plane is divided from each other, and the network can be handled using a sensibly centralized controller and this method is adopted to reconfigure the wireless sensor network automatically. In this article, to implement the SDN in MANET, in which control nodes can be chosen in SDN dynamically for the activation of MANET function to allocate the works to other mobile nodes to the base station. However, in the field of mobile ad hoc networks, the network lifetime, and battery lifetime is one of the major problems and the energy consumption can play a significant rule for the transmission of data in the SDN. Therefore, in this article, particle swarm optimization (PSO) based CGSR (cluster-head gateway switch routing protocol) algorithm with fuzzy rules is proposed to increase the network lifetime of battery powered mobile nodes by reducing the energy consumptions of each node in software-defined MANET. In this proposed method, a routing method that can permit various mobile nodes with low battery power to transmits the data from source node to base station. We design a PSO based CGSR routing protocol by selecting the routing mobile nodes using fuzzy rules for packet transmission. In CGSR process, the formation of cluster and selection of cluster head is executed depending on the particle swarm optimization method. This proposed routing protocol can be used to enhance the battery lifetime by extension of the network lifetime with numerical analysis for efficient route node selection.     

无线Ad hoc网络中基于区域代价的功率感知路由协议

由于能量的限制,无线Ad hoc网络面临网络生存时间、无线资源利用效率以及时延要求等方面的挑战。为了降低网络的能量消耗,延长节点寿命和网络生存周期,提出了一种基于区域代价的功率感知路由协议。该协议在路径选择时,综合考虑节点及其邻居的剩余能量、节点发射功率和节点接收处理功率等因素,使网络中节点的能耗趋于一致,并延长网络的生存时间。该算法的复杂度不高,易于在节点运行。仿真结果证明该协议能取得较好的性能。     

GAER: genetic algorithm-based energy-efficient routing protocol for infrastructure-less opportunistic networks

In infrastructure-less opportunistic networks (Oppnets), the routing of messages is a challenging task since nodes are not aware of the network topology and they look for an opportunity to send the message by finding or predicting a best temporary path at each hop towards the destination. As nodes perform various computations for next hop selection, a lot of battery power gets consumed, which in turn reduces the network lifetime. Thus, there is a clear demand for routing protocols for such networks which are energy-efficient and consume lesser power of nodes in forwarding a message. In this paper, a novel routing protocol named genetic algorithm-based energy-efficient routing (GAER) protocol for infrastructure-less Oppnets is proposed. This protocol uses a node’s personal information, and then applies the genetic algorithm (GA) to select a better next hop among a group of neighbour nodes for the message to be routed to the destination. With the application of GA, optimal results are obtained that help in the selection of the best possible node as the next hop, which in turn, leads to prolonged battery life. Simulation results show that GAER outperforms the Epidemic, PROPHET, and Spray and Wait protocols in terms of messages delivered, overhead ratio, average residual energy, and number of dead nodes. The results obtained for average latency and average buffer time using GAER are comparable to those obtained for the aforementioned protocols.