The Ad-Hoc on demand distance vector (AODV) routing protocol to be used by mobile nodes in an ad hoc network. It offers fast adaptation to dynamic link conditions, low process and memory overhead, low network utilization and determines unicast routes destinations inside the ad hoc network. It uses destination sequence numbers to confirm loop freedom in any respect of times (even within the face of abnormal delivery of routing management messages), avoiding issues (such as "continuity to infinity") related to classical distance vector protocols. Ad-Hoc networking could be a thought in pc communications characterized by property through a set of wireless nodes and fast changing network topology. In a wireless scenario, nodes are free to move hence maintaining path (route) is a difficult task. Routing protocols have central role in a wireless scenario. We have analyzed AODV protocol by extensive simulations in ns-2 simulator with various performance matrices such as Throughput, Number of packets sent, Number of packets received, Packets delivery ratio, Control overhead, Packet dropping ratio, Delay, Normalized routing overhead under wireless scenarios varying speed. And with this we are also trying to detect the Black Hole Attack in AODV.