Ad hoc网络基于隐终端的油突委限拓扑算法

冲突控制一直是Ad hoc网络中的研究热点,本文给出一种新的冲突受限模型,从隐终端的角度对冲突进行定量的分析描述,并提出相应的冲突受限算法.该算法在保证网络连通性的前提下构建一个冲突控制拓扑,用于实现整个网络的冲突控制.实验结果显示算法有效地降低了网络中由隐终端问题引起的冲突,提高了网络性能.     

一种增强移动自组网Internet连接的改进型方案

针对移动自组网因单向链路以及盲目转播网关发现分组而造成的与Internet互联性能下降,提出了一种增强型互联方案.同时结合了先应和后应网关发现策略优点的混合网关发现策略被用来获取良好的Internet连接并保持低开销.而通过交换携带有额外增加的对称邻居节点列表和非对称邻居节点列表字段的AODV hello分组,单向链路得以从路由计算中予以清除而广播风暴也同时得到抑制.基于ns-2的仿真结果表明此改进型Internet连接方案在单向链路数量及节点移动速度均变化的应用环境下能取得较其他方案为优的互联性能.     

移动自组网AODV多路径路由研究

AODV协议是唯一通过IETF批准成为RFC文档的移动自组网按需控制路由协议．分析AODV路由协议工作过程及优缺点,并介绍了几种典型的基于AODV的多路径路由改进协议,最后对这些多路径协议进行优缺点分析及性能比较。     

Hybrid ants-like search algorithms for P2P media streaming distribution in ad hoc networks

Media streaming delivery in wireless ad hoc networks is challenging due to the stringent resource restrictions,po-tential high loss rate and the decentralized architecture. To support long and high-quality streams,one viable approach is that a media stream is partitioned into segments,and then the segments are replicated in a network and served in a peer-to-peer(P2P) fashion. However,the searching strategy for segments is one key problem with the approach. This paper proposes a hybrid ants-like search algorithm(HASA) for P2P media streaming distribution in ad hoc networks. It takes the advantages of random walks and ants-like algorithms for searching in unstructured P2P networks,such as low transmitting latency,less jitter times,and low unnecessary traffic. We quantify the performance of our scheme in terms of response time,jitter times,and network messages for media streaming distribution. Simulation results showed that it can effectively improve the search efficiency for P2P media streaming distribution in ad hoc networks.     

Experimental evaluation of an on-demand multipath routing protocol for video transmission in mobile ad hoc networks

We propose an on-demand multiparth routing algorithm in a mobile ad hoc network for video transmission and evaluate its real world performance in video streaming application. There have been a number of multipath routing protocols extended from AODV which is a well-known single path routing protocol. Multipath routing protocols indicate good performance in the reduction of route discovery latency and unnecessary routing packets in simulations. We show that the route establishment using source route lists provided by us (Hu and Johnson, 2002) can reduce the route discovery latency, select stable routes automatically, and work well for live video streaming without limitation of the hop count based approaches. We evaluate this proposed method compared with the original AODV by using eight laptop PCs and demonstrate live streaming experiments.     

Congestion control for ATM multiplexers using neural networks:multiple sources/single buffer scenario

A new neural network based method for solving the problem of congestion control arising at the user network interface (UNI) of ATM networks is proposed in this paper. Unlike the previous methods where the coding rate for all traffic sources as controller output signals is tuned in a body, the proposed method adjusts the coding rate for only a part of the traffic sources while the remainder sources send the cells in the previous coding rate in case of occurrence of congestion. The controller output signals include the source coding rate and the percentage of the sources that send cells at the corresponding coding rate. The control methods not only minimize the cell loss rate but also guarantee the quality of information (such as voice sources) fed into the multiplexer buffer. Simulations with 150 ADPCM voice sources fed into the multiplexer buffer showed that the proposed methods have advantage over the previous methods in the aspect of the performance indices such as cell loss rate (CLR) and voice quali     

Quality incentive based congestion control for multimedia communication over IP networks

In this paper we introduce a framework for using quality as an incentive to promote proper application level congestion control. Through integrating a joint-source channel coder and feedback-based congestion control scheme, we are able to construct accurate and efficient quality incentives. The framework is applicable in all network architectures where end-to-end congestion control may be used, and is as such not specific to either best-effort or traffic class-based architectures. The concept is presented along with preliminary simulations that highlight the resulting rate control accuracy. We also discuss how to implement some well-known congestion control schemes within our framework.     

Ad hoc网络基于自适应按需加权的冲突受限算法

在Ad hoc网络中冲突控制问题一直是研究热点,本文首先对冲突进行定量的分析描述,然后从自适应按需加权的角度提出相应的冲突受限算法。该算法在保证网络连通性的前提下,兼顾节点移动性,节点度以及链路冲突尽量最小化,构建了一个冲突控制拓扑,用于实现整个网络的冲突控制,提高了网络性能。     

复杂混合网络中拥塞控制算法仿真实验设计

拥塞控制是计算机网络课程中的一个重点和难点.文章通过引入NS3网络仿真工具,对构建复杂混合网络实验环境的方法和步骤进行了论述,并在4∶4哑铃网络拓扑结构的基础上,实现了多个网络实验场景;以拥塞窗口大小为依据,对常见的多种拥塞控制算法进行了理论验证性实验;以吞吐量为依据,对同类拥塞控制算法之间的公平性和异类拥塞控制算法之...     

基于RBF神经网络的不确定机械臂自适应反演控制研究

针对机械臂位置跟踪问题,基于RBF神经网络控制理论,提出了一种自适应反演控制方法．该方法利用反演控制技术解决了系统的非线性问题,通过神经网络对系统中不确定函数进行逼近,实现神经网络自适应反演控制,最后通过Lyapunov稳定性理论证明所得闭环系统的最终一致有界．仿真结果证明该算法的有效性．