一种新的均衡流量提高网络能量效率的Ad hoc网络路由建立算法

能量问题是Ad hoc网络中的一个重要问题,该文提出了通过均衡流量提高网络能量效率的TBDB路由建立算法。该算法在路由建立时对可选的路径集合进行限制,根据节点在饱和状态时归一化吞吐量的值,分别设定链路层队列中数据长度的门限值和节点连接度的门限值,收到路由请求的节点,根据门限值和节点的当前状况对节点是否响应收到的路由请求做出判决,从而调节了网络中节点的负荷,均衡了网络中能量的消耗,避免节点长期处于重负荷状态,保证了当前正在进行的传输。分析和仿真表明该算法在均衡流量的同时,也将网络中能量的消耗均衡地分散于网络各个部分,改进了网络的性能。仿真结果表明该路由算法提高了网络的吞吐率和能量效率,并且降低了平均端到端的延时。     

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

无线传感器网络中节点的能量是有限的,而且一般不能补充能量。所以如何最大化节点能量的利用率,延长整个传感器网络的生命周期,一直是无线传感器网络的一个研究热点。本文针对Leach路由算法的不足,提出一种新的基于能量考虑的梯度分簇路由算法。最后通过OMNET＋＋仿真试验,来验证新的路由算法的优越性。     

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

无线传感器网络中节点的能量是有限的,而且一般不能补充能量.所以如何最大化节点能量的利用率,延长整个传感器网络的生命周期,一直是无线传感器网络的一个研究热点.本文针对Leach路由算法的不足,提出一种新的基于能量考虑的梯度分簇路由算法.最后通过OMNET++仿真试验,来验证新的路由算法的优越性.     

基于能量均衡的便捷ZigBee路由改进算法

传统的ZigBee树路由算法的数据转发方式只能根据父子关系进行传输,其间将会消耗大量能量。为优化数据传输路径及数据传输过程中节点能量的均衡利用,文中提出一种改进型路由算法。充分利用邻居表,尽可能减少树路由跳数,同时考虑各节点能量的利用情况,使用能量值较高的节点进行数据传输。实验表明,改进的路由算法能够合理均衡能量,提高网络的整体寿命。     

基于AODV且考虑拓扑信息的节能路由算法

提出了一种基于AODV的节能路由算法EBF-AODV.该算法在路由发现过程中,源节点设置一个阈值,中间节点根据本节点拓扑变化情况决定如何处理路由请求分组,目的节点综合考虑路径上的可用能量和路由跳数,选择最佳路径.通过仿真证明了该算法的有效性.     

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

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

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

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

基于能量优化的无线传感器网络安全路由算法

针对无线传感器网络路由面临安全威胁和节点能量有限的不足,提出一种基于能量优化的安全路由算法(EOSR).该算法把优化能量、提高路由安全性和缩短传输时延同时作为设计目标,采用多目标决策,在保证安全性和快速传输的同时,让能量储备较多的节点承担较多的数据转发任务,可获得最优路由和延长网络生命期.通过预置公私密钥对,有效地提高了路由的安全性.给出了该算法中路由发现、路由选择和路由删除的具体步骤,通过仿真实验证明该算法的有效性.     

WSN中引入移动节点的路由协议设计与仿真

对于节点部署不均或者节点死亡而导致的监测盲区,可通过在WSN中引入移动节点来修复。提出一种修复策略,可较为及时、准确地修复监测盲区,同时考虑节点的能量均衡问题。在LEACH-M分簇路由算法的基础上,给出了一种按节点能量分配工作量的能量均衡分簇路由算法LEACH-M-G,并运用MATLAB仿真工具进行了仿真分析。仿真结果表明,所提出的监测盲区修复策略、以及LEACH-M-G路由能有效地修复监测盲区,均衡网络能量、延长网络生命周期。     

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

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

Interference Aware Route Discovery in Wireless Mobile Ad Hoc Networks

In this paper, we propose an interference aware expanding region search algorithm to locate a destination in mobile ad hoc networks. In the proposed approach, signal to interference plus noise ration (SINR) is used in place of TTL field of a route request packet. The source node initializes the search query with a threshold value of SINR. Each relay node forwards the packet if its SINR satisfies the threshold criteria provided by the source node in RREQ packet. As a result, the low SINR nodes are removed in route discovery phase prior to the establishment of routes. The simulation results show that proposed algorithm provides significant improvement in performance of reactive routing protocol in terms of reduced routing overhead, reduced energy consumption, and increased network throughput.

     

Routing in intermittent networks using storage domains

In this paper, we present a routing algorithm for a class of networks where a contemporaneous end‐to‐end path may not exist at the time of data transfer due to intermittent links. Several examples of such networks exist in the context of sensor networks, mobile ad hoc networks and delay tolerant networks. The proposed routing algorithms follow a priori routing similar to source routing. Link state changes are assumed to be known ahead of time, for instance, due to planned duty cycling resulting in scheduled connectivity. The basic idea behind the proposed routing algorithms is to modify the breadth first search (BFS) algorithm to take into account link state changes and find the quickest route between source and destination nodes. We introduce the idea of time‐varying storage domains where all nodes connected for a length of time act as a single storage unit by sharing the aggregated storage capacity of the nodes. This will help situations where storage is a limited resource. We evaluate the routing algorithm with and without storage domain in an extensive simulation. The delay performance of the proposed algorithms is conceptually the same as flooding‐based algorithms but without the penalty of multiple copies. More significantly, we show that the Quickest Storage Domain (Quickest SD) algorithm distributes the storage demand across many nodes in the network topology, enabling balanced load and higher network utilization. In fact, we show that for the same level of performance, we can actually cut the storage requirement in half using the Quickest SD algorithm. Copyright © 2009 John Wiley & Sons, Ltd.     

