基于闲时逆寻和路由学习机制的优化AODV路由协议

对AODV协议在不同MANET网络环境中的性能缺陷进行了研究,提出了节点闲时反向路由搜索机制和邻居节点路由监听学习机制,并进一步提出了优化的AODV路由协议O-AODV。利用O-AODV协议在MANET网络中产生多个局部路由,从而增加网络中的路由冗余度,提高路由发现的效率,加快故障路由的本地修复。仿真实验结果表明,O-AODV协议提高了分组投递率,降低了端到端延时,有效地减少了网络中的重路由开销,在大规模和拓扑变化快的网络环境中优于AODV协议。     

基于定位的移动Adhoc网络路由技术

路由协议是移动Ad hoc网络(MANET)研究的一个热点.传统的MANET的路由协议都是基于图形学建模的,只能获知各个节点之间的连通关系,而不能获知节点之间地理位置的关系.本文将要介绍基于定位的MANET路由协议,这些协议利用定位信息,从各方面改善MANET路由协议的性能.     

一种增加时限和延迟的AODV协议改进方法

AODV协议是目前比较成熟的应用于移动自组网(MANET)中的一种反应式路由协议,其缺点主要是协议开销比较大,运动情况下路由优化性能不理想。利用为RREQ消息设置时限和为中间节点根据自身队长设置回复RREP消息延迟的方法,提出了一种改进的AODV协议(AODV-DL),有效地提高了网络的投包率和路由优化性能,降低了网络的协议开销。提出了将路由优化性能作为协议的一项新的评价标准。描述了其实现策略,并给出了NS2下的仿真结果。     

一种MANET环境下的能量感知路由研究

移动自组织网络(MANET)的节点通常能量有限,为了均衡网络中节点的能量消耗并延长网络的生存时间,有必要针对MANET网络进行相关的能量感知均衡设计。文章在网络层对MANET进行能量感知研究,通过对AODV路由协议进行改进,提出具有能量有效的AODV路由发现机制,最终设计改进的AODV路由协议——EQ-AODV。仿真结果表明,本研究设计的路由协议在平衡能量消耗和延长网络生存时间方面较原始AODV协议有较大提升。     

用于降低网络开销的改进ODMRP算法研究

ODMRP组播路由协议适用于带宽窄、移动性强和节点分散的移动自组织网络(Mobile AdHoc Network,MANET)。为了进一步提高该协议的性能,设计了一种改进方案,首次提出"备用转发节点"的概念,将其应用于原协议中,以降低网络的负载。理论分析表明,改进方案通过控制备用转发节点能动态的控制路由数量,进而控制转发分组节点数据,从而降低网络负载。所以,该改进方案有效地提高了ODMRP协议的性能,使之更加适用于大规模的MANET网络。     

移动Ad hoc网络可靠多路径路由协议的综述

分析研究了移动Adhoc网络（MANET）的可靠多路径路由协议,可靠多路径路由协议的主要目标是提供可靠的通信、以确保负载平衡以及提高服务质量（QoS）。本文分析了Adhoc网络多路径路由技术的研究进展,论述了典型的Adhoc网络多路径路由协议性能,最后对Adhoc网络多路径路由的发展趋势进行了展望。     

一种新的自组网区域路由多径算法

能量消耗是移动自组网（MANET）路由协议研究中的一介热点所在。区域路由协议作为混合式寻路机制,为移动自组网提供了一种灵活的路由选择方式。在其路由发现的过程中,存在着多径问题,合理地利用这些路径进行路由转发,可以降低节点间功耗的偏差,使得整介网络能量消耗比较均匀。仿真表明,区域内路由部分中,该算法可较大地延长网络生存周期,而区域间路由部分所受影响则较小。     

基于地理位置的MANET定向路由机制研究

基于地理位置的MANET定向路由算法的基本思想是利用节点的地理位置信息和定向天线来进行数据转发。由于不需要维护明确的路由,它的网络扩展性和动态适应性好,抗干扰能力强。介绍了地理位置路由的特点和分类,总结了设计基于地理位置的移动自组网定向路由协议时须考虑的问题,并对其位置服务机制和数据转发策略进行了定性分析与比较。     

一种新型安全路由协议——势能导向多下一跳路由协议

