移动Ad Hoc网络关键技术研究

文章介绍了移动ad hoc网络的概念、各种应用以及关键技术,着重对无线TCP进行了研究对TCP Reno中选择确认(SACK)的缺点提出一种新的ASACK方法,使吞吐量得以提高,在节点高速移动时效果尤为明显对TCP Vegas作了改进,提出一种采用RTT通知的TCP Vegas方案,结果使节点高速移动时系统吞吐量明显提高.     

TCP拥塞控制技术研究

TCP拥塞控制机制对Internet的稳定运行起着重要作用.针对三种典型的TCP拥塞控制算法--Tahoe、Reno和Vegas的性能作出分析,Tahoe和Reno是目前TCP拥塞控制中最常用的;Vegas是在对Reno的发送端算法进行修改的基础上提出的一种拥塞控制算法.最后,对这些算法做了详细的比较和总结,并指出了进一步改进TCP拥塞控制的必要性.     

TCP拥塞控制机制浅析

TCP是当今网络中主要的传输协议,它采用了慢启动、拥塞避免、快速重传、快速恢复四种算法,能满足IP网络中数据的可靠传输。但是当出现多个数据包丢失时,由于TCP采用了累计确认机制,造成系统吞吐量下降。文章介绍了一种SACK拥塞控制机制,与传统的Tahoe、Reno对比,并通过仿真实验说明了SACK是一种最好的TCP恢复机制。     

光突发交换网络的动态TCP特性研究

通过仿真研究了动态业务竞争环境下,不同TCP版本在OBS网络中的传输性能。研究中,以TCP在OBS网络中传送一个固定大小的文件所需的时间作为性能指标,此外,详细分析了突发丢失的内部机制和造成不同TCP版本性能差异的原因。结果表明,TCP SACK性能最好。     

大带宽时延积网络TCP Vegas自适应慢启动算法

TCP Vegas具有比TCP Reno更好的带宽利用能力和稳定性,但是在带宽时延积较大的网络中,TCP Vegas会出现慢启动过早结束、拥塞窗口过小的问题,降低了传输效率.文中在分析慢启动结束的原因和条件的基础上,提出一种对临时性排队时延进行估计,将其排除后再进行慢启动结束条件判断的TCP Vegas慢启动算法,对不同网络条件有自适应能力.仿真结果表明本算法能有效避免慢启动过早结束,使TCP性能明显改善.     

针对无线上行链路的TCP跨层改进机制

在下一代蜂窝通信系统（例如,4G）里,传输控制协议（TCP）做为主要的端到端传输协议将随着互联网业务的开展而得到相当广泛的应用。本文根据上行无线链路对TCP的影响,提出了一种针对上行链路的TCP改进机制。该机制利用无线链路控制层（RLC）的反馈信息,实现了对TCP层定时器的自适应控制,从而大大降低了上行无线链路对TCP性能的影响。仿真结果表明,同传统的TCP机制相比,本文提出的TCP改进机制能够使得TCP在可靠性低,突发错误时间长以及切换时延高的无线移动环境更为有效地工作。     

TCP-H：基于三重判决的TCP拥塞控制

在异构无线网络中存在高误码、切换、信号衰落等链路特性,使传统的TCP拥塞控制机制受到了挑战。在不增加开销的情况下,基于丢包检测、RTT时间和ACK返回速率三重判决,提出了一种新的TCP拥塞控制机制（TCP—H）。仿真结果表明,TCP—H增强了对拥塞和随机差错的区分能力,满足公平性要求,改进的最小RTT计算方法解决了在低延迟向高延迟网络切换的时Vegas,Westwood等算法存在的最小RTT更新问题,有效提高了在异构无鲅网络环埔下TCP的性能．     

无线链路上的TCP性能研究

为了解决无线上网中误码率较高和传输延迟大的问题，需要有一种用于改善有线和无线链路的综合性技术。主要研究了TCP／IP协议栈在当前和正在发展的无线链路上提供可靠连接时，由无线链路特性所带来的TCP性能问题。首先分析了无线链路的特性，然后指出了无线链路上的TCP性能所受到的影响，介绍了用于解决这些问题的各种方案，考察了它们的优缺点。最后，描述了未来无线网络的演进，提出需要多层协议配合的设想。     

面向卫星网络的TCP传输性能的研究

