无线传感器网络拥塞控制机制研究

本论文在分析无线传感器网络不同于普通有线网络的特征后,提出了一种适用于无线传感器网络的TCP 拥塞控制机制DW-TCP,此机制将TCP拥塞窗口分为拥塞丢包窗口和误码丢包窗口,在链路误码率较高时通过降低发送速率提高数据发送的可靠性,节约无线节点的能源消耗和系统不必要的开销,该机制不但考虑到拥塞丢包对数据发送速率的影响,而且考虑到无线链路中的误码丢包对数据发送速率的影响.     

基于神经网络的多路无线TCP均衡控制算法

针对无线网络应用,能够有效地使多路的TCP数据业务均衡地使用网络共享资源,需要系统能根据无线网络的容量实时变化,动态调整各路TCP协议拥塞窗口大小,其参数结构复杂,难于建立精确的数学模型。为此提出了一种基于BP神经网络的控制算法,利用它可有效解决多路无线TCP数据业务拥塞窗口的自适应控制问题,为基于无线网络数据业务应用的优化提出一种新的思路。     

基于ECN跨层机制的无线TCP性能改进方案

针对无线环境下TCP（传输控制协议）调用拥塞控制算法致使性能下降的问题,提出一种基于ECN（显式拥塞通知）跨层机制的无线TCP改进方法。算法在ECN机制上判断网络是否拥塞以及丢包发生时具体丢包类型。并在此基础上针对网络具体状况采取不同的拥塞窗口控制机制,更精确的网络信息有效提高了数据发送的可靠性。仿真结果表明该算法可提...     

无线自组织网络TCP速率联合调制

TCP在无线自组织网络中受到信道竞争和队列拥塞的双重影响,因而不能准确地调节数据发送速率从而降低了传输性能。本文针对该问题提出一种基于对信道竞争和排队拥塞联合检测的TCP速率调制策略。实验结果显示,本策略在吞吐量和端到端时延上均明显提高了TCP的性能。     

TCP丢包检测技术分析

在有线网络环境中,分组丢失往往是由于网络拥塞造成的,因此传输控制协议(TCP)能够良好运行;然而当TCP运行在无线环境中,由于误码率高,信号衰落以及频繁的移动等特性造成丢包时,TCP拥塞窗口依旧盲目减半,导致其性能大幅度下降。本文首先阐述了无线环境中出现的拥塞丢包、随机丢包、突发丢包以及发生包的重新排序的原因,在此基础上,总结了处理这些问题的方法并对他们进行了评价,最后,分析了进一步的研究方向。     

基于模糊逻辑的无线网络流量自适应控制

文章在分析现有提高无线TCP性能方案的基础上，提出一种新的流量控制方法，即基于显式窗口反馈的无线网络流量控制方案。在Snoop中引入有线网络的显示窗口自适应（EWA）算法，通过对BS共享缓存的实时监测，应用模糊控制算法预测当前拥塞窗口（cwnd）的大小，并显式反馈给发送端，使TCP的发送窗口能快速响应网络负荷状况的变化．避免分组的丢失。仿真结果表明．该方法增强了网络对拥塞的自适应性以及对无线信道差错的实时处理能力．提高了网络的吞吐量。     

网络中的拥塞控制管理算法分析与比较

随着网络技术的发展,网络拥塞日益严重,如何解决拥塞,充分、高效地利用网络资源,成为当今急需解决的问题.由于Internet上大多数业务都采用TCP协议,因此TCP的拥塞控制机制对控制网络拥塞具有特别重要的意义.本文介绍了TCP基于窗口的拥塞控制策略和目前常用端到端拥塞控制算法,并对它们的性能进行比较.     

TCP在无线环境中的性能改进技术研究

对TCP拥塞控制算法作了一些改进,以适应于无线链路传输环境.基本方法是根据TCP测量的RTT值动态估计当前链路可用带宽,重新计算并设置拥塞窗口cwnd值.仿真显示,改进后的TCP应用于无线环境性能有了较大的改进.     

Ad Hoc 网络中一种基于端节点的启发式TCP改进方法

针对无线移动自组织网络(Mobile Ad Hoc Network,MANET)中网络拥塞和较高误码所引起的TCP性能下降的问题,本文提出了一种端到端的、启发式TCP改进机制.通过该机制,接收端可以推断出网络丢包的真正原因,以及可能的网络拥塞.根据推断结果,发送端采用ECN和(或)ELN机制向发送端尽早反馈,使得发送端可以针对不同的情况采取合适的措施,从而可以改进TCP在MANET中的性能.NS-2试验结果表明在MANET中该方法的性能优于传统TCP.     

