一种基于节点状态预测机制的高稳定性路由设计

该文旨在为拓扑动态变化的无线自组织网络设计一种稳定性路由机制。首先建模分析了动态变化网络中节点间通信路径存在的条件,以及数据包在该路径上可靠传输的条件,基于以上分析提出了保证路径有效的关键指标：链路持续时间、拥塞可能性因子。接下来提出基于节点当前运动情况计算链路持续时间,以及基于缓冲区队列长度与队列长度变化率计算节点拥塞可能性因子的算法。结合链路持续时间与节点拥塞可能性等信息,该文提出了一种面向路径可靠性及稳定性综合指标的按需路由机制(ODRP-DR),并利用NS2仿真平台对该机制性能进行分析,仿真结果表明,在网络拓扑结构动态变化的情况下能有效减小数据包丢包概率,路由重建次数。     

一种无线自组织网络动态路由协议

介绍了一种基于稀疏树的无线自组织网络动态路由协议,该协议采用了稀疏树路径生成算法来减少路由更新的数据量并减少网络链路的冗余,采用增量更新来降低路由协议开销并降低对传输带宽的占用,支持单向信道,采用快速路径查找算法消除网络拓扑动态变化过程中的环路与无穷计数问题。仿真结果显示它具有收敛快,开销小等特性,能够较好地适应窄带无线通信环境的需要。     

一种基于MANET的多路径优化路由算法

针对AOMDV协议的多路径路由机制和特点,提出一种基于带宽、时延与链路拥塞度约束的多路径优化路由算法。仿真实验结果表明,对于中低速动态的MANET网络环境,算法能在一定程度上延长网络生存时间以及提高分组投递率。     

自组织网及其路由技术

一、自组织网的发展概况 所谓自组织网（Ａｄ Ｈｏｃ）是由若干个移动的无线通信终端构成一个临时性的无中心的、无需依靠任何基础设施的非标准网络。一个由３个移动主机（Ａ、Ｂ、Ｃ）组成的简单的自组织网的模型如图１，图中Ａ、Ｃ节点各在对方传输范围外，但Ｂ既在Ａ的传输范围内又在Ｃ的传输范围内，这样Ａ发往Ｂ的数据可直接送达，而发往Ｃ的数据需经Ｂ转发，这就需要路由控制。在实际的网络中，路由控制可能会更复杂。自组织网的优点是能够提高通信网络的可靠性和应变能力，但也随之带来网络控制的特殊性和复杂性。自组织网的网络技术…     

自组织网中的动态路由算法性能仿真研究

以仿真为主要手段研究了自组织网中基于AODV的路由算法的性能 ,比较了采用全网泛洪方式和限制泛洪半径方式下的网络性能。改进了现有调度策略 ,并仿真了其对端到端时延的影响。仿真结果表明 ,采用限制泛洪半径方式的网络性能明显好于全网泛洪方式 ,而改进型调度策略也能够进一步有效提高网络性能     

Ad Hoc中基于编码的多约束多播路由安全高效算法

在Ad Hoc应用中,在保证多种网络服务质量(Qo S)的情况下,确保网络安全具有重要意义。文章分析了移动自组网应用的一般特点,提出了网络模型和编码方法,制订了安全规则,给出了一个基于网络编码技术的多约束安全多播路由算法(BFSMA),该算法能够提高数据发送可靠性,减少丢包率,降低平均延迟。仿真结果对本文提出的算法给予了支持,可提高移动自组网的通信质量和安全性。     

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

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

Ad Hoc网络支持QoS保障的多信道MAC协议

提出一种基于多信道的QoS保障方案,结合业务区分和资源预留两种QoS保障策略,保证优先级高的业务及时接入信道;并且建立节点发送链表,给数据通信预留一段时间,实现数据信道上连续的帧交换,有效地使用了数据信道资源。     

Ad Hoc网络支持QoS保障的多信道MAC协议

提出一种基于多信道的Qo S保障方案,结合业务区分和资源预留两种Qo S保障策略,保证优先级高的业务及时接入信道;并且建立节点发送链表,给数据通信预留一段时间,实现数据信道上连续的帧交换,有效地使用了数据信道资源。     

基于信源路由的时延受限点到点路由算法

本文研究了网络路由中的一个NPC问题:时延受限最小代价路由问题.文中提出了一个理论框架,并给出了多个简单有效的启发式算法,在满足给定时延约束条件可行路径存在时,算法总能找到满足约束条件的代价优化路径.文中提出的启发式算法复杂性为O(|V|²)且在线复杂性为O(|V|).仿真显示算法取得了良好的平均代价性能.最后将模型扩展到多QoS限制条件下的路由问题.     

