移动Ad Hoc网络中的QoS路由研究

移动自组网是一种无基础设施的无线多跳新型网络。如何在移动自组网中提供不同的QoS保证是其面临的一个重要问题，而QoS路由则是其中的核心技术和热点问题。目前研究人员已经提出了几种QoS路由协议．但都是通过在具体的路由协议中增加QoS参数约束路由来保证QoS，仍存在一些问题，需要进一步研究和改进。     

移动自组网中的QoS保障及解决思路

介绍了移动自组网中OoS保障的难点，对目前的几种解决思路进行了分析，选取AODV路由协议作为具体的例子，对其QoS路由进行了分析并提出了今后的研究方向。     

TDMA自组网的QoS设计

QoS设计是一个复杂的问题,IETF针对有线网络提出实现QoS的2种标准模型;然而在无线自组网中,由于隐终端、显终端问题的存在和带宽限制问题,有线网络使用的QoS模型略显繁琐并使实现无线QoS较为困难。通过对TDMA方式自组网的分析,使用跨层合并方法设计一个QoS路由协议,并得到集成服务模型在无线自组网络的一个实现。通过仿真,验证此路由协议设计的正确性,同时分析此协议性能,结果表明该路由协议高效可行。     

移动自组网QoS保证技术的探讨

如何为用户提供相应的Qos保证是移动自组网发展的技术瓶颈之一。文章分别从QoS信令、QoS路由和QoS MAC方面比较全面地探讨了如何实现Qos保证;详细阐述了每个方面的关键技术,并结合主流协议介绍了具体操作过程,剖析了实现过程中的难点。     

移动自组网基于动态蜂窝的QoS路由协议

本文为移动自组网提出了一个基于动态蜂窝的QoS路由协议，它利用移动跟踪技术实现了一个分布式动态蜂窝生成协议；采用一个多Qos路由探测算法选择一条能够最大满足QoS要求的路由，并在这条路由上建立端．端主动资源预留；使用移动预测和被动资源预留技术预测源结点和目的结点可能进入的蜂窝集合，并在这些蜂窝集合与目的结点和源结点之间提前进行端．端被动资源预留；融合蜂窝动态检测技术与QoS路由修补技术自动发现和修补断裂的QoS路由．由于该路由协议模仿了固定蜂窝网络中的操作，所以，大大改善了QoS路由的性能．仿真结果表明：在满足QoS条件下，它明显提高了包传输率，减轻了路由负载．     

移动自组织网QoS路由协议研究

Qo S路由协议在移动自组织网的 Qo S保证中有十分重要的作用。本文首先从自组网特点出发 ,分析 Qo S路由设计的基本要求 ,然后从路由建立、链路状态信息的维护、路由控制开销和拓扑变化对协议的影响等方面详细介绍了 4种自组网 Qo S路由协议 ,最后提出了今后的研究方向     

移动自组网典型路由协议研究

随着网络的发展,移动自组网已成为当前研究的热点,文中介绍了移动自组网与现有通信系统在路由上的区别,重点探讨了移动自组网DSDV、AODV、DSR等几类典型的路由协议,以及MANET路由协议今后的主要研究方向。     

自组网的路由协议及其QoS保障

自组网是一种新型的移动计算机网络，它应用广泛，并具有重要的商业价值。首先介绍了自组网的概念和特点，然后分析了自组网路由协议的特点与设计思路，并丰此基础上讨论了在自组网环境下实现QoS的策略与方法。     

基于地理定位信息的移动自组网路由协议综述

移动自组网是自组网技术的重要应用领域,其关键技术在于路由协议的设计和选取.分析了移动自组网路由协议的基本设计原则和分类,总结了基于地理定位信息的移动自组网路由协议的发展现状和特点,指明了目前研究的热点方向.最后,对移动自组网的发展方向进行了展望.     

基于AODV的移动自组网中的报头压缩机制

