Artificial Intelligence Based A* Optimization Routing in Mobile Ad Hoc Networks
Gondi Yasoda Devi1, Gurrala Venkateswara Rao2

1Gondi Yasoda Devi*, Research Scholar, Department of CSE GIT, GITAM Deemed to be University, Visakhapatnam, India.
2Dr. Gurrala Venkateswara Rao, Department of CSE, GIT, GITAM Deemed to be University, Visakhapatnam, India.
Manuscript received on November 26, 2019. | Revised Manuscript received on December 15, 2019. | Manuscript published on December 30, 2019. | PP: 1553-1560 | Volume-9 Issue-2, December, 2019. | Retrieval Number:  B3721129219/2020©BEIESP | DOI: 10.35940/ijeat.B3721.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: A Mobile Ad Hoc Network (MANET) is a hotchpotch of nodes with mobility feature, the established network utilization is dynamically outlined based on temporary architecture. In MANETs, the challenging and vital role is played by the routing protocols performance factors under different condition and environments. The routing protocols are liable to handle many nodes with limited resources. There exits many routing protocols in MANETs, one of the main key note that has to be considered in designing a routing protocol is to observe that the designed routing protocol is having an proportionate effect on network performance. The existence of obstacles may lead to many geographical routing problems like excess consumption of power and congestion of data. The aim of this paper is to take the assistance of A* algorithm that finds the walk-able path avoiding the concave obstacle in the path relaying on the gaming-theory model[29]. This algorithm decreases the delays in packet transmission and in turn increases the success rate of transmission. We take into consideration path length, penalty for node availability as probability of forwarding criteria and processes effective packet transmission. The simulated results analyse the performance of our protocol over other conventional algorithms based on congestion cost, path length, node availability penalty, delay, packet loss, throughput.
Keywords:  MANETS, A*, Penalty of Node Availability, Path Length, Heuristic.