Progressive AODV: A Routing Algorithm Intended for Mobile Ad-Hoc Networks
M. Sakthivel1, J. Udaykumar2, V. Saravana Kumar3

1M. Sakthivel, (Correspondence Author) Department of CSE, Sree Vidyanikethan Engineering College, Tirupati (A.P), India.
2J. Udaykumar, Department of CSE, Sree Vidyanikethan Engineering College, Tirupati (A.P), India.
3V. Saravana Kumar, Department of IT, Sreenidhi Institute of Science and Technology, Hyderabad, Telangana, India,
Manuscript received on December 01, 2019. | Revised Manuscript received on December 08, 2019. | Manuscript published on December 30, 2019. | PP: 70-74 | Volume-9 Issue-2, December, 2019. | Retrieval Number:  B3359129219/2019©BEIESP | DOI: 10.35940/ijeat.B3359.129219
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (

Abstract: Mobile ad hoc networks are an independent wireless network that is built without permanent infrastructure and base station support. Each node in the network uses a wireless connection for connections and acts not only as an end system but also as a path to accelerating packets. Meanwhile, the network nodes are mobile and can move in each path with changing steps, creating a great dynamic of the network. Therefore, the protocols set for general ad hoc networks are inappropriate for such a situation. In addition, the performance of ad hoc routing protocols decreases with increasing network size. In this context, suggest a new way to extend the recital of routing in MANETs: the on-demand Progressive Distance Vector (PAODV). It is a modified variant of the standard AODV routing protocol, which shrinks the dynamic path when an optimal path exists and switches the traffic to it. Simulation studies with NS2 show that the proposed method improves network performance as network size, weight, or flexibility increase.
Keywords: MANETs, AODV, Routing protocols.