针对移动自组网提供多媒体会话业务数据量大,需要高效利用无线信道资源的问题,结合ROHC报头压缩协议和AODV路由协议提出一种报头压缩机制HC-AODV.扩展AODV路由协议,在路由发现时完成ROHC头压缩参数配置,并对ROHC协议的分组格式、发送与接收端的工作机制、上下文的维护方案等进行设计使其适应移动自组网环境.仿真结果表明,此机制能在基本不增加路由开销的条件下有效压缩报头,明显提高信道带宽利用率.     

A Dynamic Alternate Path QoS Enabled Routing Scheme in Mobile Ad hoc Networks

A mobile ad hoc network (MANET) is a collection of self-organized mobile nodes that are capable of communicating with each other without the aid of any established infrastructure or centralized administration. Routing algorithm has been a challenge task in the wireless ad hoc network for a long time due to the dynamic nature of network topology. A recent trend in ad hoc network routing is the reactive on-demand philosophy where routes are established only when required. The on-demand routing protocol for ad hoc network is appealing because of its low routing overhead and its effectiveness when the frequency of route re-establishment and the demand of route queries are not high. However, considering the increasing demand of Quality-of-Service (QoS) requirements in many applications, the current on-demand routing protocols used for ad-hoc network should be adapted appropriately to effectively meet the stringent QoS requirements of specific multimedia traffic. We thus propose a routing protocol which tries its best to satisfy QoS requirements of specific multimedia traffic in the volatile environments of a MANET. The results of a series of simulations exhibit the practicability and feasibility of our approaches. This research was partially supported by National Science Council under grant NSC 93-2213-E-026-001     

Power-aware routing protocols in ad hoc wireless networks

An ad hoc wireless network has no fixed networking infrastructure. It consists of multiple, possibly mobile, nodes that maintain network connectivity through wireless communications. Such a network has practical applications in areas where it may not be economically practical or physically possible to provide a conventional networking infrastructure. The nodes in an ad hoc wireless network are typically powered by batteries with a limited energy supply. One of the most important and challenging issues in ad hoc wireless networks is how to conserve energy, maximizing the lifetime of its nodes and thus of the network itself. Since routing is an essential function in these networks, developing power-aware routing protocols for ad hoc wireless networks has been an intensive research area in recent years. As a result, many power-aware routing protocols have been proposed from a variety of perspectives. This article surveys the current state of power-aware routing protocols in ad hoc wireless networks.     

Dynamic QoS Allocation for Multimedia Ad Hoc Wireless Networks

In this paper, we propose an approach to support QoS for multimedia applications in ad hoc wireless network. An ad hoc network is a collection of mobile stations forming a temporary network without the aid of any centralized coordinator and is different from cellular networks which require fixed base stations interconnected by a wired backbone. It is useful for some special situations, such as battlefield communications and disaster recovery. The approach we provide uses CSMA/CA medium access protocol and additional reservation and control mechanisms to guarantee quality of service in ad hoc network system. The reason we choose CSMA protocol instead of other MAC protocols is that it is used in most of currently wireless LAN productions. Via QoS routing information and reservation scheme, network resources are dynamically allocated to individual multimedia application connections.     

多跳无线网路由协议研究进展

移动计算和无线通信的飞速发展为无线网络的应用开辟了美好前景．作为一种没有基础设施的无线网络，多跳无线网在战场、紧急救援等场合具有得天独厚的优势。多跳无线网路由协议的主要作用是监控网络拓扑变化、交换路由信息、产生和维护路由，它是目前的研究热点之一。本介绍了该领域的研究进展，首先叙述多跳无线网的8个特点及其对路由协议的7个要求．然后描述21种路由协议的原理并比较它们的特性，最后阐述了10个研究方向。     

Safari: A self-organizing, hierarchical architecture for scalable ad hoc networking

