基于全互连立方体的Ad Hoc网络自适应路由算法

路由算法是影响移动自组织网络（Mobile Ad Hoc Network）性能的关键问题,现有的自主式组网方式及路由存在扩展性差或节点负载不均衡问题。本文提出一种基于全互连立方体（FCCN,Fully Connected Cubic Network）虚拟拓扑的层次结构及自适应路由算法,能自适应于无线链路不稳定和网络拥塞的状况,提供良好的网络扩展和负载均衡,并与现有分层结构路由算法进行了比较,最后通过仿真验证了其具有良好的吞吐率和负载均衡能力。     

Ad Hoc网络路由协议综述

文章分析了Ad Hoc网络的特征以及路由设计协议所面临的问题与挑战,综述了Ad Hoc网络的传统路由协议,针对理想自组网路由协议应满足的7个方面,着重对适用于不同业务需求和网络需求的路由协议进行了介绍,为Ad Hoc网络路由协议的进一步研究提供了参考。     

Ad Hoc 网络按需路由协议性能分析

无线移动Ad Hoc网络作为可移动分布式多跳无线网络，没有预先确定的网络拓扑或网络基础设施以及集中控制。为了在这样的网络中促进通信，路由协议主要用于在节点之间发现路径。Ad Hoc网络路由协议的主要目的是网络拓扑的动态变化任意两个节点之间建立一个使得通信总费用和带宽消费最少的正确和有效的通信路径。使用OPNET仿真软件对AODV、DSR协议这两种典型无线移动Ad Hoc网络按需路由协议的参数和性能进行了详细比较和分析。     

移动Ad Hoc网络路由协议的研究

Ad Hoc网络是无线局域网领域的研究重点,因其可以在任何时候、任何地点快速构建的特点得到了广泛的应用。本文首先介绍了Ad Hoc网络的概念、主要特点和网络结构,然后,文章介绍了Ad Hoc网络的路由协议,并详细列出了几种分层协议的内容。     

移动Ad Hoc网络中路由协议可扩展性分析

Ad Hoc网络具有拓扑结构动态变化的特性，使得网络的路由协议可扩展性成为关键的因素，本文按照平面型和层次型两种方式对路由协议进行分类，并对两种类型路由协议的可扩展性进行了定性分析。     

Ad Hoc网络中QoS技术研究

服务质量保障是Ad Hoc网络环境中的一个复杂的急需解决的问题。首先论述了Ad Hoc网络的网络协议模型、QoS服务模型、QoS路由以及QoS保障策略等方面的问题,然后对其进行了综合分析,在此基础上,给出了Ad Hoc网络中不同层次的QoS路由方案以及其未来的研究方向。     

基于Ad Hoc网络路由协议的控制开销研究

对Ad Hoc网络路由协议的控制开销进行了系统而深入的研究。在分析了路由开销机制的基础上．对几种典型的开销优化方法和策略进行了研究和总结，并通过仿真研究了MAC协议对路由开销的影响，以及节点密度、业务流量和移动性等网络环境因素对路由开销的影响。     

Ad Hoc网络中的路由算法

Ad Hoc网络是由移动结点以无线通信方式组成的无中心自组织网络。文章针对Ad Hoc无线移动网络的特点,对目前的Ad Hoc网络中的路由算法进行了研究,特别分析了不同的路由发现和路由维护策略,并对table-driven和on-demand两种类型的算法进行了比较。最后,文章对Ad Hoc路由算法的发展前景作了简短的讨论。     

基于泛搜索路由协议的Ad Hoc网络设计与实现

在Ad Hoc网络技术的工程实现中,路由协议的选择以及硬件无线通信系统设计是要解决的两个关键环节。本文针对节点之间无等级结构的Ad Hoc网络,基于一种泛搜索路由协议进行Ad Hoc网络系统设计和实现。硬件通信设备采用单片机C8051F920控制无线数传模块的方案进行设计,按照搜索路由协议对单片机编写程序,继而组建Ad Hoc网络系统。通过对网络测试所得的数据结果进行分析,表明该路由协议能适应网路拓扑结构变化,准确地找到一条适合传输的路由,所设计通信系统满足Ad Hoc网络的基本特征。     

基于位置的 Ad Hoc 路由协议现状及发展

基于位置的Ad Hoc路由协议因其消除了对拓扑存储的依赖性,降低了相关能耗,提升了网络性能,成为了学者们重点关注的研究领域。介绍了基于位置的Ad Hoc路由协议的概念,分析了几个典型的基础路由协议,总结了现阶段研究面临的问题,归纳了基于地理位置路由协议国内外研究现状及发展趋势。     

Ad Hoc网络路由技术

无线自组织网络(Adhoc)是一个复杂的系统,其中路由协议是该领域中的研究热点。通过采用合理的路由技术,可使无线自组网具有更为灵活的组网方式,从而达到提升网络性能、减少网络开销等目的。通过与认知无线电(CR)技术、协同通信(CC)技术以及多输入多输出(MIMO)天线技术等物理层新技术的有效结合,可以大大改善Adhoc路由协议的性能。     

即时无线移动网络及相关路由协议

即时无线网络需要设置固定的路由设备,网络中的每一个移动终端都可以充当路由器,即时无线网络的路由协议包括路由表驱动型路由协议和源节点发起型路由协议。本文分别以无线路由协议和即时指令型距离向量路由协议对上述两类协议进行了详细讨论。     

