An improved transport algorithm over DCCP in wireless ad hoc networks

Datagram Congestion Control Protocol (DCCP) is a transport protocol fits for real-time multimedia applications by processing congestion control and unreliable transmission. DCCP takes on a good performance in wired network while causes a substantial decline in wireless networks. This paper analyzes DCCP CCID-3 in wireless ad hoc networks and mainly focuses on two factors that impact the protocol performance of throughput, loss event rate and RTT. With these, the paper proposes an improved transport algorithm based on CCID-3. First, we use the ACK arrival rate to detect the loss event and assign the loss of ACK computational weight. Second, we improve the calculation of RTT by replacing the value estimated in transport layer with the theoretical computed value. We evaluate our proposal in NS-2, and the simulation results show that compared with standard CCID-3, our proposal can enhance the performance of throughput both in static chain topology and in random moving scenario.