移动自组网选播路由协议ARAD

针对移动自组(ad hoc)网的特点,提出了一种适合ad hoc移动网络的选播路由协议——ARAD协议.该协议在充分考虑选播路由特点的基础上,将ad hoc按需距离矢量路由(AODV)协议的路由发现机制与动态源路由(DSR)协议的缓存源路由技术相结合,在动态变化的ad hoc网络中实现了一种高效的选播路由.模拟结果表明,在动态的网络环境下,ARAD协议能够取得良好的性能.     

一种基于改进蚁群优化算法的WSNs路由协议

面对无线传感网络(wireless sensor network,WSN)路由问题,提出新颖生物激励-自我组织的安全自适应路由协议(biological inspired self-organized secure autonomous routing protocol,BIOSARP)。BIOSARP采用改进蚁群优化算法(improved ant colony optimization,IACO),利用端到端传输时延、剩余电量和链路质量计算信息素,并据此信息决策最优转发节点,从而减小广播次数和数据包负担,降低时延、数据包丢失率和功率消耗。仿真结果表明:提出的BIOSARP在数据包传递率、能量消耗优于安全实时负荷分配协议(secure real-time load distribution,SRTLD),数据包传递率提高24.75%,能量消耗降低31.8%。     

自组网中一种基于跨层负载感知的蚁群优化路由协议

将蚁群优化和跨层优化方法结合起来,提出了一种基于跨层负载感知和蚁群优化的路由协议(CLAOR)。协议将整个路径中各节点MAC层的总平均估计时延和节点队列缓存的占用情况结合起来,共同作为路由选择和路由调整的重要度量标准进行按需路由发现和维护,通过拥塞节点丢弃蚂蚁分组以及借助部分兼具蚂蚁功能的数据分组实现正常路由表的维护等方法,减少了控制开销,增加了算法的可扩展性,较好地解决了自组网中现有基于蚁群优化的路由协议中普遍存在的拥塞问题、捷径问题和引入的路由开销问题。仿真结果表明,CLAOR在分组成功递交率、路由开销以及端到端平均时延等方面具有优良性能,能很好地实现网络中的业务流负载均衡。     

一种基于AODV协议的无线传感器网络多路径路由改进方案

本文分析了AODV协议在静态无线传感器网络中的传输过程,针对单路径路由机制存在的中间节点路由延迟较大、负载集中而导致的网络节点能耗不均、数据传输效率低的问题,提出了一种针对AODV协议的改进方案。此改进方案在AODV协议中引入了多路径路由机制,同时在路径选择时考虑了节点剩余能量,从而在无线传感器网络数据传输中能避免热点,较好的解决断链问题,同时减少了原AODV路由查找的次数和延时,降低了路由开销。     

一种基于MPLS的Ad hoc无线移动网络解决方案

为改善目前Ad hoc网络在服务质量和流量工程支持上的不足,提出了一种节点独立多径的Ad hoc标签交换按需路由协议(AODLS)和基于多协议标签交换(MPLS)的Ad hoc无线移动网络模型.该协议通过将Ad hoc网络的路由技术与MPLS的标签快速交换技术相结合,使Ad hoc网络不仅能够支持传统的、无连接的IP服务,还能应用于移动MPLS网络,使其具备MPLS的服务质量(QoS)保证和流量工程的优点.仿真结果表明,AODLS在吞吐量、时延及路由发起频率上均比AODV路由协议有所改善,在节点移动情况下更加明显.     

Ad hoc无线网络路由技术的研究

路由技术是Ad hoc的关键技术,也是影响网络整体性能最重要的因素之一。对Ad hoc的路由协议进行总结性分析,并研究表驱动路由协议中的DSDV和按需路由协议中的DSR和AODV协议;结合现有协议存在的一些问题,提出相应的解决方案。     

Ad hoc网络中基于定期巡查机制的能量度量路由协议

