一种基于链路状态组合度量的无线网状网路由协议

在分析Ad hoc网络中的经典路由协议AODV的基础上,结合无线网状网的特点,提出了基于链路加权的无线网状网路由协议MODVWLS.协议通过节点的可用带宽、缓冲队列和吞吐性能等计算每一跳的代价(即权重),选择从信源到信宿累计权重最小的路径作为路由.对链路权重计算、报文格式、路由发现和维护过程进行了详细阐述,并利用NS2对MODVWLS协议进行了仿真实现.结果表明,MODVWLS协议能合理利用空闲节点和链路资源,较好地均衡网络负载,在数据包转发率、端到端延迟和标准化路由负载等性能上均优于AODV协议.     

一种基于AODV路由协议改进的无线Mesh路由协议

在分析经典路由协议AODV的基础上,结合Mesh网络的特点,提出了一种新的路由协议AODV-LS.新的路由协议根据节点带宽以及实时负载量这两个参数计算出节点权重值,根据节点权重值评估链路的性能,根据链路性能选择最优路径.实验结果表明,AODV-LS协议在数据分组投递率、端到端延时和标准化路由负载方面都优于AODV.     

混合无线Mesh 网络中改进的分层AODV路由协议

路由是无线Mesh 网络发展中的一个研究热点。无线Mesh 网络从移动Ad hoc 网络中借鉴了许多路由选择算法作为路由的解决方案,但是这些方法都不太理想或者没有达到性能的最优化,且没有利用到无线Mesh 网络自身的特点。提出了一个改进的分层AODV路由协议（IH-ADOV）,它表现出了更好的可扩展性和网络性能,当一条路由丢失时,它使寻找替代路由的路由开销得到降低。在IH-AODV中,还提出了一种新技术,即最新链路发现机制。利用NS-2 软件对AODV和IH-AODV进行了仿真比较。基于混合无线Mesh 网络的仿真结果表明,IH-AODV在大的网络中也表现出了很好的扩展性,相对于AODV,在其他性能 方面也表现良好甚至更优。     

一种负载均衡的移动Ad-hoc网络路由协议及改进

随着移动ad hoc网络负载的增加，现有路由协议的性能将急剧下降。为适应重负载网络，本文提出了一种带宽估算模型和负载平衡技术，并结合AODV（Ad hoc On-demand Distance Vector Routing）设计了新的路由协议。同时考虑到时廷因素，对新协议进一步改进。仿真表明，本文提出的协议可以提高分组传送率，降低平均端到端时延，并减少路由开销。     

车载自组网路由稳定性分析

针对车载移动ad hoc网络的特点,从路由断裂的角度在原理和理论上分析了车载移动ad hoc网络路由不稳定的各种情况,在分析结论的基础上提出了一种不依赖GPS信息的基于节点相对稳定性的类AODV路由协议RSBA（Relative Stability Based AODV Routing Protocol）,通过可行性分析及实验仿真证明了新协议比AODV协议更适合节点密度较高的城市车载环境,具有较低的路由断链率和路由负载,有效降低丢包率,可扩展性提高,同时验证了对车载移动ad hoc网络路由稳定性分析策略和结论的正确性。     

移动ad hoc网络AODV协议的分析与改进

由于移动ad hoc网络的AODV（Ad hoc on-Demand Distant Vector）协议仅维护1条到目的节点的路由记录,即使路由未失效,在超时后也会被删除,因此提出改进的AODV协议---HI-AODV协议.改进内容为：（1）借鉴DSR协议的特点,使其路由表维护多条路由记录;（2）在路由发现和路由维护中有效利用路由缓存信息和多路径路由,使得路由发现更加迅速.仿真结果表明HI-AODV协议可以提高数据吞吐量,减小平均延时.但由于移动ad hoc网络节点的移动性,采用HI-AODV协议容易导致路由信息失效,对路由协议产生负面影响.     

无线自组网路由协议研究及OPNET实现

无线Ad hoc网络是一种由节点任意移动、拓扑结构动态、随机且快速变化的自组网。由于其复杂性和多棒性,常规路由无法传输信息。所以自组网路由协议一直是无线网络研究中的热点之一,目前大多数无线Ad hoc网络采用AODV或DSR路由协议。对这两种路由协议在不同网络环境下的性能进行了进行比较,分析。并对AODV协议进行改进,仿真结果表明,改进的AODV路由协议增加了无线Ad hoc网络的吞吐量,降低了延时和路由开销,从而有效地提供了网络性能。     

