A simple delayed acknowledgement scheme

The general TCP protocol doesn´t show good performance in ad hoc network due to nodes mobility and higher vulnerability of the wireless link. This paper proposes a simple end to end approach; in this the hop count of the path and the size of delayed window at receiver end is utilize and also the of CWL with the RTT variation to control the size of the bursts. As the number of hop increases chance of congestion increases, the congestion is not affected by number of links only but by the length of links as the length increases the environmental effects also increases. The simulation result shows 10 to 15 % improvement in TCP performance over the TCPDCA.