无线移动自组织网路由协议综述

本文首先简单介绍了Adhoc网的概貌，然后全面介绍了Adhoc网的路由协议。包括平面路由协议和分层路由协议，先验式和反应式路由协议以及GPs辅助型路由协议。     

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

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

关于Ad Hoc网络路由协议的探讨

Ad Hoc无线网络是一种移动通信和计算机网络相结合的网络,本文阐述了Ad Hoc无线网络的特点,并分析目前已有的路由协议,最后指出下一步研究方向。     

应用于Ad Hoc网络的时延敏感自适应路由协议

针对Ad Hoc网络中实时业务对网络平均时延的要求,提出了一种应用于Ad Hoc网络的新型路由协议——时延敏感的自适应路由协议。该协议在保持“最少跳数”的最佳路由条件下,增加了“平均最短时延”的约束条件,从而不仅可以为实时业务(即时延敏感的业务)提供可靠的路由,同时还能根据网络节点当前的业务流量,动态地选择最佳路径,降低网络的平均时延。这是一种新型的有QoS保证的路由协议。仿真结果表明,该协议的确可以有效地改善网络的性能。     

基于能量有效的Ad hoc路由协议的研究

Ad hoc网络是一种无基础设施,由无线移动终端组成的临时多跳自治网络。本文从能量有效的目标出发,对3类不同策略的路由协议进行比较,评价各个协议之间的性能优劣。     

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

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

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

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

大规模灾害条件下基于连通支配集的重路由方案

针对在大规模灾害条件下,网络拓扑变化剧烈,现有的洪泛机制将会恶化网络性能的情况,提出了一种基于连通支配集的重路由方案,能够在拓扑发生剧烈变化后,快速提供恢复路径来确保节点间重要业务的快速可达.该方案应用连通支配集划分网络.通过只允许连通支配集内的路由器转发链路状态信息,来限制产生的链路状态信息的副本数量,以减小网络拓扑的剧烈变化对网络性能的冲击,并根据不同拓扑变化提供连通支配集的快速更新、重计算策略.仿真结果表明,该方案能够有效降低网络中链路状态信息报文的数量,同时不增加网络收敛时间.     

一种新型水下移动自组织网路由算法

目前针对移动自组织网提出的路由协议普遍存在路由发现和路由维护效率低的问题,在研究按需距离矢量(AODV)路由算法的基础上,提出了一种水下多路径选择按需距离向量算法(MAODV)。该算法采用多节点路由切换机制,在一条链路失效后不必重新启动路由发现过程,而选用备用节点构成新的链路,继续进行数据包的传输,大大节省了信息资源和带宽。计算机统计仿真表明,该MAODV方法的性能在端到端通信的平均时间延迟和数据包接收率上均优于(AODV)。有效地解决了路由协议中路由发现和路由维护效率低的问题。     

基于路由量的无线传感器网络路由协议

提出一种新颖的能量感知型无线传感器网络路由协议,并给出实现过程和仿真结果.从无线传感器网络实际的应用需求出发,综合WSN在能量高效、可扩展性、服务质量等方面的不同要求,基于重点关注节点路由量的策略,在对当前主流WSN路由协议深入研究的基础上设计出了基于路由量的动态WSN路由协议.仿真结果表明:设计的路由协议可以在传感器网络系统层面较好地改善能量消耗的有效性和均衡性,因而避免了网络中热点的过早出现,延长了整个网络的生存期.     

Two-terminal reliability analyses for a mobile ad hoc wireless network