基于Grover搜索的多约束路由算法

寻找满足多约束条件的QoS路由是网络业务能否顺利实施的关键,在研究和分析了当前多种典型相关算法的基础上,提出了一种基于Grover量子搜索思想的多约束路由算法。算法对路径采用了非线性路径长度的度量方法,分析了Grover搜索的特点和优势,根据Grover迭代的实现过程构建了操作矩阵和概率扩散矩阵,通过选择高概率的节点进行数据转发。仿真表明,该算法在最短路径获取和路由发现成功率方面都有高效的表现。     

Dynamic traffic-aware routing algorithm for multi-sink wireless sensor networks

In this paper, a distributed traffic-balancing routing algorithm is proposed for multi-sink wireless sensor networks that effectively distributes traffic from sources to sinks. Each node has a gradient field that is used to decide on a neighbor node to reach a sink. The node’s gradient index contains (1) the distance cost from a source to a respective sink, and (2) traffic information from neighboring nodes. The proposed algorithm considers the traffic being faced by surrounding neighbors before forwarding packets to any sink using gradient search for routing and providing a balance between optimal paths and possible congestion on routes toward those sinks. The key objective of this work is to achieve traffic-balancing by detecting congested areas along the route and distributing packets along paths that have idle and underloaded nodes. Extensive simulations conducted to evaluate the performance of the proposed scheme indicate that it effectively reduces the overall packet delay, energy consumption and improves the packet delivery ratio under heavy traffic.     

MANET中基于DSR的一种最小能耗路由协议

如何高效地利用无线节点的有限能量是移动Ad Hoc网络(MANET)路由协议的一个重要考虑因素.鉴于动态源路由协议(DSR)没有考虑节点的能量限制,本文基于DSR协议提出了一种节能路由算法:MECP-DSR.它采用每报文能量消耗最小作为路由选取标准,并且在发送数据报文时对节点的发射功率进行控制.该文的仿真结果表明,MECP-DSR大大降低了节点的能量消耗,有效提高了移动Ad Hoc无线网络的生存期.     

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.     

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     

Stability-Based RREQ Forwarding Game for Stability-Oriented Route Discovery in MANETs

In traditional stability-oriented route discovery of mobile ad hoc networks, in-between nodes need to rebroadcast identical route request (RREQ) packets, which contain same source node ID and broadcast sequence number, to discover more stable route, yet it increases routing overhead and data transmission delay obviously. Therefore, a stability-oriented route discovery algorithm is proposed to limit routing overhead and decrease transmission delay. In this algorithm, all neighbor nodes of some node will play a mix strategy game named stability-based RREQ forwarding game after receiving an identical RREQ, and independently determine the RREQ forwarding probability based on Nash equilibrium, respectively. The simulation results show that the proposed stability-oriented route discovery algorithm not only reduces routing overhead and transmission delay effectively, but also improve other routing performance.     

A tabu search algorithm for routing optimization in mobile ad-hoc networks

In this paper, we propose a routing optimization algorithm to efficiently determine an optimal path from a source to a destination in mobile ad-hoc networks. To determine an optimal path for the nodes is important for transmitting data between nodes in densely deployed networks. In order to efficiently transmit data to its destination, the appropriate routing algorithms must be implemented in mobile ad-hoc networks. The proposed algorithm is designed by using a tabu search mechanism that is a representative meta-heuristic algorithm. The proposed tabu search algorithm carries out two neighborhood generating operations in order to determine an optimal path and minimize algorithm execution time. We compare the proposed tabu search algorithm with other meta-heuristic algorithms, which are the genetic algorithm and the simulated annealing, in terms of the routing cost and algorithm execution time. The comparison results show that the proposed tabu search algorithm outperforms the other algorithms and that it is suitable for adapting the routing optimization problem.     

A Vector-Based Routing Protocol in Underwater Wireless Sensor Networks

One major concern shared by many researchers about underwater wireless sensor networks (UWSNs), with respect to the limitations and particularities of underwater environment, is the problem of routing. These limitations include three-dimensional topology, limited bandwidth, node movement, long delay, limited energy, and construction costs. The new routing protocols for underwater networks have been developed on the basis of voracious routing systems. The main problem with UWSNs is finding an efficient route between the source and the target to send more packets to the target with lower levels of energy consumption. In this research, by improving VBF algorithm, which is dependent on the radius of the routing pipe, an algorithm is introduced which considers pipe radius as a function of the environment’s dimensions and of the range and the number of nodes. Consequently, by changing one of these parameters, the radius of the routing pipe changes. However, to control the energy consumed by the nodes, there exists a function that, if the recipient node’s energy to receive the packet is much lower than that of the sender node, the proposed method reduces the size of the routing pipe’s radius to lessen its chance of being selected as the guiding node so that other nodes are able to have the chance of getting the packet’s guiding node. The proposed algorithm has been compared with VBVA, HHVBF, and VBF protocols; the simulation results obtained from NS-2 simulator indicate that the proposed protocol could cut back on energy consumption, especially in networks with high number of nodes, by relying on changing the width of the routing pipe in proportion to network density. It was also successful in delivering more packets in non-dense networks.