DTPA: A Reliable Datagram Transport Protocol over Ad Hoc Networks

摘要

As a prevalent reliable transport protocol in the Internet, TCP uses two key functions: AIMD (Additive Increase Multiplicative Decrease) congestion control and cumulative ACK technique to guarantee delivery. However, with these two functions, TCP becomes lowly efficient in ad hoc networks that have a much lower BDP and frequent packet losses due to various reasons, since TCP adjusts its transmission window based on packet losses. In this paper, we present that, provided that the BDP is very small, any AIMD-style congestion control is costly and hence not necessary for ad hoc networks. On the contrary, a technique to guarantee reliable transmission and to recover packet losses plays a more critical role in the design of a transport protocol over ad hoc networks. With this basis, we propose a novel and effective datagram-oriented end-to-end reliable transport protocol for ad hoc networks, which we call DTPA. The proposed scheme incorporates a fixed-size window based flow control and a cumulative bit-vector based selective ACK strategy. A mathematical model is developed to evaluate the performance of DTPA and to determine the optimum transmission window used in DTPA. The protocol is verified using GloMoSim. The simulation results show that our proposal substantially improves the network performance.