Finding an Optimum Maximum Congestion Window for TCP Reno over 802.11 Based Ad Hoc Networks

Author

Li, Xia ; Kong, Peng-Yong ; Chua, Kee-Chaing

Author_Institution

Network Technol. Dept., Inst. for Infocomm Res.

fYear

2007

fDate

11-15 March 2007

Firstpage

3619

Lastpage

3624

Abstract

Bandwidth delay product (BDP) represents the maximum amount of allowed unacknowledged data in flight at any moment in the network. Due to the spatial reuse property of 802.11 MAC protocol in multi-hop ad hoc networks, the BDP of the path approximates 1/4 of the path length and is a value of several packets. With such a small BDP, TCP cannot work efficiently since its congestion window increases far beyond BDP most of the time, which can generate heavy congestion in the network. This paper presents a mathematical approach to derive an optimum maximum congestion window for TCP Reno over 802.11 based ad hoc networks. We adopt a Markov renewal approach to analyze the behavior of TCP Reno, which incorporates an accurate and realistic modelling of the fast-recovery process. Through analysis, we find that the optimum maximum congestion window is 6 packets for a multi-hop chain with any path length.

Keywords

Markov processes; access protocols; ad hoc networks; telecommunication congestion control; transport protocols; Markov renewal approach; TCP Reno; ad hoc networks; multihop chain; optimum maximum congestion window; Ad hoc networks; Aerospace engineering; Bandwidth; Communications Society; Computer networks; Media Access Protocol; Propagation delay; Spread spectrum communication; Throughput; Wireless communication;

fLanguage

English

Publisher

ieee

Conference_Titel

Wireless Communications and Networking Conference, 2007.WCNC 2007. IEEE

Conference_Location

Kowloon

ISSN

1525-3511

Print_ISBN

1-4244-0658-7

Electronic_ISBN

1525-3511

Type

conf

DOI

10.1109/WCNC.2007.663

Filename

4224908