一种具有能量感知的多路径Ad hoc路由算法

该文针对无线移动Ad hoc网络的动态变化拓扑逻辑,存在单向链路,节点能量有限等特点,提出了一种具有能量感知的多路径路由算法。该算法是一种反应式的基于路径池的多路径路由算法,数据和应答消息的路由根据路由池中路径的性能尺度,即跳数、可靠性和剩余能量以一定的概率分布随机选择。路径的可靠性和剩余能量在数据传输过程中动态更新。仿真结果表明该算法能有效地延长网络的生存时间。     

Ad hoc网络中基于数据流的QoS路由协议

已有ad hoc网络中的QoS路由都是基于目的地址的选路并预留资源,当源节点针对同一个目的节点先后建立两个或者多个实时业务流的时候,将导致几个数据流争用资源,使得几个流的QoS都无法得到保证。针对这个问题,文章提出了基于流的QoS路由机制,并且进行了仿真分析,仿真结果表明这种机制能够解决这个问题,使QoS得到保证。     

蚁群优化和能量有效的Ad Hoc路由协议

为了延长Ad Hoc网络的生存周期,提出了一种基于蚁群优化和能量有效的Ad Hoc网络多路径动态路由算法ACOERA。该算法根据路径的有效能量率进行路由选择,路径建立后通过蚁群优化算法动态收集路径信息,并对路由表进行更新。仿真结果表明,该算法能有效延长网络生存时间,增强通信网络的自适应能力。     

移动Ad Hoc网络关键技术研究

文章介绍了移动ad hoc网络的概念、各种应用以及关键技术,着重对无线TCP进行了研究对TCP Reno中选择确认(SACK)的缺点提出一种新的ASACK方法,使吞吐量得以提高,在节点高速移动时效果尤为明显对TCP Vegas作了改进,提出一种采用RTT通知的TCP Vegas方案,结果使节点高速移动时系统吞吐量明显提高.     

基于能量感知的Ad hoc网络路由协议的研究

Adhoc网络是指由一组带有无线通信收发装置的移动节点组成的一个多跳、自组织、无中心网络。作为一个不需要固定基础设施特殊的无线网络,它在民用、军事与测量通信领域占据一席之地,成为当前网络研究的热点。本论文的主要研究目标是利用国内外现有的相关研究成果,对Adhoc自组网常用的AODV路由协议进行节能的研究,使其达到能耗低,长时间工作的目标,以应用在测试与监控中。最后通过仿真比较得以证明其改进的有效性。     

基于Ad hoc网络的QoS路由问题研究

由于Adhoc网络的特殊性,传统的路由协议不能直接应用到Adhoc网络中。因此有必要对Adhoc网络QoS路由协议发展现状进行探究。本文介绍了Adhoc网络QoS路由的概况和它存在的主要问题,以及应对的策略,这有助于进一步改进和完善Adhoc网络的QoS路由技术。     

移动Ad Hoc网络中AODV路由协议的改进

移动Ad Hoc网络研究中,路由协议是一个关键问题。鉴于Ad Hoc网络的高移动性,通信路径的稳定性显得尤为重要。本文在基于AODV（Ad Hoc On-Demand Distance Vector）按需距离矢量路由的思想上,提出一种新的双径路由改进方案。旨在提高协议的健壮性,增强网络对拓扑变化的适应能力。性能分析和仿真结果表明,改进后的AODV路由协议,降低了端到端时延,减少了数据包的丢失,提高了网络的吞吐量,使得网络的性能得到了提升。     

Ad hoc网络中基于能量的AODV双径路由算法研究

在Ad hoc网络中AODV路由的健壮性、路由开销、网络的生存时间以及分组报文传送率等都是评价该算法优良的指标。为了提高该路由算法的各项指标本文提出了改进的路由算法协议,在Ad hoc网络中避免使用的低于能量阈值的节点作为路由节点以提高整体网络的生存时间,提供主次路径使报文的到达率、网络的健壮性得以提高,同时也减少了链路的修复,减少了路由开销。     

基于预测的Ad Hoc路由协议研究

Ad Hoe网中节点的任意运动,导致了大量的重路由操作,从而降低了网络性能。而基于预测的路由协议能够有效地减少网络拓扑结构的变化对于路由操作的影响。文章主要讨论了Ad Hoc网的特点以及目前已经提出的几种节点运动预测方案,同时对基于预测的路由协议进行研究。     

AODV路由协议的改进算法

无线Ad hoc网络拓扑结构动态变化的特点,决定了路径断裂是不可避免的。路径断裂会引起源节点路由重建,源节点频繁地发起路由重建过程会降低网络的性能。AODV协议中采用本地修复机制来减少源节点路由重建的次数。基于这一思想,文章提出了一种AODV路由协议改进算法SRP,旨在进一步提高本地修复的成功率。仿真结果表明,在拓扑结构变化迅速的Ad hoc网络中,SRP协议比AODV路由协议有更好的网络性能。     

Performance of Multipath Routing for On-Demand Protocols in Mobile Ad Hoc Networks

