ad hoc网络AODV协议在Windows CE上的实现

为给无线网络的应用提供研究平台,用Windows CE模拟器平台和IEEE 802.11b无线网络接口搭建真实的移动网络环境,通过调用API和增加功能模块的方式实现ad hoc路由协议,使用模拟器编写相关应用程序,实现AODV(Ad hoc on-demand Distance Vector)路由算法模块. 对该模块进行初步的验证和测试,结果表明:所设计的路由协议不仅在1跳范围内具有良好的通信性能,而且具备多跳通信能力;可以按需建立路由并实时启动路由维护过程. 该路由协议的实现为编写其他ad hoc网络路由协议提供1种实用框架.     

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

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

移动ad hoc网络中DOS攻击及其防御机制

移动ad hoc网络由于其动态拓扑、无线信道以及各种资源有限的特点,特别容易遭受拒绝服务(DOS)攻击．提出了移动ad hoc网络中一种新的DOS攻击模型——ad hoc flooding攻击及其防御策略．该攻击主要针对移动ad hoc网络中的按需路由协议,如AODV,DSR等．ad hoc flooding攻击是通过在网络中泛洪发送超量路由查询报文及数据报文,大量地占用网络通信及节点资源,以至于阻塞节点正常的通信．分析ad hoc flooding攻击之后,提出了两种防御策略：其一是邻居阻止,即当入侵者发送大量路由查询报文时,邻居节点降低对其报文的处理优先级,直至不再接收其报文．其二是路径删除,即目标节点将入侵者发送攻击报文的路径删除,以阻止其继续发送攻击报文．模拟实验证实,通过这两种方法的结合．能够有效地阻止网络中的ad hoc flooding攻击行为．     

LPDSR:基于Chord算法的MANET分级路由模型

为提高移动自组织网络(mobile ad hoc network,MANET)路由协议效率并增强其网络可扩展性,通过对P2P(peep-to-peer)网络与MANET的交叉研究,在DSR协议基础上引入Chord算法,提出基于网络物理拓扑的分级路由模型LPDSR.采用按需建环机制和分级路由算法,降低查询复杂度,减少绕路问题.LPDSR算法性能分析和NS-2仿真结果表明,该路由模型的网络可扩展性明显提高.     

基于AODV路由协议的研究与改进

文章简单介绍了计算机网络中移动Ad hoc网络的概念及特点,然后简单介绍了一下移动Ad Hoc网络中的按需驱动路由协议.紧接着,对Ad Hoc网络的一种按需路由协议——AODV路由协议进行了深入分析.最后,提出一种两跳拓扑结构的概念,采用AODV路由协议作为网络层协议,对传统的AODV路由协议进行了一点改进.     

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

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

可证明安全的节点不相交多路径源路由协议

多路径路由实现是移动ad hoc网络可靠运行的有效保证.针对多路径路由协议的安全性分析,建立了基于UC(universally composable)框架的可证明安全路由协议的新方法.基于攻陷的网络拓扑模型,扩展了可模糊路由概念,提出了多路径可模糊路由集合概念,用于描述攻陷网络拓扑结构的移动ad hoc网络多路径路由;基于UC安全模型,提出了基于UC-RP(universally composable security framework for ad hoc networks routing protocol)框架的路由协议形式化安全定义;针对MNDP(multiple node-disjoint paths)协议存在的安全问题,提出了新的移动ad hoc网络节点不相交多路径动态源路由协议(简记为SMNDP(security multiple node-disjoint paths)协议).将基于UC-RP框架的可证明安全路由协议的新方法应用于SMNDP协议的安全分析.SMNDP协议的可证明安全性可以归约为消息认证码和签名机制的安全性.SMNDP协议实现了路由发现协议的正确性、节点身份的认证性和路由消息的完整性.     

可证明安全的节点不相交多路径源路由协议

