Comparative analysis of random based mobility models using TCP variant in MANETs

Abstract

In Mobile Ad-hoc Networks (MANETs), mobile node act as router themselves and keeping the route information to reach other mobile nodes and helps to forward data packets from one mobile to another mobile node. The performance of the different mobility models such as Random Walk (RW), Random Waypoint (RWP), Manhattan Mobility (MM), Reference Point Group Mobility (RPGM) are widely analyzed in the environment using NS2.34 software under Linux platform (Fedora). Depending on the type of TCP (Transmission Control Protocol) implementation the behavior was different for each mobility models and it's due to the activation or missing of the following algorithms Slow Start, Congestion Avoidance and Congestion Detection. The performance of TCP flows in an Mobile ad-hoc network is analyzed using four different mobility models with Ad hoc On- Demand Distance Vector (AODV) as the routing protocol and TCP/TCP New Reno as the transport protocol.