Mobile ad hoc networks are characterized by multi-hop wireless links, absence of any cellular infrastructure, and frequent host mobility. Design of efficient routing protocols in such networks is a challenging issue. A class of routing protocols called on-demand protocols has recently found attention because of their low routing overhead. The on-demand protocols depend on query floods to discover routes whenever a new route is needed. Such floods take up a substantial portion of network bandwidth. We focus on a particular on-demand protocol, called Dynamic Source Routing, and show how intelligent use of multipath techniques can reduce the frequency of query floods. We develop an analytic modeling framework to determine the relative frequency of query floods for various techniques. Our modeling effort shows that while multipath routing is significantly better than single path routing, the performance advantage is small beyond a few paths and for long path lengths. It also shows that providing all intermediate nodes in the primary (shortest) route with alternative paths has a significantly better performance than providing only the source with alternate paths. We perform some simulation experiments which validate these findings.     

Ariadne: A Secure On-Demand Routing Protocol for Ad Hoc Networks

An ad hoc network is a group of wireless mobile computers (or nodes), in which individual nodes cooperate by forwarding packets for each other to allow nodes to communicate beyond direct wireless transmission range. Prior research in ad hoc networking has generally studied the routing problem in a non-adversarial setting, assuming a trusted environment. In this paper, we present attacks against routing in ad hoc networks, and we present the design and performance evaluation of a new secure on-demand ad hoc network routing protocol, called Ariadne. Ariadne prevents attackers or compromised nodes from tampering with uncompromised routes consisting of uncompromised nodes, and also prevents many types of Denial-of-Service attacks. In addition, Ariadne is efficient, using only highly efficient symmetric cryptographic primitives.     

An Energy Consumption Model for Performance Analysis of Routing Protocols for Mobile Ad Hoc Networks

A mobile ad hoc network (or manet) is a group of mobile, wireless nodes which cooperatively form a network independent of any fixed infrastructure or centralized administration. In particular, a manet has no base stations: a node communicates directly with nodes within wireless range and indirectly with all other nodes using a dynamically-computed, multi-hop route via the other nodes of the manet.Simulation and experimental results are combined to show that energy and bandwidth are substantively different metrics and that resource utilization in manet routing protocols is not fully addressed by bandwidth-centric analysis. This report presents a model for evaluating the energy consumption behavior of a mobile ad hoc network. The model was used to examine the energy consumption of two well-known manet routing protocols. Energy-aware performance analysis is shown to provide new insights into costly protocol behaviors and suggests opportunities for improvement at the protocol and link layers.     

Replication of Routing Tables for Mobility Management in Ad Hoc Networks

Ad Hoc networking is a rather old technology that is gaining new momentum in the research community. It is still an area under development and there are several proposals for the technology regarding routing protocols, addressing, interoperability, etc. Because of the extreme conditions where Ad Hoc networks should operate, it is envisioned that in medium to large scale networks, a hybrid proactive and reactive routing mechanism should be used. Therefore, considering the proactive routing protocols as the most suitable protocol for certain topologies in Ad Hoc networks, this paper proposes a specific layered structure to enable both technologies in a seamless manner. This approach supports both reactive (e.g., AODV, DSR) and proactive link state (e.g., OLSP) protocols. The proposed layered structure divides the routing problem into different parts, where one module performs the routing algorithm, another module takes care of replicating and synchronizing the routing tables, and a third one evaluates the routing information for triggering hand-over signals to the upper layers. The overall responsibility for selecting the appropriate routing schema and for initiating the roaming process resides on a proposed Context Sensitive Roaming Layer. This paper describes the interface and the functions implemented by the Roaming Layer. The paper also analyses replication using the Server Cache Synchronization Protocol (SCSP). Finally, the last part of the paper describes the demand for Ad Hoc networks, which is driven by applications supported with an appropriate billing or bonus mechanism.     

自组网环境下利用单向链路的能源节省路由研究

针对自组网中节点电源的容量限制，本文提出了一种利用单向链路的能源节省路由算法。该算法充分利用网络中存在的单向链路，通过让能源较多的节点承担较多的传输任务的方式为数据流选择最佳路由，以延长网络的生存时间。仿真结果证明了该算法的有效性，以及单向链路对于能源节省具有较高的价值。     

移动Ad hoc网络中AODV路由协议的研究与改进

针对移动Ad hoc网络AODV路由协议存在的一些缺点,提出了一个改进的路由协议。在改进方案中增加了备份路由和电池电量门阀值,可以有效避免路由的重新发现。性能分析与仿真结果表明,改进后的AODV路由协议更能适应网络拓扑结构的变化,并能在链路中断后迅速找到可用的路由。     

无线移动自组网络的动态源路由策略

文章介绍无线移动自组网中动态源路由策略的路由发现和路由维护,并提出改进思路和今后研究的方向。     

自组网内的延迟限制QoS路由算法研究

介绍了自组网内的延迟限制 ＱｏＳ（Ｑｕａｌｉｔｙ－ｏｆ－Ｓｅｒｖｉｃｅ）路由算法，并对它进行了仿真。该算法可在网络状态信息不精确的情况下，同时并行寻找多条路径，以优化路径选择。当节点移动、离开、加入时，引入容错机制，以便于路径保持。通过仿真可以看出，该算法在适度的寻路代价下，可以得到较高的呼叫接收率。