三种拥塞控制机制在无线环境中的性能仿真与分析

随着无线通信技术的发展,在诸如蜂窝网、无线局域网以及移动计算环境下,TCP拥塞控制机制却面,临着新的挑战。本文对拥塞控制机制在单窗口多包丢失情况下以及在不同误码率的无线环境中的性能进行了仿真分析,提出了改进TCP性能所必须考虑的因素。     

DTPA: A Reliable Datagram Transport Protocol over Ad Hoc Networks

As a prevalent reliable transport protocol in the Internet, TCP uses two key functions: AIMD (Additive Increase Multiplicative Decrease) congestion control and cumulative ACK technique to guarantee delivery. However, with these two functions, TCP becomes lowly efficient in ad hoc networks that have a much lower BDP and frequent packet losses due to various reasons, since TCP adjusts its transmission window based on packet losses. In this paper, we present that, provided that the BDP is very small, any AIMD-style congestion control is costly and hence not necessary for ad hoc networks. On the contrary, a technique to guarantee reliable transmission and to recover packet losses plays a more critical role in the design of a transport protocol over ad hoc networks. With this basis, we propose a novel and effective datagram-oriented end-to-end reliable transport protocol for ad hoc networks, which we call DTPA. The proposed scheme incorporates a fixed-size window based flow control and a cumulative bit-vector based selective ACK strategy. A mathematical model is developed to evaluate the performance of DTPA and to determine the optimum transmission window used in DTPA. The protocol is verified using GloMoSim. The simulation results show that our proposal substantially improves the network performance.     

A transport protocol for supporting multimedia streaming in mobile ad hoc networks

Transport protocol design for supporting multimedia streaming in mobile ad hoc networks is challenging because of unique issues, including mobility-induced disconnection, reconnection, and high out-of-order delivery ratios; channel errors and network congestion. In this paper, we describe the design and implementation of a transmission control protocol (TCP)-friendly transport protocol for ad hoc networks. Our key design novelty is to perform multimetric joint identification for packet and connection behaviors based on end-to-end measurements. Our NS-2 simulations show significant performance improvement over wired TCP friendly congestion control and TCP with explicit-link-failure-notification support in ad hoc networks.     

TCP-Gvegas with prediction and adaptation in multi-hop ad hoc networks

TCP Vegas performance can be improved since its rate-based congestion control mechanism could proactively avoid possible congestion and packet losses in multi-hop ad hoc networks. Nevertheless, Vegas cannot make full advantage of available bandwidth to transmit packets since incorrect bandwidth estimates may occur due to frequent topology changes caused by node mobility. This paper proposes an improved TCP Vegas based on the grey prediction theory, named TCP-Gvegas, for multi-hop ad hoc networks, which has the capability of prediction and self-adaption, as well as three enhanced aspects in the phase of congestion avoidance. The lower layers’ parameters are considered in the throughput model to improve the accuracy of theoretical throughput. The prediction of future throughput based on grey prediction is used to promote the online control. The optimal exploration method based on Q-Learning and Round Trip Time quantizer are applied to search for the more reasonable changing size of congestion window. Besides, the convergence analysis of grey prediction by using the Lyapunov’s second method proves that a shorter input data length of prediction implies a faster convergence rate. The simulation results show that the TCP-Gvegas achieves a substantially higher throughput and lower delay than Vegas in multi-hop ad hoc networks.     

TCP transmission rate control mechanism based on channel utilization and contention ratio in AD hoc networks

In ad hoc networks, both contention and congestion can severely affect the performance of TCP. In our work, we first show that the over-injection of conventional TCP window mechanism results in severe contentions, and medium contentions cause network congestion. Furthermore, introducing two metrics, channel utilization (CU) and contention ratio (CR), we characterize the network status. Then, based on these two metrics, we propose a new TCP transmission rate control mechanism based on Channel utilization and Contention ratio (TCPCC). In this mechanism, each node collects the information about the network busy status and determines the CU and CR accordingly. The CU and CR values fed back through ACK are ultimately determined by the bottleneck node along the flow. The TCP sender controls its transmission rate based on the feedback information. Simulation results show that the proposed TCPCC mechanism significantly outperforms the conventional TCP mechanism and the TCP contention control mechanism in terms of throughput and end-to-end delay.     

在Ad Hoc网络中TCP-SACK性能研究及改进

在Ad Hoc网中,经常发生链路失效和路由变化。TCP把数据包的丢失归结为链路拥塞,所以TCP在Ad Hoc网中表现很差。在本文中通过应用一种新的方法,基于传输包乱序检测与响应方法,研究TCP在Ad Hoc网中的性能。通过实验结果表明,此算法解决了,提高了网络的吞吐量。     