Adhoc网络路由协议性能仿真分析

Ad hoc移动网络是一种无任何有线基础设施的多跳、临时性自治系统,而路由协议是Ad hoc网络体系结构中不可缺少的组成部分,所以路由协议的研究十分重要.文中使用NS2仿真软件对Ad hoc网络中DSDV、DSR和AODV三种典型路由协议,从分组投递率、端到端平均时延和路由负荷三方面进行性能仿真分析.仿真对比结果表明:DSDV的平均时延和路由负荷要小于AODV和DSR,但分组投递率性能不如AODV和DSR.根据它们的这些特点分析得出:AODV协议适用于网络拓扑变化频繁的情况;DSR协议适用于节点较少、网络变化较小且对时延要求不高的情况;而DSDV协议更适用于网络节点移动速度较小的情况.     

AODV协议的选播QoS扩展研究与仿真

针对移动自组网(Ad hoc)的特点和AODV协议的可扩展性,提出了一种适合Ad hoc的选播QoS路由协议AQAODV,该协议在考虑选播路由特点的基础上,扩展AODV以支持QoS需求,并采用局部路由恢复技术,在动态变化的Ad hoc网中实现了一种高效的选播QoS路由.仿真结果表明,AQAODV协议在带宽、时延和平均路由开销等方面较AODV协议具有明显的性能优势.     

WMN中新型路由协议HR-AODV的实现

对移动Ad hoc网络现有的AODV协议进行改进,实现一种将主动路由与被动路由相结合的新型混合路由方式,并增加范围限定机制以及折中距离和能量机制,改进后的HR-AODV协议在无线Mesh网络下具有较好的性能,可在网络层更好地服务于上层应用。NS2仿真结果表明,HR-AODV协议在时延、丢包率以及吞吐量等方面有较大改善,具有较强的健壮性和容错性。     

Performance evaluation for on-demand routing protocols based on OPNET modules in wireless mesh networks

In wireless networks, users expect to get access to the network securely and seamlessly to share the data flow of access points anytime and anywhere. However, either point-to-point or point-to-multipoint methods in traditional wireless networks make the network bandwidth decrease rapidly, which cannot meet the requirements of users. Recently, a new wireless broadband access network, wireless mesh networks (WMNs), has emerged. As one of the key technologies in WMNs, wireless routing protocols plays an important role in performance optimization of WMNs. Therefore, in this paper, we address the on-demand routing protocols by focusing on dynamic source routing (DSR) protocol and ad hoc on-demand distance vector (AODV) routing protocol in WMNs. Then, we use the OPNET modules to establish the simulation models of DSR and AODV protocols in WMNs. Simulation and results show that, DSR protocol that is based on the dynamic source routing is not suitable for wireless transmission, while AODV routing protocol that is based on the purpose-driven routing is suitable for wireless transmission with rapid change of network topology.     

无线传感器网络路由协议的分析与比较

无线传感器网络的路由协议设计与传统的无线ad-hoc网络有很多不同,资源高度受限和结点失效频繁是其面临的两大挑战,相关技术研究已经成为无线传感器网络研究中的热点.对近年来无线传感器网络路由协议的研究成果进行归纳、分析和比较,介绍了无线传感器网络的特点以及影响其路由协议设计的关键因素.根据协议的实现特点将无线传感器网络路由协议分为5类,对每一类涉及的重要协议进行详细阐述与分析,最后对这些协议的特点进行归纳和比较,并展望了未来这一研究方向的发展趋势.     

按需式ad hoc移动网络路由协议的研究进展

Ad hoc移动网络是一种完全由移动主机构成的网络，网络拓扑易变，带宽，能源有限是ad hoc移动网络的主要特点，针对这些特点，目前设计的ad hoc路由协议大多采用按需查找方式，该文介绍了这方面研究的最新进展，对几种典型的按需路由协议进行了说明，分析和综合比较，文中分析了目前协议存在的一些问题并提出了相应的改进方法，最后指出了下一步研究方向。     

高能量节点驱动的按需距离矢量路由协议

无线自组织网络中的按需距离矢量路由协议(AODV)没有考虑到能量消耗的均衡性和网络生命期的问题。针对AODV的这一缺点,提出了一种高能量节点驱动的AODV协议(HN-AODV)。此协议将高能量节点驱动的策略应用于按需路由发现过程,尽量选择能量较高的节点来承担转发任务,以此来平衡网络能耗。仿真结果显示,HN-AODV在基本不降低数据传输性能的前提下,显著提高了网络生命周期。这种高能量节点驱动的方案同样可以运用在其它类似的反应式路由协议中。     

