An Analysis of Efficient Model for Geographic Routing in Mobile Adhoc Networks

Abstract

In recent trends of MANET geographic routing has grow to be one of the best routing strategies mainly because of its scalability. It does not need to maintain routes explicitly. Greedy forwarding is the principal approach of geographic routing. This could be solved by any coordinate based routing algorithm or protocol. In recent years the emerging strategy namely game theory is to be impulse to solve the issue of finding the best adaptive strategy via geographic routing and fixing the optimal neighbor which includes the concept of periodic beaconing and has a outline of promising network metrics like packet delivery ratio, eliminating error rates, progressive throughput and reducing routing overhead. In this paper discusses the overview of Geographic Routings in MANET.