Analysis of TCP-Reno and TCP-Vegas over AOMDV routing protocol for mobile ad hoc network

A mobile ad hoc network eliminates the complexity of infrastructure configuration and allows wireless devices to communicate with each other on the fly. It does not rely on a base station to coordinate the flow of messages in the network. A primary challenge is to provide each device to maintain the information to properly route traffics using a routing protocol and conveying data packets efficiently using a transport protocol. Many routing protocols and transport protocols are currently being developed to handle the wireless environment efficiently. In this paper, we investigate the performance differences of TCP-Reno and TCP-Vegas utilizing an AOMDV routing protocol. Although TCP-Vegas provides a better throughput than TCP-Reno in a static environment, it suffers performance degradation in a mobile environment, where packet loss rate, throughput, normalized routing load and average delay are measured as performance metrics, as well as discussed by describing strengths and weaknesses of TCP-Reno and TCP-Vegas.

[1]  David A. Maltz,et al.  The Dynamic Source Routing Protocol (DSR) for Mobile Ad Hoc Networks for IPv4 , 2007, RFC.

[2]  Bogdan M. Wilamowski,et al.  Transmission Control Protocol (TCP) , 2021, RFC.

[3]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[4]  Yongtae Shin,et al.  Hierarchical Clustering Algorithm Based on Mobility in Mobile Ad Hoc Networks , 2006, ICCSA.

[5]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[6]  Zhen Liu,et al.  Evaluation of TCP Vegas: emulation and experiment , 1995, SIGCOMM '95.

[7]  Mahesh K. Marina,et al.  On-demand multipath distance vector routing in ad hoc networks , 2001, Proceedings Ninth International Conference on Network Protocols. ICNP 2001.

[8]  Vern Paxson,et al.  TCP Congestion Control , 1999, RFC.

[9]  Sally Floyd,et al.  Simulation-based comparisons of Tahoe, Reno and SACK TCP , 1996, CCRV.

[10]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[11]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[12]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[13]  Mazliza Othman,et al.  Analysis of single-path and multi-path AODVs over Manhattan Grid mobility model for mobile Ad hoc networks , 2010, 2010 International Conference on Electronics and Information Engineering.

[14]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[15]  Ren Wang,et al.  TCP Westwood: congestion window control using bandwidth estimation , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[16]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.