Routing is one of the most challenging tasks in Mobile Ad hoc Networks (MANETs) as the network is resource constrained and dynamic by nature. Ad hoc infrastructure along with node mobility further makes the network more challenging and unstable. Limited radio range communication, dynamic topology makes the routing technique even more fuzzy to find a desired path from source to destination. Many studies provide many different solutions to route the data from source to the destination. Ad hoc On demand distance vector (AODV) routing protocol is one of the most effectual reactive routing protocols to handle the uncertainty of routing path in MANET. In this paper, a Genetic Algorithm based new protocol is proposed to find the forward path from source to destination. But, the same principle of AODV is applied for back word path. Genetic algorithm has been applied to solve many optimization problems in the literature. The proposed protocol uses the potentiality of genetic algorithms to resume a path that consumes minimum energy as well as preserves a shortest routing path from source to destination. The proposed protocol is experimented and proved through NS-2 Simulator. Simulation results show that proposed protocol over performs existing AODV protocol in terms of end to end delay, throughput and lifetime.
CITATION STYLE
Trivedi, V., & Nayak, P. (2019). Modified AODV using genetic algorithm to minimize energy consumption in MANET. International Journal of Innovative Technology and Exploring Engineering, 8(7), 525–530.
Mendeley helps you to discover research relevant for your work.