As wireless devices become more pervasive, mobile ad hoc networks are gaining importance, motivating the development of highly scalable ad hoc networking techniques. In this paper, we give an overview of the Safari architecture for highly scalable ad hoc network routing, and we present the design and evaluation of a specific realization of the Safari architecture, which we call Masai. We focus in this work on the scalability of learning and maintaining the routing state necessary for a large ad hoc network. The Safari architecture provides scalable ad hoc network routing, the seamless integration of infrastructure networks when and where they are available, and the support of self-organizing, decentralized network applications. Safari’s architecture is based on (1) a self-organizing network hierarchy that recursively groups participating nodes into an adaptive, locality-based hierarchy of cells; (2) a routing protocol that uses a hybrid of proactive and reactive routing information in the cells and scales to much larger numbers of nodes than previous ad hoc network routing protocols; and (3) a distributed hash table grounded in the network hierarchy, which supports decentralized network services on top of Safari. We evaluate the Masai realization of the Safari architecture through analysis and simulations, under varying network sizes, fraction of mobile nodes, and offered traffic loads. Compared to both the DSR and the L+ routing protocols, our results show that the Masai realization of the Safari architecture is significantly more scalable, with much higher packet delivery ratio and lower overhead.     

A Survey of Routing Protocols that Support QoS in Mobile Ad Hoc Networks

The explosive growth in the use of mobile devices coupled with users' desires for real-time applications has provided new challenges in the design of protocols for mobile ad hoc networks. Chief among these challenges to enabling real-time applications for mobile ad hoc networks is incorporating support for quality of service (QoS), such as meeting bandwidth or delay constraints. In particular, it is important that routing protocols incorporate QoS metrics in route finding and maintenance to support end-to-end QoS. This article extensively and exclusively studies the issues involved with QoS-aware routing and presents an overview and comparison of existing QoS-aware routing protocols. In addition, the open issues that must be addressed to fully support QoS-aware routing are discussed.     

Ad Hoc网络的安全问题和安全策略

AdHoc网络作为一种无线移动网络正成为网络研究,特别是军事研究的一个热点。由于AdHoc网络的特点,其安全问题和安全策略正受到越来越广播的重视。文中介绍了AdHoc网络的特点,论述了AdHoc网络和路由协议的安全问题,最后讨论并提出了AdHoc网络的一些安全策略。     

Robust position-based routing for wireless ad hoc networks

We consider a wireless ad hoc network composed of a set of wireless nodes distributed in a two dimensional plane. Several routing protocols based on the positions of the mobile hosts have been proposed in the literature. A typical assumption in these protocols is that all wireless nodes have uniform transmission regions modeled by unit disk centered at each wireless node. However, all these protocols are likely to fail if the transmission ranges of the mobile hosts vary due to natural or man-made obstacles or weather conditions. These protocols may fail because either some connections that are used by routing protocols do not exist, which effectively results in disconnecting the network, or the use of some connections causes livelocks. In this paper, we describe a robust routing protocol that tolerates up to roughly 40% of variation in the transmission ranges of the mobile hosts. More precisely, our protocol guarantees message delivery in a connected ad hoc network whenever the ratio of the maximum transmission range to the minimum transmission range is at most .     

一种基于多目标优化的Ad Hoc网络QoS路由算法

目前的一些Ad hoc网络QoS路由算法难以满足军事系统中一些特定业务对于多个目标的同时要求,本文选取带宽作为约束条件,把时延和丢失率作为QoS优化目标,建立了QoS路由选择的多目标整数优化模型,并给出了求解模型的算法.实例计算结果表明了算法的可行性.     

A simulation study of table-driven and on-demand routing protocolsfor mobile ad hoc networks

Bandwidth and power constraints are the main concerns in current wireless networks because multihop ad hoc mobile wireless networks rely on each node in the network to act as a router and packet forwarder. This dependency places bandwidth, power, and computation demands on mobile hosts which must be taken into account when choosing the best routing protocol. In previous years, protocols that build routes based on demand have been proposed. The major goal of on-demand routing protocols is to minimize control traffic overhead. We perform a simulation and performance study on some routing protocols for ad hoc networks. The distributed Bellman-Ford (1957, 1962), a traditional table-driven routing algorithm, is simulated to evaluate its performance in multihop wireless network. In addition, two on-demand routing protocols (dynamic source routing and associativity-based routing) with distinctive route selection algorithms are simulated in a common environment to quantitatively measure and contrast their performance. The final selection of an appropriate protocol will depend on a variety of factors, which are discussed in this article