无线自组网TCP数据流拥塞窗口上限计算  

Calculating the TCP Data Flow Congestion Windows Up Bound over Wireless Ad Hoc Networks

作　　者：李庆华[1,2] 陈志刚[2] 曾志文[2] 邓晓衡[2] 

机构地区：[1]宜春学院通信教研室,江西宜春344000 [2]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《四川大学学报（工程科学版）》2010年第3期164-170,共7页Journal of Sichuan University (Engineering Science Edition)

基　　金：国家自然科学基金资助项目(60873082);总装备部预研基金资助项目(9140A15030308QT4801)

摘　　要：为改善无线自组网环境下TCP协议的数据吞吐量,仿真并分析了无线自组网TCP数据流拥塞丢包数与队列长度和发送窗口大小的关系,在已有无线自组网链路吞吐量模型的基础上利用网络演算理论推导了保证数据流拥塞丢包率为零的TCP发送窗口上限WThresh;基于WThresh的改进协议TCP-WThresh能在拥塞窗口上限范围内准确判断丢包为非拥塞丢包,有效避免TCP误启动拥塞控制机制,在拓扑形式确定的无线多跳网络环境下有较好的性能表现。In order to improve TCP throughput over wireless ad hoc networks,the relation between TCP data flow packet losses caused by network congestion and queue length、TCP sending windows over wireless ad hoc networks is simulated and analyzed.The TCP sending windows up bound is derived using network calculus theory based on already exist wireless link throughput model.When the value of sending windows is less than W^Thresh,TCP-W^Thresh accurately judges packet losses as non-congestion losses and avoids mal-operation of congestion control.Thus,the improved TCP based on W^Thresh performs well over special wireless multihop ad hoc networks scenarios.

关 键 词：无线自组网 确定网络演算 TCP流 丢包 拥塞窗口上限 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]