The paper introduces Ad-hoc On-Demand Distance Vector Routing (AODV), a novel algorithm for ad-hoc networks, which are formed by a collection of mobile nodes without centralized infrastructure. AODV is designed to be efficient and responsive, minimizing the need for periodic routing advertisements, which can significantly reduce bandwidth usage. The algorithm ensures loop-free routes and can quickly repair broken links. It uses symmetric links between neighboring nodes and maintains a monotonically increasing sequence number counter to update stale routes. AODV's path discovery process involves broadcasting route requests (RREQs) and receiving route replies (RREPs), with intermediate nodes retransmitting RREQs if necessary. The algorithm also includes mechanisms for local connectivity management and route table management, ensuring that only active routes are maintained. Simulations demonstrate that AODV can quickly and accurately find routes, with goodput ratios above 98% for 50 nodes and 96% for 100 nodes. The paper discusses future improvements, including multicast support, intermediate node route rebuilding, and the elimination of hello messages. AODV is suitable for applications such as emergency services, conferencing, and community-based networking.The paper introduces Ad-hoc On-Demand Distance Vector Routing (AODV), a novel algorithm for ad-hoc networks, which are formed by a collection of mobile nodes without centralized infrastructure. AODV is designed to be efficient and responsive, minimizing the need for periodic routing advertisements, which can significantly reduce bandwidth usage. The algorithm ensures loop-free routes and can quickly repair broken links. It uses symmetric links between neighboring nodes and maintains a monotonically increasing sequence number counter to update stale routes. AODV's path discovery process involves broadcasting route requests (RREQs) and receiving route replies (RREPs), with intermediate nodes retransmitting RREQs if necessary. The algorithm also includes mechanisms for local connectivity management and route table management, ensuring that only active routes are maintained. Simulations demonstrate that AODV can quickly and accurately find routes, with goodput ratios above 98% for 50 nodes and 96% for 100 nodes. The paper discusses future improvements, including multicast support, intermediate node route rebuilding, and the elimination of hello messages. AODV is suitable for applications such as emergency services, conferencing, and community-based networking.