Improving Throughput of Starved TCP Flow by Sidestepping Bottleneck Nodes Using Concurrent Transmission

E-ISSN： 1937-9404|2|1|68-83

ISSN： 1937-9412

Source： International Journal of Mobile Computing and Multimedia Communications (IJMCMC), Vol.2, Iss.1, 2010-01, pp. : 68-83

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

The TCP congestion control mechanism along with unfairness problem poses poor performance when IEEE 802.11 MAC protocol is used in multi-hop ad hoc networks because the traditional TCP has poor interaction with the IEEE 802.11 MAC protocol. Because of the greedy nature of TCP, starvation problem of TCP flows with longer paths is severe. In this paper, we first illustrate that the fairness, congestion control and medium contention are closely coupled issues and the spatial reuse of the channel can improve the performance of wireless ad hoc network. By using concurrent transmission protocol at the MAC layer, like CTMAC, in multi-hop networks we can achieve simultaneous transmissions within the interference regions. Further, we illustrate with extensive simulations in ns-2 that by scheduling multiple concurrent transmissions along the path links, the starvation problem due to greedy nature of TCP can be eliminated and ensuing higher flow throughput and lower end-to-end delay.