In mobile ad hoc networks, there is no centralized infrastructure to monitor or allocate the resources used by the mobile nodes. The absence of any central coordinator makes the routing a complex one compared to cellular networks. The Ad hoc On Demand Distance Vector (AODV) routing algorithm is a routing protocol designed for ad hoc mobile devices. AODV uses an on demand approach for finding routes. AODV and most of the on demand ad hoc routing protocols use single route reply along the reverse path. Due to rapid changes of topology the route reply may not arrive to the source node resulting in sending several route request messages and degrading the performance of the routing protocol. The extended AODV called Reverse Ad Hoc On Demand Vector (R-AODV) protocol uses a reverse route discovery mechanism and performs well when link breakage is frequent. In this paper we compare the QoS parameters such as Throughput, Delay and Packet Delivery ratio of both traditional AODV and R-AODV using TCP New Reno as the traffic source. Simulation results show that R-AODV performs well when link breakage is frequent.