Reliability is one of the most important performance measures for emerging technologies. For these systems, shortcomings are often overlooked in early releases as the cutting edge technology overshadows a fragile design. Currently, the proliferation of the mobile ad hoc wireless networks (MAWN) is moving from cutting edge to commodity and thus, reliable performance will be expected. Generally, ad hoc networking is applied for the flexibility and mobility it provides. As a result, military and first responders employ this network scheme and the reliability of the network becomes paramount. To ensure reliability is achieved, one must first be able to analyze and calculate the reliability of the MAWN. This work describes the unique attributes of the MAWN and how the classical analysis of network reliability, where the network configuration is known a priori, can be adjusted to model and analyze this type of network. The methods developed acknowledge the dynamic and scalable nature of the MAWN along with its absence of infrastructure. Thus, the methods rely on a modeling approach that considers the probabilistic formation of different network configurations in a MAWN. Hence, this paper proposes reliability analysis methods that consider the effect of node mobility and the continuous changes in the network's connectivity.     

无线自组网中基于实时流的服务质量路由协议

提出了一种基于实时流的无线自组网服务质量（QoS）路由协议,其核心思想是载波侦听范围内的节点间通过交换实时流的带宽消耗和本地可用带宽信息,估计出节点的邻居可用带宽,根据此带宽进行路由发现和新实时流的接纳控制,并根据实时流的带宽要求预留资源。对每个实时流分别建立一条路由,避免相同源和目的的实时流之间的竞争,有利于负载均衡。模拟实验表明,这种基于实时流的QoS路由协议能够为实时应用提供更好的OoS保障。     

Flooding-limited for multi-constrained quality-of-service routing protocol in mobile ad hoc networks

Multi-constrained quality-of-service (QoS) routing is used to find routes in a network to satisfy multiple independent QoS constraints. This problem is considered to be NP-complete, and most existing QoS routing algorithms are based on maintaining a global network state at every node. A multi-constrained, flooding-limited, QoS routing method to deal with limited available resources and minimum computation in a dynamic environment is proposed. The solution is based on decomposition of a routing area and a restriction in the exchange of routing information. It reduces the size of the control messages, restricts the amount of routing information, minimises the overhead from the flooding of control traffic and decreases the complexity of path selection. It is also proved that the flooding-limited-path heuristic can achieve very high performance by maintaining entries in each node, which indicates that the performance of the limited-path heuristic is not sensitive to the number of constraints. Simulation results show that this protocol provides better performance than other protocols, especially with regards to end-to-end delay, throughput and packet loss.     

支持动态带宽约束的Ad Hoc网络QoS路由协议

针对已有的Ad Hoc网络QoS路由协议不能有效支持具有动态资源需求的特性业务的问题,提出了一种路径上传输带宽可动态调整的带宽约束QoS路由协议.路由建立后,若路径上的需求带宽增加,该协议将启动升级进程,各带宽瓶颈节点根据该协议的动态前向算法求解释放时隙集合,通过释放这部分当前处于传输状态的时隙增加路径上的预留带宽:而...     

Context sensitive trust based geographic opportunistic routing in mobile ad hoc networks

Sādhanā - Position based opportunistic routing (POR) is a stateless, robust, and reliable geographic routing protocol in Mobile AdHoc NETwork (MANET). The opportunistic routing embraces...     

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

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

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

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

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

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

GPS-free mobility metrics for mobile ad hoc networks

Efficient mobility metrics are necessary for mobile ad hoc networks to measure the impact of node mobility on performance. Normally, measuring mobility requires the use of complex localisation systems. A new mobility metric for performance measurements, the intra-vicinity dependency, is proposed. Its main novelty is that it can fully capture the relative motions between a node and its vicinity in a 2D plane, in real-time, using simple triangulation. Variants of this metric are proposed for predicting the performance of networks that follow group and random mobility models (e.g. inter-group inter-meeting times and packet delivery rate). To make the proposed mobility metrics more robust in noisy environments, a calibration method is also proposed for improving accuracy. Experimental results show that, without the help of any localisation systems, the proposed metrics enable a more accurate approximation of the average relative speed between mobile nodes/groups than existing methods. It is also shown that the proposed metrics yield excellent performance when they are used to predict the inter-group inter-meeting times for networks that follow the Rereence point group mobility model and to estimate the packet delivery rate for those that follow the Random Way Point model.