Open AccessOptimized AODV Routing Algorithm in MANET for Maximizing the Network Lifetime
Author(s) -
Bheemalingeswara Rao,
Dr A.S.N. Chakravarthy
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b3457.078219
Subject(s) - mobile ad hoc network , computer science , ad hoc on demand distance vector routing , particle swarm optimization , cluster analysis , distance vector routing protocol , computer network , network packet , node (physics) , wireless ad hoc network , shortest path problem , throughput , optimized link state routing protocol , routing protocol , distributed computing , algorithm , wireless , engineering , artificial intelligence , graph , telecommunications , structural engineering , theoretical computer science
In present scenario, Mobile Ad-hoc Networks (MANETs) is the emerging research topic in the applications like disaster situations (battle fields, earthquake, etc). The utility of MANET is increased by combining with the internet. The conventional techniques in MANET have a few issues like less infrastructure, standalone networks, and dynamic or complex topology. In order to address these issues, an efficient clustering and channeling algorithm (Hybrid K-means, Particle Swarm Optimization (PSO) based Ad-hoc On-demand Distance Vector (AODV) channeling algorithm) is developed for maximizing the network lifetime. The proposed algorithm finds the optimal cluster head selection for discovering the shortest path among the cluster heads. The Hybrid-K-means-PSO-AODV technique is applied to increase the Network Lifetime (NL), alive nodes, total packet send, throughput, and also to minimizes the dead nodes and energy consumption in a network. In the experimental phase, the proposed approach reduced the emery consumption up to 170 joules related to the existing approaches: PSO-PSO- MANETs and PSO-GSO- MANETs.