目前在Adhoc网络中,现性的能量度量路由协议,一旦路由选定,数据包将一直发送,直到发送完毕或者路由中某个节点的能量耗尽结束。由于大量的数据包通过同一路由持续不断的发送,假如选定路由中某个节点的剩余能量不足以支持长时间的数据发送,那么这个节点必然会提前耗尽能量导致本路由的失效。连接在这个节点的其他路由也会因此失效。为解决之一问题,提出两个新的路由机制。一个是将MMBCR的能量消耗量计算存贮时间从原来的路由请求阶段调整到路由响应阶段,二是增加定期巡查机制即(PRD-MMBCR),定期检查路由中的情况变化,并根据变化调整路由。通过NS-2模拟环境的测试,PRD-MMBCR比现有的能量度量路由协议在延长路由的生命周期方面表现优异的多。     

自组网中一种可靠的层次路由协议

针对自组网中基于多层有中心分级结构(MCHS)的分级状态路由(HSR)协议存在结构稳定性差、结构维护开销大、可靠性不高和丢包问题严重等问题,提出一种可靠的层次路由协议(RHRP)。它基于一种新的多层无中心分级结构(MCLHS),该结构采用无中心策略,有利于提高结构稳定性和降低结构维护开销,并能进一步提高可靠性和降低路由开销。RHRP采用"高层虚拟链路以群为构成元素"的策略,使高层虚拟链路更稳定,有利于提高可靠性。更稳定的结构和高层虚拟链路可以减少丢包数目和重路由次数,从而降低传输时延和路由开销。通过分析路由可靠度,从理论上证明了RHRP的可靠性较高。通过仿真评价RHRP和HSR的性能,结果表明,RHRP在投递率、平均端到端时延和路由开销等指标上都优于HSR。     

一种能量高效的水下传感器网络路由协议

水下传感器网络的应用特点,使得高效利用网络节点能量、延长网络生存期成为水下传感器网络路由协议的一个显著特征。在目的节点序列距离矢量DSDV(Destination-Sequenced Distance-Vector)路由协议和基于最小代价场路由协议的基础上,提出了一种延长网络寿命的路由算法。该协议通过均衡每个网络节点的能量消耗,来达到延长整个网络生存期的目的,并进行仿真论证,仿真结果表明提出的这个路由协议相对于DSDV,网络生存时间延长了大约10%。     

基于广播树的移动自组织网络合作路由协议

为了激励自组网中的自私节点使其参与网络合作,提出了一种基于VCG机制计算转发节点支付的BEC协议,此协议对LDTTO协议的支付方案进行了改进,使源节点失去作弊动机.在路由发现阶段,创建以目的节点为根的广播树,将节点拓扑信息沿广播树以单播方式发送到根节点,降低了网络控制负载开销和路由发现延迟.BEC协议引入了容错机制,通过在混杂模式下对父节点的监听来确保数据的正确传输.在BEC协议中,高度为O(lgn)的广播树,路由发现过程的消息负载为O(nlogn),低于LOTID协议的O(n2).仿真实验结果表明,与现有的几种重要协议相比,BEC协议具有更低的消息负载和网络延迟.     

Preventing the impact of selfish behavior under MANET using Neighbor Credit Value based AODV routing algorithm

Mobile Ad hoc Network (MANET) nodes exchange information using the multi-hop wireless communications without the need for any pre-existing infrastructure. Routing protocols of MANET are designed with an assumption that the nodes will cooperate in routing process. To achieve high throughput and reliable communication, the nodes are expected to cooperate with each other. Routing protocol plays a crucial role in an effective communication between nodes and operates on the assumption that the nodes are fully cooperative. Due to the open structure and limited battery-based energy in MANET, some nodes may not cooperate correctly or behave maliciously and such kind of misbehavior impacts the fairness, reliability and efficiency in MANET. Previous work addressed the ways to overcome these kinds of node misbehaviors and attacks. Most of the existing works need time to analyse the neighbor traffic and decide whether a neighbor is behaving maliciously or not. Further, the existing credit-based detection mechanisms may mark a genuine idle node as a malicious node. This work addresses a simple Neighbor Credit Value based AODV (NCV-AODV) routing algorithm for the detection of selfish behavior which avoids such false detection. The proposed idea is implemented in Ad hoc On Demand Distance Vector (AODV) routing protocol and an extensive analysis on the performance of the proposed detection mechanism against the selfish behavior of some MANET nodes are conducted.     