Rate Control Algorithm Considering Mobility in Mobile Ad Hoc Networks

For reducing the loss of data packet due to network congestion and mobility, rate control algorithm is effective means for ensuring the fair allocation of network resource among communication flows and alleviating network congestion. The Transport Control Protocol (TCP) was originally designed for wire-line networks, where the links are assumed to be reliable and with fixed capacities. However, the performance of TCP becomes very poor when it is directly used in ad hoc networks. Some optimization-based congestion control schemes have been proposed to improve TCP performance in ad hoc networks, but the mobility of hosts and route change frequently are not considered for designing rate control algorithm. In this paper, we propose rate control algorithms in a more practical way by taking into account link congestion and node movement. Numerical results show that the rate control algorithms can approach the globally optimal value and show the effect of the node mobility on the algorithms.     

A novel learning based solution for efficient data transport in heterogeneous wireless networks

There has been a spectacular growth in the use of wireless networks in recent times and consequently, adapting TCP to the wireless networks is a hot topic of current research. However, most of the existing works proposed for this problem have been designed for specific wireless networks, or they necessitate changes at either the receiver or the intermediate nodes, or at both, because of which their deployment becomes difficult. In this work, we propose a TCP variant which works over both multi-hop ad hoc wireless networks as well as single-hop (last-hop) wireless networks, like Wireless LANs, cellular, and satellite networks. We use a learning based method to dynamically change the congestion window size according to the network conditions. Our protocol does not rely on any explicit feedback from the network and requires only sender-side modifications. Through extensive simulations we show that our protocol achieves the desired goals of performance improvement in goodput, reduction in packet loss, and fairness to the competing flows. To the best of our knowledge, this is the first unified solution for both single-hop and multi-hop wireless networks.     

APS-FeW适用于无线网络的TCP增强方案

TCP的控制隐含了一个假设,即分组丢失都是由网络拥塞引起的,而这一点对于无线网络不成立.因此在无线情况下,会引入了冗余控制,使得传输性能下降.浮点窗口算法(FeW)通过限制TCP的分组注入量,减少冗余控制,在此基础上,提出了改进方案自适应包长算法(APS).仿真数据表明,基于FeW的APS算法(APS-FeW)比FeW算法提升了10%～25%的吞吐量.     

Packet Recycling and Delayed ACK for Improving the Performance of TCP over MANETs

Most of the schemes that were proposed to improve the performance of transmission control protocol (TCP) over mobile ad hoc networks (MANETs) are based on a feedback from the network, which can be expensive (require extra bandwidth) and unreliable. Moreover, most of these schemes consider only one cause of packet loss. They also resume operation based on the same stand-by parameters that might vary in the new route. Therefore, we propose two techniques for improving the performance of TCP over MANETs. The first one, called TCP with packet recycling (TCP-PR), allows the nodes to recycle the packets instead of dropping them after reaching the retransmission limit at the MAC layer. In the second technique, which is called TCP with adaptive delay window (TCP-ADW), the receiver delays sending TCP ACK for a certain time that is dynamically changed according to the congestion window and the trip time of the received packet. TCP-PR and TCP-ADW are simple, easy to implement, do not require network feedback, compatible with the standard TCP, and do not require distinguishing between the causes of packet loss. Our thorough simulations show that the integration of our two techniques improves the performance of TCP over MANETs.     

Improving Transport Layer Performance in Multihop Ad Hoc Networks by Exploiting MAC Layer Information

The traditional TCP congestion control mechanism encounters a number of new problems and suffers a poor performance when the IEEE 802.11 MAC protocol is used in multihop ad hoc networks. Many of the problems result from medium contention at the MAC layer. In this paper, we first illustrate that severe medium contention and congestion are intimately coupled, and TCP's congestion control algorithm becomes too coarse in its granularity, causing throughput instability and excessively long delay. Further, we illustrate TCP's severe unfairness problem due to the medium contention and the tradeoff between aggregate throughput and fairness. Then, based on the novel use of channel busyness ratio, a more accurate metric to characterize the network utilization and congestion status, we propose a new wireless congestion control protocol (WCCP) to efficiently and fairly support the transport service in multihop ad hoc networks. In this protocol, each forwarding node along a traffic flow exercises the inter-node and intra-node fair resource allocation and determines the MAC layer feedback accordingly. The end-to-end feedback, which is ultimately determined by the bottleneck node along the flow, is carried back to the source to control its sending rate. Extensive simulations show that WCCP significantly outperforms traditional TCP in terms of channel utilization, delay, and fairness, and eliminates the starvation problem