Int. J. Advanced Networking and Applications Volume: 07 Issue: 04 Pages: 2835-2848 (2016) ISSN: 0975-0290 2835 Location and Mobility Optimized On-demand Geographical Multipath Routing Protocol for MANET M. Kokilamani 1 Research scholar, Department of Computer science, Government Arts College, Udumalpet-642126. Tamil Nadu, India. Email:kokilam.udt@gmail.com Dr. E. Karthikeyan 2 Head & Assistant Professor, Department of Computer Science, Government Arts College, Udumalpet-642126. Tamil Nadu, India. Email:e_karthi@yahoo.com ----------------------------------------------------------------------ABSTRACT------------------------------------------------------------ The advancement of science and technology had made mobile ad hoc network an important tool to access network of next generation. Recently, numerous multipath routing protocols for mobile ad hoc network are reported in literature. Each routing methods works based on their salient feature, but failed to control congestion, energy efficiency, overhead packets, signal stability during data transmission which leads to edge effect, signal decay and bottleneck situation of the bandwidth consumption. In this paper a novel approach havely Geographical Distance based Ad Hoc On-demand Distance Vector Routing (GD-AOMDV), which selects the path based on transmission distance value to limit and control the congestion and control overheads has been proposed. The salient feature of the proposed model is that it establishes a relationship between path distance and MANET design parameters including transmission range, consumption of energy and bandwidth. The accuracy of the proposed scheme is analyzed and validated with the experimental results in respect to various flow using NS2 simulations. -------------------------------------------------------------------------------------------------------------------------------------------------- Date of Submission: Jan 25, 2016 Date of Acceptance: Feb 18, 2016 -------------------------------------------------------------------------------------------------------------------------------------------------- I. Introduction: Recent advances in wireless communication technology pave way to significant attention to wireless ad hoc and mobile networks. The unstable nature of wireless communication and the lack of pre-defined infrastructure, the routing protocols for Mobile Ad-hoc Network (MANET)[1] [2] is a challenging issue. Dynamicity results in additional energy expenditure, increase in node failure affects the connectivity and network lifetime. Numerous routing protocols have been proposed to satisfy the demands of particular networks and real applications. These protocols have been designed for MANET to support various aspects such as purpose, energy constraints, network lifetime, degree of mobility, scalability, link reliability, node prediction, identification, cross layer design, communication, fault tolerance and maintenance needs. To design an efficient routing protocol by considering more factors implies high processing time, power consumption, overheads, congestion and latency in computing the route. In general routing protocols are classified such as proactive, reactive, hybrid and geographic based routing etc. Pro-active routing is achieved by creating list or tables with destinations and possible paths towards the destinations. Periodically, these lists are distributed to nodes in the entire network, updating the link states. Through this mechanism, proactive routing creates a lot of traffic, and consumes excess bandwidth and a lot of power. Delay can also occur because of the slow network reaction to node mobility. Reactive routing can be a lower cost option than proactive because it does not use periodic broadcasts and initiates route discovery only when a message has to be sent, thus traffic decreases and overhead is reduced. However, using blind broadcasts (flooding and Route Request) results in energy expenditure and high latency. Scalability issues and network clogging can appear because of flooding. Hybrid techniques of routing are designed to combine the advantages in both reactive and proactive, but in general their scalability can be a problem. Geographic routing [3] represents the algorithmic process of determining the paths in which to send traffic in a network, using position information/geographic location only about source, neighbors and destination. It is considered substantially better from an energetic point of view due to the use of solely local information in the routing process. As a result of this very little routing information being needed, no energy is spent on route discovery, queries or replies, node memory requirements are decreased and traffic overhead and computation time are considerably reduced. Also, in this sense it is different from source routing in which the sender makes some or all the routing decisions by having mapped the network and specifying in the packet header the hops that the