Route Maintenance in a Wireless Mobile Ad Hoc Network

A mobile ad-hoc network (MANET) is formed by a cluster of mobile hosts, without the infrastructure of base stations. To deal with the dynamic changing topology of a MANET, many routing protocols have been proposed. In this paper, we consider the route maintenance problem, which includes two parts: route deterioration and route breakage. In a MANET, a route may suddenly become broken because only one host roams away. Even if a route remains connected, it may become worse due to host mobility or a better route newly being formed in the system. Existing protocols, however, will stick with a fixed route once it is discovered, until it is expired or broken. In this paper, we show how to enhance several existing protocols with route optimization and local route recovery capability. So the routing paths can be adjusted on-the-fly while they are still being used for delivering packets and can be patched in minimum wireless bandwidth and delay while route errors occur.     

Ad Hoc网络先应式路由维护机制的优化模型研究

Ad Hoc网络先应式路由算法(Proactive Routing Algorithm)具有寻由时延小,拓扑维护及时的优点,适合在网络负载较大的环境下高效运行.本文针对路由维护机制,以减少协议开销和寻由错误报文为目标,提出了基于Ad Hoc网络的先应式路由维护机制优化模型.通过对优化模型的相关参数讨论,得出如下结论:1.先应式路由协议的最优更新时间周期具有"逆向稳定性";2.节点数目n与更新系数h有比例关系n→h^3/2.通过模型求解和仿真结果相比较,验证了模型的正确性.优化模型的研究为先应式路由算法更新机制和算法的可扩展性支持提供了理论依据.     

在分群分布式Ad hoc网络中一种基于TDMA带宽预定的QoS路由协议

研究了在基于TDMA接入方式分层分布式Ad hoc网络中,如何预约带宽来支持QoS路由.所提出的路由协议在计算带宽时考虑了隐藏终端和暴露终端问题,充分利用信道资源.在路由维护时考虑了节点的移动性,从而保持通信的不间断.     

DSR的一种自适应路由自动缩短机制

动态源路由协议是无线自组织网络众多路由协议中被广泛关注的一种按需路由协议，目前，关于该协议的优化措施有很多。本文先分析了动态源路由协议的一种优化机制——路由自动缩短，该机制能动态缩短处于工作状态路由的跳数，但不保证缩短路由的质量，在此基础上，提出一种自适应路由自动缩短机制，新机制既可缩短路由．又能保证缩短路由质量．理论分析及仿真结果表明，自适应路由缩短机制的各项性能优于原路由缩短机制。     

移动自组织网路由稳定性分析

针对移动自组织网络中的路由建立和维护问题,研究了衡量路由稳定性的准则,以节点的不确定性特征作为路由选择的标准,提出了基于局部拓扑结构变化熵度量的稳定路由选择策略,并在此基础上设计了一种稳定路由协议。通过NS-2仿真软件对路由选择策略和路由协议进行了验证,仿真结果表明所提出的稳定路由选择策略和路由协议能够有效地提高移动自组织网络的性能。     

A Comprehensive Service Discovery Solution for Mobile Ad Hoc Networks

Service discovery is an integral part of constructing self-configuring Mobile Ad Hoc Networks (MANETs). While several service discovery protocols have been developed, most of them are designed for infrastructure-based networks and thus not suitable to be used in MANETs. Due the volatile nature of MANET, service discovery protocols designed for MANETs often suffer from problems. Firstly, they have limited scalability due to the extensive use of broadcast communication. Secondly, they usually lack context-aware selection mechanisms and feature only reduced interaction standards. This paper proposes a network layer supported comprehensive service discovery solution that addresses the above issues and provides a solution in two parts. First it discusses a location-aware network layer routing protocol that groups mobile nodes into clusters while a gateway in each cluster is responsible for routing. Secondly, this paper proposes a service discovery protocol that utilizes directories for service discovery that interact with lower network layer gateway configurations. In this architecture, gateways are also used as directories for service discovery to improve performance. In doing so, we improve the system’s overall efficiency by eliminating the use of complex graph-based algorithms for maintaining clusters and establishing virtual backbones. Furthermore, this service discovery solution includes an agent-based context-aware service selection, and provides standard mechanisms for different types of service interaction. Jerry Tyan is a graduate student in the Department of Computing and Information Science at the University of Guelph in Guelph, Canada. Jerry holds a B.Sc. in Computer Science from Simon Fraser University in Vancouver, Canada. His research interests are in the area of service discovery protocols for mobile ad hoc networks. Qusay H. Mahmoud is an Assistant Professor in the Department of Computing and Information Science at the University of Guelph, and Associate Chair of the Distributed Computing and Wireless & Telecommunications Systems Technology program at the University of Guelph-Humber in Toronto, Canada. He received a B.Sc. in Data Analysis and an M.Sc. in Computer Science, both from the University of New Brunswick (Canada), and a Ph.D. in Computer Science from Middlesex University (UK). Dr. Mahmoud has published dozens of research papers and two books. Also, he has organized several research events, edited their proceedings, and presented tutorials at several international conferences worldwide. His research interests include wireless computing, agent technology, service discovery protocols, and Web-based systems. He is a member of the ACM and the IEEE Computer Society.This revised version was published online in August 2005 with a corrected cover date.     

