Open Access Open Access  Restricted Access Subscription or Fee Access

Max-Min Fairness for TCP Flow in MANET

A. Suresh, Dr.K. Duraiswamy


High speed satellite networks are emerging fast in the communication domain. Bandwidth Delay Products (BDP) plays an important role in the design of a congestion control algorithm for the effective usage of network resources. Bandwidth delay products (BDPs) are referred as the maximum amount of unacknowledged data that allowed in flight at any moment in the network. TCP is originally designed for a general wired network. In case of BDP, packet losses rarely occur. TCP can no longer guarantee good bandwidth utilization. Solutions proposed to provide reliable packet delivery in MANETs are non TCP variants and TCP variants. Non TCP variants focus on the modification of congestion control algorithms in the transport protocol. It requires complicated mathematical computation and incur excessive network overhead. Although relatively accurate congestion information obtained, it cannot retain the end-to-end semantics of a transport protocol. The work presented in this paper extends the Datagram Transport Protocol over Ad Hoc Networks (DTPA) for efficient adaptable MANETs in the changing network scenario. The extension is carried out by achieving fairness in the TCP flow of the MANET with adaptive Max-Min Fairness algorithm. The extended work incorporates a fixed size window based flow control algorithm and a cumulative bit vector based SACK (selective ACK) strategy. Simulation carried out guarantees reliable transmission and recovering packet losses. It improves the network performance in terms of throughput, round trip time, number of retransmissions, and IP queue size demonstrated by simulation conducted using NS2.


MANET,DTPA,SACK,TCP and Bandwidth Delay Products (BDP)

Full Text:



M. Mathis, J. Mahdavi, S. Floyd, and A. Romanow, TCP Selective Acknowledgement Options, IETF RFC 2018, 1996.

R. Kettimuthu and W. Allcock, “Improved Selective Acknowledgment Scheme for TCP,” Proc. Int’l Conf. Internet Computing (IC ’04), pp. 913-919, 2004a

H.-S. Wilson So, Y. Xia, and J. Walrand, “A Robust Acknowledgement Scheme for Unreliable Flows,” Proc. IEEE INFOCOM ’02, vol. 3, pp. 1500-1509, 2002

G. Anastasi, E. Ancillotti, M. Conti, and A. Passarella, “TPA: A Transport Protocol for Ad Hoc Networks,” Proc. 10th IEEE Symp. Computers and Comm. (ISCC ’05), pp. 51-56, 2005.

K. Chen, K. Nahrstedt, and N. Vaidya, “The Utility of Explicit Rate-Based Flow Control in Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC ’04), no. 1, pp. 1904-1909, 2004

H. Zhai, X. Chen, and Y. Fang, “Rate-Based Transport Control for Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm And Networking Conf. (WCNC ’05), pp. 2264-2269, 2005

K. Sundaresan, V. Anantharaman, H.-Y. Hsieh, and R. Sivakumar, “ATP: A Reliable Transport Protocol for Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 4, no. 6, pp. 588-603, Nov. 2005.

Z. Fu, B. Greenstein, X. Meng, and S. Lu, “Design and Implementation of a TCP-Friendly Transport Protocol for Ad Hoc Networks,” Proc. 10th IEEE Int’l Conf. Network Protocols (ICNP ’02), pp. 216-225, 2002

S. EIRakabawy, A. Klemm, and C. Lindemann, “TCP with Adaptive Pacing for Multihop Wireless Networks,” Proc. ACM MobiHoc ’05, pp. 288-299, 2005

A. Singh and K. Kankipati, “TCP-ADA: TCP with Adaptive Delayed Acknowledgement for Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC ’04), no. 1, pp. 1679-1684, 2004.

R. Oliveira and T. Braun, “A Dynamic Adaptive Acknowledgment Strategy for TCP over Multihop Wireless Networks,” Proc. IEEE INFOCOM ’05, pp 1863-1874, 2005

K. Chen, Y. Xue, and K. Nahrstedt, “On Setting TCP’s Congestion indow Limit in Mobile Ad Hoc Networks,” J. Wireless Comm. and Mobile Computing, vol. 2, no. 1, pp. 85-100, 2002.


  • There are currently no refbacks.

Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.