LIAD: Adaptive bandwidth prediction based Logarithmic Increase Adaptive Decrease for TCP congestion control in heterogeneous wireless networks

被引:8
作者
Chang, Ben-Jye [1 ]
Lin, Shu-Yu [2 ]
Jin, Jun-Yu [2 ]
机构
[1] Natl Yunlin Univ Sci & Technol, Dept Comp Sci & Informat Engn, Yunlin, Taiwan
[2] Chaoyang Univ Technol, Dept Comp Sci & Informat Engn, Wufeng, Taiwan
关键词
TCP; Logarithmic Increase Adaptive Decrease; RTT-based; Shrink factor; Congestion control; Wireless error links; Heterogeneous wireless networks; PERFORMANCE;
D O I
10.1016/j.comnet.2009.05.010
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
For accessing plentiful resources in the Internet through wireless mobile hosts, diverse wireless network standards and technologies have been developed and progressed significantly. The most successful examples include IEEE 802.11 WiFi for wireless networks and 3G/HSDPA/HSUPA for cellular communications. All IP-based applications are the primary motivations to make these networks successful. In TCP/IP transmissions, the TCP congestion control operates well in the wired network, but it is difficult to determine an accurate congestion window in a heterogeneous wireless network that consists of the wired Internet and various types of wireless networks. The primary reason is that TO connections are impacted by not only networks congestion but also error wireless links. This paper thus proposes a novel adaptive window congestion control (namely Logarithmic Increase Adaptive Decrease, LIAD) for TCP connections in heterogeneous wireless networks. The proposed RTT-based LIAD has the capability to increase throughput while achieving competitive fairness among connections with the same TCP congestion mechanism and supporting friendliness among connections with different TCP congestion control mechanisms. In the Congestion Avoidance (CA) phase, an optimal shrink factor is first proposed for Adaptive Decreasing cwnd rather than a static decreasing mechanism used by most approaches. Second, we adopt a Logarithmic Increase algorithm to increase cwnd while receiving each ACK after causing three duplicate ACKs. The analyses of congestion window and throughput under different packet loss rate are analyzed. Furthermore, the state transition diagram of LIAD is detailed. Numerical results demonstrate that the proposed LIAD outperforms other approaches in goodput, fairness, and friendliness under diverse heterogeneous wireless topologies. Especially, in the case of 10% packet loss rate in wireless links, the proposed approach increases goodput up to 156% and 1136% as compared with LogWest-wood+ and NewReno, respectively. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:2566 / 2585
页数:20
相关论文
共 41 条
[1]  
[Anonymous], IEEE INT C 2006 ICC
[2]  
[Anonymous], 1981, 793 IETF RFC
[3]  
[Anonymous], NETWORK SIMULATOR NS
[4]  
[Anonymous], 1997, 2001 IETF RFC
[5]  
[Anonymous], CONGESTION AVOIDANCE
[6]  
[Anonymous], 80216 IEEE
[7]  
[Anonymous], 1999, IEEE 80211 STANDARD
[8]  
[Anonymous], 1981, 791 IETF RFC
[9]   Improving reliable transport and handoff performance in cellular wireless networks [J].
Balakrishnan, Hari ;
Seshan, Srinivasan ;
Katz, Randy H. .
WIRELESS NETWORKS, 1995, 1 (04) :469-481
[10]  
Brakmo L.S., 1994, TCP Vegas: New techniques for congestion detection and avoidance, P24