卫星信道的长时延、高误码率、大延时带宽积等的特性使TCP协议的性能受到了很大的影响.为了提高卫星网络下TCP的性能,在不破坏TCP端到端语义的前提下,文中利用在异构网络的边界处设置具有传输控制功能的性能增强代理(Performance Enhancing Proxies,PEP)的理论模型,在SACK TCP协议下对该模型实现了一种卫星网络的拥塞控制和拥塞恢复策略.仿真实验表明,新模型能够充分利用卫星网络的带宽,达到获得最佳有效吞吐量的目的.     

一种提高无线环境中TCP性能的改进方案

本文针对无线信道的特点提出了一种用于提高无线环境中TCP性能的改进方案－Wireless-TCP，通过尝试对TCP的拥塞控制中时间的算法进行调整并增加Probe模块以应对无线信道中的长时间中断，保证TCP连接的存在，通过爱立信通信实验室的仿真实验验证了该改进方案的有效性。     

Shielding TCP from last hop wireless losses

The pervasiveness of the transport control protocol (TCP) and the proliferation of wireless local area networks (WLAN) of the 802.11 type make the topic of TCP performance over last hop wireless networks very relevant. The Snoop protocol, a link layer solution introduced several years ago to improve the performance of TCP in this scenario, has been shown to neglect its benefits to the most widely used TCP version, TCP SACK. In this paper, we introduce the TCP SACK‐Aware Snoop protocol to address this problem. Our results indicate that the TCP SACK‐Aware Snoop protocol improves the performance of TCP SACK by around 30% compared with the original Snoop protocol and by about 8% in an environment where no TCP enhancing mechanism is in place. In addition, we introduce further modifications to the proposed protocol to make its advantages available to any TCP sender. We also show that the mechanism does not introduce unfairness among TCP sources and somewhat protects TCP against UDP traffic. Our results show important throughput improvements to all TCP versions and demonstrate that the TCP SACK‐Aware Snoop protocol shields TCP from last hop wireless losses providing throughtput values very close to the maximum possible. Copyright © 2006 John Wiley & Sons, Ltd.     

Exploring the performance of TCP vegas in mobile ad hoc networks

Recent research efforts in mobile ad hoc networks have concentrated on examining the behaviour of TCP Reno over various ad hoc routing protocols and have suggested a number of extensions to improve its performance. TCP Vegas, which takes a proactive approach to congestion avoidance, has not so far been examined as a viable alternative to TCP Reno in wireless environments and no effort has been made to analyse its performance over routing protocols for MANETs. This paper evaluates using extensive simulation experiments the performance behaviour of TCP Vegas over a proactive (destination sequenced distance vector) and two reactive (dynamic source routing and ad hoc on demand distance vector) routing protocols and compares it against that of TCP Reno. Copyright © 2004 John Wiley & Sons, Ltd.     

Improving TCP/IP Performance over Third-Generation Wireless Networks

As third-generation (3G) wireless networks with high data rate get widely deployed, optimizing the transmission control protocol (TCP) performance over these networks would have a broad and significant impact on data application performance. In this paper, we make two main contributions. First, one of the biggest challenges in optimizing the TCP performance over the 3G wireless networks is adapting to the significant delay and rate variations over the wireless channel. We present window regulator algorithms that use the receiver window field in the acknowledgment (ACK) packets to convey the instantaneous wireless channel conditions to the TCP source and an ACK buffer to absorb the channel variations, thereby maximizing long-lived TCP performance. It improves the performance of TCP selective ACK (SACK) by up to 100 percent over a simple drop-tail policy, with small buffer sizes at the congested router. Second, we present a wireless channel and TCP-aware scheduling and buffer sharing algorithm that reduces the latency of short flows while still exploiting user diversity for a wide range of user and traffic mix.     

Performance evaluation of TCP algorithms in multi‐hop wireless packet networks