路由协议是网络的核心控制协议,通过路由协议增强网络可用性和安全性显得尤为重要。在研究网络路由协议及其安全机制的基础上,充分考虑网络路由过程的动态可用性和节点可信度,在路由机制中首次定义了寻路和可信势能,并设计实现了基于节点势能导向的多下一跳路由协议,很好地解决了目前互联网中突发事件易引起网络拥塞和不安全节点对用户信息安全的隐患,对加强网络抗毁性、保障用户信息安全具有重要价值。     

移动代理在MANET路由协议中的应用研究

移动Ad Hoc网络(MANET)是由移动节点组成的分布式异构网络,其路由协议的研究是该领域的焦点之一。本文分析了现有移动Ad Hoc网络两类路由协议的优缺点,接着提出将移动代理应用于AODV路山协议的方案,最后给出了初步的仿真结果。仿真结果表明,通过移动代理的漫游更新途经节点路由表,可以在网络负载增加不人的情况下,减少路由发起数,降低端到端的数据传输延迟。     

A survey of routing attacks in mobile ad hoc networks

Recently, mobile ad hoc networks became a hot research topic among researchers due to their flexibility and independence of network infrastructures, such as base stations. Due to unique characteristics, such as dynamic network topology, limited bandwidth, and limited battery power, routing in a MANET is a particularly challenging task compared to a conventional network. Early work in MANET research has mainly focused on developing an efficient routing mechanism in such a highly dynamic and resource-constrained network. At present, several efficient routing protocols have been proposed for MANET. Most of these protocols assume a trusted and cooperative environment. However, in the presence of malicious nodes, the networks are vulnerable to various kinds of attacks. In MANET, routing attacks are particularly serious. In this article, we investigate the state-of-the-art of security issues in MANET. In particular, we examine routing attacks, such as link spoofing and colluding misrelay attacks, as well as countermeasures against such attacks in existing MANET protocols.     

基于稳定闭域的异构无线网络混合路由策略

分析了异构的网络模型,并提出了一种基于MANET稳定闭域的混合路由策略,使得基于该路由策略设计的路由协议能够实时地根据本地拓扑状态进行转换,在稳定闭域内使用AODV提高路由转发的效率。当数据分组转发到闭域边界后,将转换为改进的Prophet路由继续在非连通区域内寻路,以充分利用MANET与DTN路由的优势。仿真实验证明了该路由策略的可行性,通过比较多种路由算法验证了在特定的异构网络环境下该路由策略的高效性。     

A location-based routing method for mobile ad hoc networks

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks. However, location-based routing is difficult when there are holes in the network topology and nodes are mobile or frequently disconnected to save battery. Terminode routing, presented here, addresses these issues. It uses a combination of location-based routing (terminode remote routing, TRR), used when the destination is far, and link state-routing (terminode local routing, TLR), used when the destination is close. TRR uses anchored paths, a list of geographic points (not nodes) used as loose source routing information. Anchored paths are discovered and managed by sources, using one of two low overhead protocols: friend assisted path discovery and geographical map-based path discovery. Our simulation results show that terminode routing performs well in networks of various sizes. In smaller networks; the performance is comparable to MANET routing protocols. In larger networks that are not uniformly populated with nodes, terminode routing outperforms, existing location-based or MANET routing protocols.     

LEO/MEO卫星网络中运用自组网思想的动态路由算法

分析了基于星际链路的LEO/MEO路由算法的特点及卫星网与自组网的相同之处，借鉴了自组网路由协议中适用于卫星网的部分，提出了LEO/MEO卫星网络中运用自组网思想的动态路由算法，并对算法进行了模型仿真和性能分析，这种算法增强了卫星网络的自适应性，使网络具有自治性强，功能更全面、系统开销小、适用范围广等特点。     

MANET Routing with Provably Low Complexity Through Constant Density Clustering and Route Request Broadcast

As mobile ad hoc networks (MANETs) are emerging as important components in critical and large-scale applications, it is crucial to develop MANET routing mechanisms with provably low complexity. In this paper, we give a tutorial overview of the efficient use of elementary node clustering and route request broadcast mechanisms for low-complexity MANET routing. We explain these mechanisms with illustrative examples and discuss their theoretical performance characteristics. We demonstrate that node clustering with constant density and route request broadcasting with a doubling radius technique over the network of cluster leaders can be employed for MANET routing with theoretically proven low complexity. Moreover, we contrast these efficient elementary clustering and route request broadcast mechanisms with clustering and route information accumulation mechanisms in the widely studied AODV and DSR routing protocols and discuss the implications of these various mechanisms for scalable MANET routing.     

