基于蚁群优化的移动P2P网络路由选择算法

因为移动P2P网络具有动态性而且移动节点能量受限,提升移动P2P数据传输效率至关重要.利用蚁群优化算法,将蚂蚁的信息素与节点的能量和通信带宽结合起来,在蚁群选择路径时,减少其寻优路径上的信息素浓度,根据概率路由表中信息素的浓度对路由选择策略进行调整,避免网络拥塞和个别节点能量消耗过快,提出了一种移动P2P网络的多路径路由选择算法.实验结果表明,与EDSR路由协议相比,提出的算法能够降低节点的分组丢失率和端到端的平均时延,提高了网络的生存周期.     

基于时延调节的移动自组网多路径路由策略

针对AOMDV协议的多路径切换机制,提出了一种基于时延调节的移动自组网多路径路由策略,根据目的端获得的分组时延规律主动切换路径,达到负载均衡的目的。仿真实验结果表明,能在一定程度上降低路由开销以及延长网络生存时间。     

基于蚁群算法的移动自组网AODV路由协议动态优化

目前研究的移动自组网AODV路由协议优化方法数据传输时延较高。为了解决上述问题,研究了移动自组网AODV路由协议动态优化方法,提出基于蚁群算法优化了路由通信传输路径的规划方法。调整了路径规划的避障规则和关键节点敏感度,增强了关键路径节点的信息素浓度并设置了信息素等级划分,进一步优化了通信传输最优路径的识别与规划方案。通过对各节点信息素的识别结果,通过蚁群算法进行计算,求出最优解,则可以得到最优传输路线。从实验结果来看,优化后的路由通信数据传输平均时延保持在0.3～0.45 s,说明能够降低网络拥堵情况,路径节点变化趋于稳定,整体的工作效率和性能都有明显优化。     

一种基于功耗考虑的自组网路由算法研究

对移动自组网中路由协议的负载均衡问题进行了分析与研究,并以区域路由协议(ZRP)为基础,引入负载均衡的思想,对主动式部分的路由策略进行了算法改进。仿真结果证明,该算法在对路由开销没有明显增加以及算法复杂度不变的情况下,使得网络节点的功耗性能得到了很大的改善与提升。     

移动自组网基于地理位置信息的能量辅助路由协议

针对移动自组网网络生存时间较短、传统按需路由协议开销大且易断裂的问题,文中提出一种移动自组网基于地理位置信息的能量辅助路由协议LEAODV(Location-Energy-AODV).传统按需距离矢量协议以广播方式进行路由发现,路由开销大且未考虑节点能量耗尽而造成路由断裂问题.LEAODV路由协议考虑通信节点地理位置信...     

基于蚁群优化算法的路由协议的研究

生物仿真学群集算法在路由中有广泛的的应用,为了充分利用网络资源,降低拥塞程度,提出了一种基于蚁群优化算法的Ad Hoc网络负载均衡路由算法Pro-antnet,通过对蚂蚁收集到的网络信息所对应的参数赋予不同加权值的方法对路由表进行控制,有效地缓解了网络的拥塞问题。该算法具有良好的分布式特性,能为网络提供多条备用路径,增强网络的抗毁性。     

MANET中基于移动代理的路由策略

本文首先分析了现有移动Ad Hoc网络的两类路由协议及其优缺点，接着提出将移动代理应用于按需路由的方案。通过移动代理更新节点路由表，从而在网络负载增加不大的情况下，减小路由请求发起数，降低端到端的数据传输延迟。还可在移动代理中加入节点能量信息、节点负载信息等，通过移动代理在网络中漫游，收集并更新途经节点的相应信息，从而达到节能和缓解网络拥塞的目的。     

一种无线短波自组网QoS源路由协议

针对无线短波自组网传输信道的特殊性,通过分析链路质量和节点业务负载对路由性能的影响,提出了一种基于路径质量和网络负载均衡的QoS源路由协议,它将链路质量、跳数及中间节点的负载信息作为最优路径选择标准。详细阐述了该路由协议的工作机制,并给出了具体的代价函数计算公式。分析结果表明,该路由协议的确可以提高无线短波自组网的路由性能,能够满足短波自组网的特殊要求。     

基于蚁群优化算法的Ad Hoc网络路由协议研究

路由协议的研究是Ad Hoc网络的重点和难点。文章在分析已有Ad Hoc网络路由协议的基础上,结合蚁群算法的原理,首次提出了根据蚂蚁释放有效信息素的比率,引入服务代理来减少蚂蚁代理开销的路由协议。在网络仿真平台NS-2上进行了算法仿真实现,并与现有的典型协议在不同的实验场景下进行性能分析比较,仿真结果表明新的基于蚁群优化算法的Ad Hoc网路由算法具有比其它算法更好的性能。     

基于跨层设计的AODV路由优化机制

