Now a day’s wireless ad-hoc network is receiving more popularity as compared to wired networks. A wireless ad hoc network is a
decentralized type of wireless network. A Mobile Ad hoc Network can change locations and arrange itself. A Mobile Ad-Hoc Network
(MANET) is self-configuring network of mobile nodes connected by wireless links to form an uninformed topology without the use of
existing transportation. Previous make inquiries in ad hoc networking have generally studied the routing problem in a non-adversarial
setting by considering the trusted atmosphere. In this paper, we investigation the design and performance evaluation of a new efficient on
demand routing protocol for mobile ad-hoc networks. Up till now many routing algorithms have been proposed to find the routing trouble in
mobile ad-hoc networks so it is difficult to evaluate the presentation of different routing protocols qualitatively as there are many point of
view that affect the performance of network. The proposed TAODV (Tactical On Demand Distance Vector Routing Algorithm) algorithm
performs superior for finding routing problems in Mobile Ad Hoc networks. Most of the proposed algorithms use a blind flooding technique
through the route discovery process. This method is unsuccessful and creates excessive routing overhead. To defeat this problem, the forth
put routing protocol uses a query localization technique that importantly reduces the network traffic and raises the performance of network.
The simulation results clearly show that proposed on demand routing protocol is more efficient and resizable than existing ones.