Mobile IPv6-based ad hoc networks: its development and application

The Internet protocol version 6 (IPv6)-enabled network architecture has recently attracted much attention. In this paper, we address the issue of connecting mobile ad hoc networks (MANETs) to global IPv6 networks, while supporting IPv6 mobility. Specifically, we propose a self-organizing, self-addressing, self-routing IPv6-enabled MANET infrastructure, referred to as IPv6-based MANET. The proposed self-organization addressing protocol automatically organizes nodes into tree architecture and configures their global IPv6 addresses. Novel unicast and multicast routing protocols, based on longest prefix matching and soft state routing cache, are specially designed for the IPv6-based MANET. Mobile IPv6 is also supported such that a mobile node can move from one MANET to another. Moreover, a peer-to-peer (P2P) information sharing system is also designed over the proposed IPv6-based MANET. We have implemented a prototyping system to demonstrate the feasibility and efficiency of the IPv6-based MANET and the P2P information sharing system. Simulations are also conducted to show the efficiency of the proposed routing protocols.     

移动自组织网与有线网融合技术研究与展望

随着移动自组织网络(MANET)组网技术的不断成熟,MANET路由协议与传统Internet路由协议的融合已经成为网络互联的重要内容,成为影响组网效率的决定性因素.本文分别对移动自组织网络作为末端网和承载网的互联技术进行了研究,并在此基础上提出了基于无线栅格网络(wireless mesh networl,WMN)结构的未来移动互联技术的演进方案,对WMN的路由协议进行了有意义的探讨.     

利用ad hoc网络实现下一代移动互联

随着ad hoc网络的研究工作的发展,以Internet接入为代表的ad hoc网络的应用问题越来越被人们所关注.在本文中,我们提出了一个将ad hoc网络和移动IPv6相结合的方案,首先将基于动态源路由(dynamic source routing,DSR)的MANET升级到IPv6使其能够接入6Bone网,并通过搭建测试床进行了验证和测量;在此基础上,又提出了移动IPv6的兼容方案,并通过仿真对其在不同环境下的性能进行了验证.     

Fault-tolerant routing in adversarial mobile ad hoc networks: an efficient route estimation scheme for non-stationary environments

Designing routing schemes that would successfully operate in the presence of adversarial environments in Mobile Ad Hoc Networks (MANETs) is a challenging issue. In this paper, we discuss fault-tolerant routing schemes operating in a network with malfunctioning nodes. Most existing MANET protocols were postulated considering scenarios where all the mobile nodes in the ad hoc network function properly, and in an idealistic manner. However, adversarial environments are common in MANET environments, and misbehaving nodes certainly degrade the performance of these routing protocols. The need for fault tolerant routing protocols was identified to address routing in adversarial environments in the presence of faulty nodes by exploring redundancy-based strategies in networks. It turns out that since the nodes are mobile, the random variables encountered are non-stationary, implying that estimation methods for stationary variables are inadequate. Consequently, in this paper, we present a new fault-tolerant routing scheme that invokes a stochastic learning-based weak estimation procedure to enhance a route estimation phase, which, in turn, is then incorporated in a route selection phase. We are not aware of any reported method that utilizes non-traditional estimates to achieve the ranking of the possible paths. The scheme, which has been rigorously tested by simulation, has been shown to be superior to the existing algorithms.     

Load-balancing in MANET shortest-path routing protocols

Mobile ad hoc networks (MANET) are infrastructure-less networks, dynamically formed by an independent system of mobile nodes that are connected via wireless links. Because routing is performed by nodes with limited resources, load should be efficiently distributed through the network. Otherwise, heavily-loaded nodes may make up a bottleneck that lowers the network performances by congestion and larger delays. Regrettably, load-balancing is a critical deficiency in MANET shortest-path routing protocols, as nodes at the center of the network are much heavily-loaded than the others. Thus, we propose, in this paper, load-balancing mechanisms that push the traffic further from the center of the network. Basically, we provide novel routing metrics that take into account nodes degree of centrality, for both proactive and reactive routing protocols. Simulations show that the proposed mechanisms improve the load distribution and significantly enhance the network performances in terms of average delay and reliability.