Wireless packet ad hoc networks are characterized by multi‐hop wireless connectivity and limited bandwidth competed among neighboring nodes. In this paper, we investigate and evaluate the performance of several prevalent TCP algorithms in this kind of network over the wireless LAN standard IEEE 802.11 MAC layer. After extensively comparing the existing TCP versions (including Tahoe, Reno, New Reno, Sack and Vegas) in simulations, we show that, in most cases, the Vegas version works best. We reveal the reason why other TCP versions perform worse than Vegas and show a method to avoid this by tuning a TCP parameter— maximum window size. Furthermore, we investigate the performance of these TCP algorithms when they run with the delayed acknowledgment (DA) option defined in IETF RFC 1122, which allows the TCP receiver to transmit an ACK for every two incoming packets. We show that the TCP connection can gain 15 to 32 per cent good‐put improvement by using the DA option. For all the TCP versions investigated in this work, the simulation results show that with the maximum window size set at approximately 4, TCP connections perform best and then all these TCP variants differ little in performance. Copyright © 2001 John Wiley & Sons, Ltd.     

Lost retransmission detection for TCP SACK

There have been a lot of works to avoid retransmission timeout (RTO) of transmission control protocol (TCP) that takes place in an unnecessary situation. However, most current TCP implementations, even if selective acknowledgment (SACK) option is used, do not have a mechanism to detect a lost retransmission and avoid subsequent RTO. In this letter, we propose a simple modification that enables a TCP sender using SACK option to detect a lost retransmission, which is called TCP SACK+ in simple. We use a stochastic model to evaluate the performance of TCP SACK+. Numerical results evaluated by simulations show that TCP SACK+ improves the loss recovery of TCP SACK significantly in presence of random losses.     

Novel Fastest Retransmission and Rate Control Schemes for Improving TCP Performance in Wireless Ad Hoc Networks

A number of different authors have considered the problem of performance degradation of transmission control protocol (TCP) in wireless ad hoc networks. We herein show that pauses in packet transmission due to packet losses are the fundamental cause of performance degradation of TCP in wireless ad hoc networks. To minimize the duration of packet transmission pauses, we propose a fast retransmission scheme for improving TCP performance in consideration of the inter-operability of previously deployed TCPs in wireless ad hoc networks. We also propose an additional rate control scheme for TCPs to reduce the probability of packet contention. Using OPNET and NS2 simulations, we show that our proposed schemes can provide a much better performance than conventional TCPs.     

变误码率的无线信道中TCP性能研究

描述了TCPReno、TCPVegas和TCPSACK的实现原理,并在NS2中仿真出一个误码率时变的无线信道,把TCP三个版本置于NS仿真环境中进行了仿真,对仿真结果进行了分析,指出了无线信道中TCP的研究方向。     

Use of TCP Decoupling in Improving TCP Performance over Wireless Networks

We propose using the TCP decoupling approach to improve a TCP connection's goodput over wireless networks. The performance improvement can be analytically shown to be proportional to , where MTU is the maximum transmission unit of participating wireless links and HP_Sz is the size of a packet containing only a TCP/IP header. For example, on a WaveLAN [32] wireless network, where MTU is 1500 bytes and HP_Sz is 40 bytes, the achieved goodput improvement is about 350%. We present experimental results demonstrating that TCP decoupling outperforms TCP reno and TCP SACK. These results confirm the analysis of performance improvement.     

TCP CERL: congestion control enhancement over wireless networks

In this paper, we propose and verify a modified version of TCP Reno that we call TCP Congestion Control Enhancement for Random Loss (CERL). We compare the performance of TCP CERL, using simulations conducted in ns-2, to the following other TCP variants: TCP Reno, TCP NewReno, TCP Vegas, TCP WestwoodNR and TCP Veno. TCP CERL is a sender-side modification of TCP Reno. It improves the performance of TCP in wireless networks subject to random losses. It utilizes the RTT measurements made throughout the duration of the connection to estimate the queue length of the link, and then estimates the congestion status. By distinguishing random losses from congestion losses based on a dynamically set threshold value, TCP CERL successfully attacks the well-known performance degradation issue of TCP over channels subject to random losses. Unlike other TCP variants, TCP CERL doesn’t reduce the congestion window and slow start threshold when random loss is detected. It is very simple to implement, yet provides a significant throughput gain over the other TCP variants mentioned above. In single connection tests, TCP CERL achieved an 175, 153, 85, 64 and 88% throughput gain over TCP Reno, TCP NewReno, TCP Vegas, TCP WestwoodNR and TCP Veno, respectively. In tests with multiple coexisting connections, TCP CERL achieved an 211, 226, 123, 70 and 199% throughput improvement over TCP Reno, TCP NewReno, TCP Vegas, TCP WestwoodNR and TCP Veno, respectively.