A comparative QoS survey of mobile ad hoc network routing protocols

A mobile ad hoc network (MANET) is a wireless, dynamic, infrastructure-less, self-organized, multi-hop, and decentralized network. Each node in MANET can act as a router as well as a work station. Many routing protocols have been developed to increase the efficiency of MANET. The primary objective of this paper is a detailed QoS comparison of reactive (AODV), proactive (DSDV), and hybrid (ZRP) routing protocols of MANET in order to find which routing protocol works best in a particular network scenario. The analysis was made for TCP-based traffic patterns. The performance differentials were analyzed on the basis of normalized routing overhead, packet loss, packet delivery ratio, control packets, end-to-end delay, packet received, and packet sent with a variation of nodes density and mobility. The results were obtained using the NS-2 simulator.     

Genetic based optimization for multicast routing algorithm for MANET

Mobile Ad hoc Network (MANET) is established for a limited period, for special extemporaneous services related to mobile applications. This ad hoc network is set up for a limited period, in environments that change with the application. While in Internet the TCP/IP protocol suite supports a wide range of application, in MANETs protocols are tuned to specific customer/application. Multicasting is emerging as a popular communication format where the same packet is sent to multiple nodes in a network. Routing in multicasting involves maintaining routes and finding new node locations in a group and is NP-complete due to the dynamic nature of the network. In this paper, a Hybrid Genetic Based Optimization for Multicast Routing algorithm is proposed. The proposed algorithm uses the best features of Genetic Algorithm (GA) and particle swarm optimization (PSO) to improve the solution. Simulations were conducted by varying number of mobile nodes and results compared with Multicast AODV (MAODV) protocol, PSO based and GA based solution. The proposed optimization improves jitter, end to end delay and Packet Delivery Ratio (PDR) with faster convergence.     

ACO–EEOLSR: enhanced energy model based link stability routing protocol in mobile ad hoc networks

A mobile ad hoc network (MANET) has abundant mobile nodes that are free to communicate independently in many locations. Many existing energy models address the inadequacy of resources based on Ad hoc On-demand Multipath Distance Vector and Optimized Link State Protocol (OLSP) routing protocols for MANET along with various parameters. The architecture of energy-efficient routing mechanisms is a challenging problem in a MANET. In this work, a novel energy-aware routing model is introduced for MANET comprising an ant colony optimization (ACO) enhanced approach to energy-efficient-optimized link state routing (named ACO–EEOLSR). Initially, the route discovery is progressed by means of neighbor estimation and also with the authentication of link stability. Parameters such as energy, distance, and hop count are employed as willingness nodes, where both the energy and distance are entrenched through the OLSP. Consequently, the hop count is applied via the ACO system that is beneficial for link stability. After the acceptance of an acknowledgement, the hop count is authorized for further performance analysis. This approach increases the Quality of Service and also uses less energy compared to other energy models. The accomplished simulation upshot depicts that the ACO–EEOLSR outperforms the EEOLSR scheme with respect to the performance metrics of energy consumption, packet delivery ratio, total remaining time, average network lifetime, and a variance of energy.     

Multilayer flavoured dynamic source routing in mobile ad-hoc networks

Dynamic source routing (DSR, introduced in 1996) is one of the most frequently used routing protocols for mobile ad-hoc networks (MANETs). Numerous MANET protocols were created based on DSR's algorithm. In addition to inheriting the overall performance specifications of DSR, these MANET protocols are designed to perform optimised for specific functionality. To name a few, these functionalities include: hierarchical routing, security-aware routing and multipath routing. Such flavoured DSR schemes (X-DSR) are often compared against the original DSR protocol through simulation results. The purpose of this survey is to first introduce DSR in detail, discuss most of the DSR flavours, point out their specific features, and to present a complete survey of the analyses given in the current literature against the original DSR protocol. Following this in-depth discussion, we introduce an X-DSR-aware management architecture, which utilises a multilayer scheme that imports parameters from different layers (network, data-link and physical) and performs current network condition matching compared to the closest pre-defined network condition groups. The output of such a match is the selection of the most optimal routing protocol, which satisfies most of the criteria of the predefined condition group.     