多路径路由实现是移动ad hoc网络可靠运行的有效保证.针对多路径路由协议的安全性分析,建立了基于UC(universally composable)框架的可证明安全路由协议的新方法.基于攻陷的网络拓扑模型,扩展了可模糊路由概念,提出了多路径可模糊路由集合概念,用于描述攻陷网络拓扑结构的移动ad hoc网络多路径路由;基于UC安全模型,提出了基于UC-RP(universally composable security framework for ad hoc networks routing protocol)框架的路由协议形式化安全定义;针对MNDP(multiple node-disjoint paths)协议存在的安全问题,提出了新的移动ad hoc网络节点不相交多路径动态源路由协议(简记为SMNDP(security multiple node-disjoint paths)协议).将基于UC-RP框架的可证明安全路由协议的新方法应用于SMNDP协议的安全分析.SMNDP协议的可证明安全性可以归约为消息认证码和签名机制的安全性.SMNDP协议实现了路由发现协议的正确性、节点身份的认证性和路由消息的完整性.     

移动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协议容易导致路由信息失效,对路由协议产生负面影响.     

一种ad hoc多路径安全路由算法

移动ad hoc网络无中心、拓扑结构动态变化等特点,以及节点能源和计算能力有限,使其安全路由设计面临巨大挑战.在按需路由的基础上提出了一种多路径安全路由算法,采用高效的分布式密钥管理策略,路由过程中隐藏通信节点的地址信息,节点之间逐跳认证保证信息的完整性,能够抵御单路径协议不能抵抗的多恶意节点的合谋攻击,同时能平衡负载,具有更好的安全性能和网络性能.     

可扩展的MAODV协议

随着近年来人们对移动Ad hoc网络和多播兴趣的日益增加,出现了许多适用于MANET上的多播路由协议.该文综述了这些移动Ad hoc网络上的多播协议,介绍了MAODV协议,提出了一种新的多播路由可扩展性解决方案.模拟结果显示,采用提出的技术增强了多播路由协议的性能和可扩展性.     

A survey of secure wireless ad hoc routing

Ad hoc networks use mobile nodes to enable communication outside wireless transmission range. Attacks on ad hoc network routing protocols disrupt network performance and reliability. The article reviews attacks on ad hoc networks and discusses current approaches for establishing cryptographic keys in ad hoc networks. We describe the state of research in secure ad hoc routing protocols and its research challenges.     

移动自组织网络路由选择算法研究进展

移动Ad Hoc无需基础设施,可支持高动态的移动数据通信,具有广泛应用的前景。然而,其高动态特性导致互联网现有路由协议不再适用。近年来学者针对Ad Hoc网络提出了大量的路由选择算法。给出了各种路由技术分类方法,简述了Ad Hoc网络的基本路由协议和路由选择算法,进而从预测模型、能量模型、位置信息、服务质量控制和安全支持等5个角度,深入分析了当前Ad Hoc网络路由选择算法的最新研究进展。预测模型通过基于历史信息的移动预测,降低了路由选择的时间代价;能耗模型则采用适当的数学模型来描述网络能耗情况,在选路过程中实现了分组传送的能耗最小化和能量负担均衡之间的权衡;基于位置的路由选择算法根据节点的地理位置来标识目的地,从而利用该地理位置信息进行路由选择;服务质量感知的路由选择算法在本地计算中考虑带宽、延迟、能量和电池生命周期,从而在选路过程中提供了服务质量支持;安全路由选择算法则利用适合移动Ad Hoc网络的密钥、哈希链、电子签名等技术对协议交互消息进行加密来保障网络安全。最后从通信开销、计算和存储开销、路径数量、关键节点的存在性以及算法类型等方面详细对比总结了近年来提出的30余种典型路由选择算法,指出了各自的特点...     

无线Ad hoc网络路由协议的分析比较

无线adhoc的路由算法是adhoc领域的研究难点。论文分析了四种路由协议DSDV、CGSR、AODV、DSR的机制,并进行了网络模拟试验,在网络时延、吞吐量、路由开销、平均跳数等方面进行了对比。试验结果表明按需路由在无线adhoc网络环境下具有更好的性能。     

Adaptive Threat Modeling for Secure Ad Hoc Routing Protocols