以AODV(无线自组网按需平面距离矢量路由)协议为原型,针对WMN(无线Mesh网)中传统AODV协议路由判据单一从而导致路由性能较差的缺陷,采用跨层设计方法为WMN设计了一种新的IAODV(优化的AODV)协议。在路由计算过程中通过跨层操作机制提取节点当前负载和链路投递率这两个影响链路质量的因素,结合路由跳数设计出合理的路由判决函数。理论分析和NS2仿真结果证明,这种路由优化机制提高了吞吐量,降低了网络时延,并且能够达到负载均衡的路由效果。     

SMORT: Scalable multipath on-demand routing for mobile ad hoc networks

Increasing popularity and availability of portable wireless devices, which constitute mobile ad hoc networks, calls for scalable ad hoc routing protocols. On-demand routing protocols adapt well with dynamic topologies of ad hoc networks, because of their lower control overhead and quick response to route breaks. But, as the size of the network increases, these protocols cease to perform due to large routing overhead generated while repairing route breaks. We propose a multipath on-demand routing protocol (SMORT), which reduces the routing overhead incurred in recovering from route breaks, by using secondary paths. SMORT computes fail-safe multiple paths, which provide all the intermediate nodes on the primary path with multiple routes (if exists) to destination. Exhaustive simulations using GloMoSim with large networks (2000 nodes) confirm that SMORT is scalable, and performs better even at higher mobility and traffic loads, when compared to the disjoint multipath routing protocol (DMRP) and ad hoc on-demand distance vector (AODV) routing protocol.     

Adaptive reliable and congestion control routing protocol for MANET

In mobile ad hoc networks (MANETs), the packet loss can be caused either by link failure or by node failure. Moreover, the techniques for selecting the bypass route and avoiding congestion in the bypass route are rarely handled. To overcome these, in this paper, we propose an adaptive reliable and congestion control routing protocol to resolve congestion and route errors using bypass route selection in MANETs. The multiple paths are constructed. Among which, the shortest paths are found for efficient data transmission. The congestion is detected on the basis of utilization and capacity of link and paths. When a source node detects congestion on a link along the path, it distributes traffic over alternative paths by considering the path availability threshold and using a traffic splitting function. If a node cannot resolve the congestion, it signals its neighbors using the congestion indication bit. By using simulation, we show that that the proposed protocol is reliable and achieves more throughput with reduced packet drops and overhead.     

A region-based routing protocol for wireless mobile ad hoc networks

Flooding-based route discovery is widely assumed in existing routing protocols of wireless ad hoc networks. Network-wide flooding enables the discovery of optimal routes from sources to destinations; however, as all network nodes are required to participate in the relays of route request packets, substantial control overhead is inevitable. Some efficient broadcast schemes can suppress redundant packet relays, but they often suppress the discovery of optimal routes, too. In this article we propose to dynamically create a prerouting region between each source-destination pair and limit the propagations of route request packets only within this region. The prerouting region effectively restricts route discovery activities to the nodes that most likely constitute the optimal or near-optimal routes. Consequently, not only is route construction overhead significantly reduced; route optimality is also guaranteed. The article presents a region-based routing (REGR) protocol covering both new route formation cases and route update cases. Simulations show that our protocol is particularly beneficial to dense and large-scale mobile ad hoc networks.     

Discovering long lifetime routes in mobile ad hoc networks

In mobile ad hoc networks, node mobility causes frequent link failures, thus invalidating the routes containing those links. Once a link is detected broken, an alternate route has to be discovered, incurring extra route discovery overhead and packet latency. The traffic is also interrupted at the transport layer, and proper traffic recovery schemes have to be applied. To reduce the frequency of costly route re-discovery procedures and to maintain continuous traffic flow for reliable transport layer protocols, we suggest discovering long lifetime routes (LLR). In this paper, we first propose g-LLR, a global LLR discovery algorithm, that discovers LLRs of different route lengths for any given pair of nodes. We then propose a distributed LLR discovery scheme (d-LLR) that discovers two of the most desirable LLRs through one best-effort route discovery procedure. Simulations show that the lifetimes of the routes discovered by d-LLR are very close to those discovered by g-LLR. Simulations also show that the performance of different transport layer protocols is greatly improved by using LLRs. More importantly, traffic can remain continuous using the provided LLRs. D-LLR can be implemented as an extension to existing ad hoc routing protocols, and it improves the performance of transport layer protocols without modifications on them.     

Efficient on-demand routing for mobile ad hoc wireless access networks

In this paper, we consider a mobile ad hoc wireless access network in which mobile nodes can access the Internet via one or more stationary gateway nodes. Mobile nodes outside the transmission range of the gateway can continue to communicate with the gateway via their neighboring nodes over multihop paths. On-demand routing schemes are appealing because of their low routing overhead in bandwidth restricted mobile ad hoc networks, however, their routing control overhead increases exponentially with node density in a given geographic area. To control the overhead of on-demand routing without sacrificing performance, we present a novel extension of the ad hoc on-demand distance vector (AODV) routing protocol, called LB-AODV, which incorporates the concept of load-balancing (LB). Simulation results show that as traffic increases, our proposed LB-AODV routing protocol has a significantly higher packet delivery fraction, a lower end-to-end delay and a reduced routing overhead when compared with both AODV and gossip-based routing protocols.     

Improving protocol robustness in ad hoc networks through cooperative packet caching and shortest multipath routing