车载自组织网络路由协议的仿真研究

本文简要介绍了车载自组织网络和移动自组织网络中两个典型的路由协议:表驱动路由协议DSDV和按需路由协议AODV;还介绍了一个实用的移动模型,使仿真实验更加接近现实。在Linux下使用网络仿真工具NS2对这两个典型协议进行仿真,并对仿真结果进行分析比较和性能评价,得出:AODV和DSDV协议都不太适用于车辆自组织网络,所以设计适合车辆网路的协议是急需解决的问题。     

一种安全的Ad Hoc网络路由协议SGSR

Ad Hoc网络作为一种无线移动网络,其安全问题,特别是路由协议的安全备受关注。针对现有适合移动Ad Hoc网络的链路状态路由协议GSR无法防范恶意节点伪造、篡改、DoS攻击的现状,本文提出了一种在移动Ad Hoc网络中抵抗单个节点恶意攻击的安全路由协议SGSR,给出了认证协议的形式化证明,并对路由协议进行仿真和性能分析。     

An on-demand routing protocol for improving channel use efficiency in multichannel ad hoc networks

In wireless ad hoc networks, end-to-end delivery over network is a critical concern for routing protocols. The capacity of routing protocols is constrained by the intra-flow interference introduced by adjacent nodes on the same path, and inter-flow interference generated by nodes from neighboring paths. In this paper, we develop an on-demand routing protocol M-AODV-R that solves the channel assignment, reuse and routing problem jointly. The proposed channel reuse scheme and channel assignment scheme can enhance channel reuse rate. This cross-layer design approach can significantly improve the performance of multichannel ad hoc networks over existing routing protocols. Simulation results show that the proposed routing M-AODV-R can effectively increase throughput and reduce delay, as compared to AODV protocol.     

Survey of network coding-aware routing protocols in wireless networks

In recent times, there have been many advances in the field of information theory and wireless ad hoc network technologies. Regarding information theory progression and its connection with wireless ad hoc networks, this study presents fundamental concepts related to the application of the state-of-the-art Network Coding (NC) within wireless ad hoc networks in the context of routing. To begin with, this paper briefly describes opportunistic routing and identifies differentiation between NC-aware and NC-based routing mechanisms in wireless ad hoc networks. However, our main focus is to provide a survey of available NC-aware routing protocols that make forwarding decisions based on the information of available coding opportunities across several routes within wireless ad hoc networks. The taxonomy and characteristics of various representative NC-aware routing protocols will also be discussed. In summary, we provide a comparison of available NC-aware routing schemes and conclude that NC-aware routing techniques have several advantages over traditional routing in terms of high throughput, high reliability, and lower delay in a wireless scenario. To the best of our knowledge, this work is the first that provides comprehensive discussion about NC-aware routing protocols.     

Modelling and verifying the AODV routing protocol

This paper presents a formal specification of the Ad hoc On-demand Distance Vector (AODV) routing protocol using AWN (Algebra for Wireless Networks), a recent process algebra which has been tailored for the modelling of mobile ad hoc networks and wireless mesh network protocols. Our formalisation models the exact details of the core functionality of AODV, such as route discovery, route maintenance and error handling. We demonstrate how AWN can be used to reason about critical protocol properties by providing detailed proofs of loop freedom and route correctness.     

A lightweight anonymous routing protocol without public key en/decryptions for wireless ad hoc networks

More attention should be paid to anonymous routing protocols in secure wireless ad hoc networks. However, as far as we know, only a few papers on secure routing protocols have addressed both issues of anonymity and efficiency. Most recent protocols adopted public key Infrastructure (PKI) solutions to ensure the anonymity and security of route constructing mechanisms. Since PKI solution requires huge and expensive infrastructure with complex computations and the resource constraints of small ad hoc devices; a two-layer authentication protocol with anonymous routing (TAPAR) is proposed in this paper. TAPAR does not adopt public key computations to provide secure and anonymous communications between source and destination nodes over wireless ad hoc networks. Moreover, TAPAR accomplishes mutual authentication, session key agreement, and forward secrecy among communicating nodes; along with integration of non-PKI techniques into the routing protocol allowing the source node to anonymously interact with the destination node through a number of intermediate nodes. Without adopting PKI en/decryptions, our proposed TAPAR can be efficiently implemented on small ad hoc devices while at least reducing the computational overhead of participating nodes in TAPAR by 21.75%. Our protocol is certainly favorable when compared with other related protocols.