A Routing Algorithm for Wireless Ad Hoc Networks with Unidirectional Links

Most of the routing algorithms for ad hoc networks assume that all wireless links are bidirectional. In reality, some links may be unidirectional. In this paper we show that the presence of such links can jeopardize the performance of the existing distance vector routing algorithms. We also present modifications to distance vector based routing algorithms to make them work in ad hoc networks with unidirectional links. For a network of n nodes, neighbors exchange n×n matrices to propagate routing information. This results in loop-free routes.     

基于路径稳定性的Ad Hoc网络按需路由算法设计

鉴于Ad Hoc网络的高移动性,选择一条稳定的路径进行通信尤为重要.文章借鉴AODV按需路由的思想,提出了基于路径稳定性的路由算法PSR(Path Stable based on-demand Routing),通过引入路径有效因子PEF(Path Efficieney Factor)来考虑可行路径的稳定性问题,增强了所选路径的稳定性,减少了由于节点运动引起的链路断裂次数.性能分析和仿真结果表明,与AODV相比,PSR减少了开销,提高了效率,使得算法的性能得到了提升.     

无线自组织网络的联合安全路由选择和功率优化算法

针对无线自组织网络在窃听环境中的安全传输问题,该文提出了一种无线多跳自组织网络的联合安全路由和功率优化算法。首先,在窃听者服从泊松簇过程(PCP)这一假设下推导得到了系统安全中断概率(SOP)和连接中断概率(COP)的表达式;然后以安全中断概率约束下的连接中断概率最小为准则,针对给定路径推导得到了源与各跳中继的最优传输功率,并进一步获得了源与目的节点间的最优路由。仿真结果表明,该文所提系统安全中断概率和连接中断概率的表达式与蒙特卡洛仿真结果相符,所提算法可获得与穷举搜索方法接近的安全性能,显著优于传统方法。

     

无线Ad Hoc网络中的QoS路由协议

无线Ad Hoc网络的应用环境以及与Internet的互连都要求其必须提供一定的服务质量(QoS)保证,QoS路由技术是在无线Ad Hoc网络中实现QoS的重要方法。本文对近年来国内外在无线Ad Hoc网络中的QoS路由技术方面取得的研究成果进行了全面的概括总结和分类,对资源预留路由、多径路由和跨层优化路由3类QoS路由协议进行比较分析,并且提出了QoS路由技术亟待解决的问题和今后的发展方向。     

Routing in Sparse Vehicular Ad Hoc Wireless Networks

A vehicular ad hoc network (VANET) may exhibit a bipolar behavior, i.e., the network can either be fully connected or sparsely connected depending on the time of day or on the market penetration rate of the wireless communication devices. In this paper, we use empirical vehicle traffic data measured on 1-80 freeway in California to develop a comprehensive analytical framework to study the disconnected network phenomenon and its network characteristics. These characteristics shed light on the key routing performance metrics of interest in disconnected VANETs, such as the average time taken to propagate a packet to disconnected nodes (i.e., the re-healing time). Our results show that, depending on the sparsity of vehicles or the market penetration rate of cars using Dedicated Short Range Communication (DSRC) technology, the network re-healing time can vary from a few seconds to several minutes. This suggests that, for vehicular safety applications, a new ad hoc routing protocol will be needed as the conventional ad hoc routing protocols such as Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) will not work with such long re-healing times. In addition, the developed analytical framework and its predictions provide valuable insights into the VANET routing performance in the disconnected network regime.     

无线adhoc网络中的多径源路由

本文针对无线ad hoc网络提出了一种基于DSR(动态源路由)的路由算法,多径源路由(MSR).MSR对DSR中的路由搜索和路由维护机制进行了扩展,用来解决多径路由问题.本文还提出,在多条路径之间基于测量的RTT进行负载分配.仿真结果表明,MSR在只增加少量网络开销的情况下,提高了TCP和UDP的投递率,降低了丢包率,并减少了端到端之间的延迟以及队列长度,从而有效地减少了网络拥塞.     

Regional Gossip Routing for Wireless Ad Hoc Networks

Many routing protocols have been proposed for wireless ad hoc networks, and most of them are based on some variants of flooding. Thus many routing messages are propagated through the network unnecessarily despite various optimizations. Gossip based routing method has been used and re-investigated to reduce the number of messages in both wired networks and wireless ad hoc networks. However, the global gossiping still generates many unnecessary messages in the area that could be far away from the line between sender node and receiver node. We propose a regional gossip approach, where only the nodes within some region forward a message with some probability, to reduce the overhead of the route discovery in the network. We show how to set the forwarding probability based on the region and the network density both by theoretical analysis and by extensive simulations. Our simulations show that the number of messages generated using this approach is much less than the simple global gossiping method, which already saves many messages compared with global flooding. We expect that the improvement should be even more significant in larger networks.     

Routing with Guaranteed Delivery in Ad Hoc Wireless Networks

We consider routing problems in ad hoc wireless networks modeled as unit graphs in which nodes are points in the plane and two nodes can communicate if the distance between them is less than some fixed unit. We describe the first distributed algorithms for routing that do not require duplication of packets or memory at the nodes and yet guarantee that a packet is delivered to its destination. These algorithms can be extended to yield algorithms for broadcasting and geocasting that do not require packet duplication. A byproduct of our results is a simple distributed protocol for extracting a planar subgraph of a unit graph. We also present simulation results on the performance of our algorithms.