Secure routing protocols for mobile ad hoc networks provide the required functionality for proper network operation. If the underlying routing protocol cannot be trusted to follow the protocol operations, additional trust layers, such as authentication, cannot be obtained. Threat models drive analysis capabilities, affecting how we evaluate trust. Current attacker threat models limit the results obtained during protocol security analysis over ad hoc routing protocols. Developing a proper threat model to evaluate security properties in mobile ad hoc routing protocols presents a significant challenge. If the attacker strength is too weak, we miss vital security flaws. If the attacker strength is too strong, we cannot identify the minimum required attacker capabilities needed to break the routing protocol. In this paper we present an adaptive threat model to evaluate route discovery attacks against ad hoc routing protocols. Our approach enables us to evaluate trust in the ad hoc routing process and allows us to identify minimum requirements an attacker needs to break a given routing protocol.     

Service discovery in mobile ad hoc networks: A field theoretic approach

Service discovery in mobile ad hoc networks is challenging because of the absence of any central intelligence in the network. Traditional solutions as used in the Internet are hence not well suited for mobile ad hoc networks. In this paper, we present a novel decentralized service discovery mechanism for ad hoc networks. The basic idea is to distribute information about available services to the network neighborhood. We achieve this by using the analogy of an electrostatic field: A service is modelled by a (positive) point charge, and service request packets are seen as (negative) test charges which are attracted by the service instances. In our approach, we map the physical model to a mobile ad hoc network in a way where each network element calculates a potential value and routes service requests towards the neighbor with the highest potential, hence towards a service instance. Our approach allows for differentiation of service instances based on their capacity. We define the required protocols and methods which we implemented in a network simulator. Using extensive simulations, we evaluate the performance and robustness of the mechanisms. The results indicate good performance and convergence even in highly mobile environments. We believe that this technique can and should be further exploited, e.g., as a routing protocol in mobile ad hoc networks.     

The performance impact of traffic patterns on routing protocols in mobile ad hoc networks

As mobile ad hoc network (MANET) systems research has matured and several testbeds have been built to study MANETs, research has focused on developing new MANET applications such as collaborative games, collaborative computing, messaging systems, distributed security schemes, MANET middleware, peer-to-peer file sharing systems, voting systems, resource management and discovery, vehicular computing and collaborative education systems. The growing set of diverse applications developed for MANETs pose far more complex traffic patterns than the simple one-to-one traffic pattern, and hence the one-to-one traffic pattern widely used in previous protocol studies has become inadequate in reflecting the relative performance of these protocols when deployed to support these emerging applications.As a first step towards effectively supporting newly developed and future diverse MANET applications, this paper studies the performance impact of diverse traffic patterns on routing protocols in MANETs. Specifically, we propose a new communication model that extends the previous communication model to include a more general traffic pattern that varies the number of connections per source node. We study the performance impact of traffic patterns on various routing protocols via detailed simulations of an ad hoc network of 112 mobile nodes. Our simulation results show that many of the conclusions drawn in previous protocol comparison studies no longer hold under the new traffic patterns. These results motivate the need for performance evaluation of ad hoc networks to not only include rich and diverse mobility models as has been done in the past but also include diverse traffic patterns that stress a wide set of protocol design issues.     

移动自组网中一种面向群组移动性的位置服务协议

基于位置信息的路由协议被广泛认为是一种可扩展的移动自组网路由解决方案.大多数此类协议假定可通过位置服务协议获取结点的位置信息.研究人员现已提出多种位置服务协议.但是,它们在大规模网络环境中的可扩展性不好,或者在高动态网络环境中可靠性不高.本文提出了一种适用于大规模移动自组网的面向群组移动性的可扩展及可靠的位置服务协议.模拟结果表明此协议比SLURP协议更适合于具有群组移动性的大规模移动自组网.     

移动Ad Hoc网组播路由协议研究进展

移动Ad Hoc网和组播都是既有美好前景又有实现难度的技术，在移动Ad Hoc网中进行组播更是一项带挑战性的工作。目前该领域的研究热点之一是路由协议。本文介绍了移动Ad Hoc网组播路由的主要难点及研究现状，分类描述和比较了已有的主要协议，并对泛洪协议以及单播与组播路由协议的关系进行了阐述，最后展望了未来的研究工作。