Link stability and mobility in ad hoc wireless networks

The fact that ad hoc networks are required to support mobility of individual network nodes results in problems arising when routing data. These problems include route loss, poor longevity of established routes and asymmetric communications links. Mobility of nodes also increases the control traffic overhead and affects the performance of the protocol. Mobility can, however, be exploited to improve route longevity when establishing the route. In some situations, the source of information is not available (e.g. GPS information in the underground), hence protocols relying on this information will fail to operate correctly. In such situations, alternative `self-content' information should be available to perform the needed task of routing. Three novel schemes that make use of such information, the heading direction angle, to provide a mechanism for establishing and maintaining robust and long-lived routes are presented. The results show that these schemes reduce the overhead and increase the route longevity when compared with the AODV protocol. The schemes described can operate as a standalone mechanism or can be adopted by other routing protocols in order to improve their performance.     

An Energy Based Dynamic AODV Routing Protocol in Wireless Ad Hoc Networks

In recent years, with the rapid development of the Internet and wireless communication technology, wireless Ad hoc networks have received more attention. Due to the limited transmission range and energy of nodes in Ad hoc networks, it is important to establish a reliable and energy-balanced transmission path in Ad hoc networks. This paper proposes an energy-based dynamic routing protocol based on the existing AODV routing protocol, which has the following two aspects of improvement: (1) In the route discovery process, a node selects a suitable route from the minimum energy consumption route and the energy-balanced route designed in this paper according to a “Mark” bit that representing remaining energy of a node. (2) Based on (1), a route interruption update strategy was proposed to restart the route discovery process when node energy was used excessively. Simulation results demonstrate that compared with AODV and other existing routing protocols, proposed algorithm can reduce network energy consumption and balance node energy, thus extending the network lifetime.     

OLSR路由协议拓扑发现的一种实现方案

OLSR(Optimized Link State Routing Protocol,最优链路状态路由协议,RFC3626)协议是应用于MANET网络的一种先应式表驱动路由协议,其拓扑发现过程是实现有效通信的关键。本文提出了一种基于C 的OLSR协议拓扑发现的实现方案。该方案采用模块化面向对象设计方法,结合C 语言的特点使用了一些新的实现方法,主要完成了邻居侦测、链路侦测、MPR选举、HELLO消息处理、TC消息处理和拓扑计算等功能。     

AODV协议在无线传感器网络中的应用

通过对无线传感器网络（Wireless Sensor Network,WSN）和AODV路由协议的特性进行分析,认为AODV协议（Ad—hoc On—Demand Distance Vector Routing）具有在无线传感器网络中应用的可行性,只是在网络能量效率方面考虑不多．本文详细给出了改进方案,利用协议头中原有的保留选项来存储平均路径能量,选路时采用最小路由最大路径能量策略,同时增加转发RREQ和发送RREP的延迟时间．用NS-2软件对改进后方案从吞吐量、延时、剩余能量等角度进行仿真,结果证明该方案可行．     

Directional routing protocols for ad-hoc networks

A directional routing approach for multihop ad-hoc networks, is presented which has been applied to two on-demand routing protocols: namely dynamic source routing (DSR) and ad-hoc on-demand distance vector routing (AODV). Both DSR-based and AODV-based directional routing protocols are designed to balance the tradeoff between co-channel interferences from nodes hops away and the total power consumed by all the nodes. In order to select the best route, three metrics are considered in the route discovery process. They consist of hop count, power budget and overlaps between adjacent beams. By exploiting the direction of directional antennas, both routing protocols are capable of reducing overlaps between beams of the nodes along the route, thus eliminating interference. Arbitrary networks and random networks are considered in the simulations. The results show considerable performance gains for transmission of real-time traffic over ad hoc networks.