In a mobile ad-hoc network (MANET), mobile devices move dynamically in network topologies. A major challenge in the design of MANET is the development of dynamic routing protocols that can efficiently find routes between two communicating nodes. The ad-hoc on-demand distance vector (AODV) routing protocol select its route from source to destination according to the minimum number of hops to reach the destination node without considering response time to achieve communication among all nodes in the network topology. AODV maintains a maximum of only one path to a destination. With rapidly changing topologies and a large number of nodes, the time to update a routing table is a critical issue. Moreover, when a source node sends several route request messages to a destination node it obtains a response with several paths via intermediate nodes. Thus, paths have different numbers of hops and response times. Therefore, to select the best path, an alternative path of the original AODV that has a short response time is preferable. In this paper, we proposed the time response ad-hoc on-demand distance vector (TR-AODV) routing protocol in which each node is dependent on its neighbors. TR-AODV selects the path and sends a response within a short time even with large numbers of hops in the routing table. This proposed protocol improves the performance of regular AODV and meets quality of service (QoS) requirements for route selection. As a result, the proposed TR-AODV improved the performance of AODV in terms of QoS metrics such as throughput, end-to-end delay, and packet drop rate.

mobile ad-hoc network, ad-hoc on-demand routing protocol, path selection, response time, quality of service.