A mobile ad hoc network is an autonomous system of infrastructure-less, multihop, wireless mobile nodes. Reactive routing protocols perform well in this environment due to their ability to cope quickly against topological changes. This paper proposes a new routing protocol named CHAMP (caching and multiple path) routing protocol. CHAMP uses cooperative packet caching and shortest multipath routing to reduce packet loss due to frequent route failures. We show through extensive simulation results that these two techniques yield significant improvement in terms of packet delivery, end-to-end delay and routing overhead. We also show that existing protocol optimizations employed to reduce packet loss due to frequent route failures, namely local repair in AODV and packet salvaging in DSR, are not effective at high mobility rates and high network traffic.     

On-demand loop-free routing with link vectors

We present the on-demand link vector (OLIVE) protocol, a routing protocol for ad hoc networks based on link-state information that is free of routing loops and supports destination-based packet forwarding. Routers exchange routing information reactively for each destination in the form of complete paths, and each node creates a labeled source graph based on the paths advertised by its neighbors. A node originates a broadcast route request (RREQ) to obtain a route for a destination for which a complete path does not exist in its source graph. When the original path breaks, a node can select an alternative path based on information reported by neighbors, and a node can send a unicast RREQ to verify that the route is still active. A node that cannot find any alternate path to a destination sends route errors reliably to those neighbors that were using it as next hop to the destination. Using simulation experiments in ns2, OLIVE is shown to outperform dynamic source routing, ad hoc on-demand distance vector, optimized link-state routing protocol, and topology broadcast based on reverse-path forwarding, in terms of control overhead, throughput, and average network delay, while maintaining loop-free routing with no need for source routes.     

Optimised relay selection for route discovery in reactive routing

On-demand routing protocols have the potential to provide scalable information delivery in large ad hoc networks. The novelty of these protocols is in their approach to route discovery, where a route is determined only when it is required by initiating a route discovery procedure. Much of the research in this area has focused on reducing the route discovery overhead when prior knowledge of the destination is available at the source or by routing through stable links. Hence, many of the protocols proposed to date still resort to flooding the network when prior knowledge about the destination is un-available. This paper proposes a novel routing protocol for ad hoc networks, called On-demand Tree-based Routing Protocol (OTRP). This protocol combines the idea of hop-by-hop routing (as used by AODV) with an efficient route discovery algorithm called Tree-based Optimised Flooding (TOF) to improve scalability of ad hoc networks when there is no prior knowledge about the destination. To achieve this in OTRP, route discovery overheads are minimised by selectively flooding the network through a limited set of nodes, referred to as branching nodes. The key factors governing the performance of OTRP are theoretically analysed and evaluated, including the number of branch nodes, location of branching nodes and number of Route REQuest (RREQ) retries. It was found that the performance of OTRP (evaluated using a variety of well-known metrics) improves as the number of branching nodes increases and the number of consumed RREQ retries is reduced. Additionally, theoretical analysis and simulation results shows that OTRP outperforms AODV, DYMO, and OLSR with reduced overheads as the number of nodes and traffic load increases.     

Load Balanced Congestion Adaptive Routing for Randomly Distributed Mobile Adhoc Networks

In mobile ad hoc networks, congestion occurs due to limited sources of the network, which leads to packet losses, bandwidth degradation and wastes time and energy on congestion recovery. Various techniques have been developed in attempt to minimize congestion in uniformly distributed networks. In this paper, a load balanced congestion adaptive routing algorithm has been proposed for randomly distributed networks. In the proposed algorithm two metrics: traffic load density and life time associated with a routing path, have been used to determine the congestion status and weakest node of the route. The route with low traffic load density and maximum life time is selected for packet transmission.     

Design and Performance Analysis of a Proxy-Based Indirect Routing Scheme in Ad Hoc Wireless Networks

The majority of existing ad hoc network routing protocols has a tendency to use the shortest single path from a source to a destination. However, in constantly changing topologies such as those in mobile ad hoc wireless networks, the shortest single path is not only unreliable for reachability but also unsuitable for traffic load equilibrium. In order to improve routing performance and make optimum use of the limited resources, the congestion must first be relieved as much as possible and the routing path be made available at all times. In this paper, we propose a novel scheme, called the Applicative Indirect Routing (AIR), to control network traffic congestion and refine route availability by coping with unreliable links quickly. The proposed scheme, acting as a proactive routing protocol, utilizes additional information about the neighbors shared by the sender and the receiver to find an alternative for the original path with unreliable links. The additional bandwidth usage in AIR to obtain the information about shared neighbors (defined as proxy candidates) is so minimal that the bandwidth availability for user data traffic is not significantly affected. Extensive simulation experiments show that compared with a conventional proactive protocol, namely Destination-Sequenced Distance Vector (DSDV), the AIR scheme leads to a much improved system performance in terms of packet delivery ratio, average end-to-end packet delay, and network reliability. We further show that, in terms of packet delivery ratio, AIR is also a competitive protocol compared with such reactive protocols as Ad hoc On Demand Distance Vector (AODV) and Dynamic Source Routing (DSR).