Abstract: In Mobile Ad hoc Networks (MANETs), the task of routing is distributed among network nodes which act as both end points and routers in a wireless multi-hop network environment. Broadcasting is an essential operation in MANETs routing protocol where each node operationis based on route discovery. The AODV protocol with a route discovery method based on Adaptive Threshold Counting Method. The performance of the AODV routing protocol is analysed fewer than 3 broadcasting schemes AODV with flooding, AODV with counting, AODV with adaptive counting. To discover a route to a specific destination node, existing on-demand routing protocols employ a broadcast scheme referred to as simple flooding whereby a Route Request Packet (RREQ) originating from a source node is blindly disseminated to the rest of the network nodes. This can lead to excessive redundant retransmissions, causing high channel contention and packet collisions in the network, a phenomenon called a broadcast storm. A number of Route Discovery algorithms have been suggested over the past few years based on, for example, location, zoning or clustering. This research argues that such requirements can be largely alleviated without sacrificing performance gains through the use of Probabilistic Broadcast Methods where an intermediate node rebroadcasts RREQ packets based on some suitable forwarding probability rather than in the traditional deterministic manner. Although, several Probabilistic Broadcast algorithms have been suggested for MANETs in the past, in an effort to fill this gap, the first part of this study evaluates the performance of the routing protocols are such as Ad hoc on demand Distance Vector (AODV) and Dynamic Source Routing (DSR) augmented with probabilistic route discovery, taking into the parameters such as network density, end to end delay and packet delivery ratio. In most existing Probabilistic Broadcast algorithms including the one used here for preliminary investigations, each forwarding node is allowed to rebroadcast a received packet the performance of the Ad hoc On-demand Distance Vector (AODV) routing protocol with a route discovery mechanism based on Adaptive threshold counting. The performance of the AODV routing protocol is analyzed under three broadcasting mechanisms are AODV with flooding, AODV with counting and AODV with Adaptive threshold counting. Results establish that a noticeable advantage, in most considered metrics can be achieved using adaptive threshold counting with AODV compared to simple counting or traditional flooding. Researchers evaluate the performance of the simulation results show the approach performs better them both AODV flooding and AODV counting.