TCP DCERL+: Improving congestion control in mobile ad hoc networks

Abstract

With the improvement of wireless access networks, applications have been developed requiring a very high data rate. Random loss due to mobility and channel fluctuations leads to the devolution of the performance of such high data rate networks. Many variants of TCP congestion control algorithms have been proposed to achieve high performance but all fall below the desired throughput. In this paper, we propose a Dynamic TCP Congestion Control Enhancement for Random Loss Plus (DCERL+). This algorithm is a modification of the TCP Reno protocol at the sender end, differentiating between random loss and congestion loss. DCERL+ achieves very high throughput by employing an estimated bottleneck queue length algorithm to control the congestion window adaptively. We evaluate the performance of DCERL+ in terms of throughput, energy, end-to-end delay, and node mobility speed, and compare it with legacy and recent algorithms. We have performed the simulations of DCERL+ in NS3. The simulation results show that the performance of DCERl+ outperforms recent algorithms such as DA-BBR and D-TCP.