On-Demand Utility-Based Power Control Routing for Energy-Aware Optimization in Mobile Ad Hoc Networks

In this paper, we propose a novel on-demand energy-aware routing protocol, UBPCR [utility-based power control routing], which reduces the trade-offs that arise in the other energy-aware route selection mechanisms that have recently been proposed for mobile ad hoc networks. Our approach is based on an economic framework that represents the degree of link's satisfaction (utility). With UBPCR, the utility function for any transmitter-receiver pair is defined as a measure of the link's preference regarding the signal-to-interference-and-noise ratio (SINR), the transmit power, and the transmitter's residual battery capacity. During a route-searching process, each intermediate node between the source and the destination is executed via two consecutive phases: the scheduling phase and the transmit power control phase. The scheduling algorithm finds the proper qualified data slot for the receiving channel so that the transmissions of independent transmitters can be coordinated. The transmit power control determines the optimal power, if one exists, that maximizes the corresponding link's utility. Extensive simulations show that the UBPCR protocol can achieve incompatible goals simultaneously and fairly. Chan-Ho Min received the B.S. degree in Industrial Management and the M.S. degree in Industrial Engineering from Korea Advanced Institute of Science and Technology (KAIST) in 2000 and 2002, respectively, where he is currently pursuing the doctoral degree in Industrial Engineering (Telecommunication Engineering Interdisciplinary Program) at KAIST. His research interests include the optimization problems of radio resource management for broadband wireless/cellular/ad hoc/satellite communication networks. In particular, he focuses on mobile ad hoc networking. Sehun Kim received the B.S. degree in Physics from Seoul National University, Seoul, Korea, and the M.S .and Ph.D. degrees in Operations Research from Stanford University. In 1982, he joined the faculty of the Korea Advanced Institute of Science and Technology (KAIST), where he is currently a Professor of Industrial Engineering. His research has been in the areas of combinatorial and nonlinear optimization. Recently, he is working on the application of optimization techniques to the design and analysis of computer and communication systems. He has published a number of papers in Mathematical Programming, Operations Research Letters, Journal of Optimization Theory and Applications, IEEE Trans. on Vehicular Technology, and International Journal of Satellite Communications.     

基于鲁棒性的移动自组织网络路由选择算法

移动Adhoc网络中传输流时,通常受到节点的移动性引起的路由中断影响。当传输实时数据流时,必须提供具有鲁棒性的路由。提出了基于鲁棒吞吐量的路由选择方法进行路由选择,可以极大地提高MANET网络系统的吞吐量速率。按需鲁棒路由算法（distributedon-demand routing and flow admission,DRFA）方案选择性的发现路由,保证准备传输的流或文件不中断（包括不重新选择路由）的传输。     

Ad Hoc网络中一种随机化分布式QoS路由算法

针对无线移动Ad Hoc网络(Mobile Ad Hoc Network,MANET),采用一种基于随机化分布式QoS路由算法RBAD(Random-Based Distributed QoS Routing Algorithm),该算法依据信道条件和业务量优化分组在多条路径上的路由,及寻找路由和存储路由表的代价,通过对结点排序,达到实现网络平均时延和平均消息复杂度最小的目标。仿真结果表明该算法能够以较小的路由消息开销获得较高的路由成功率,此外,算法具有可扩展性,可以应用于较大规模的Ad Hoc网络。     

移动自组织网络中能源信息熵的需求多路径路由协议(英文)

This paper provides a critical review of energy entropy theory in Mobile Ad Hoc Networks (MANETs) and proposes an Energy Entropy on Ad Hoc On-demand Distance Vector Multipath (EEAODVM) routing protocol. The essential idea of the protocol is to find every route which can minimize the node residual energy in the process of selecting path. It balances individual node battery energy utilization and hence prolongs the entire network lifetime. The results of simulation show that, with the proposed EEAODVM routing...