A probabilistic approach to reduce the route establishment overhead in AODV algorithm for manet

Mobile Ad-hoc Networks (MANETS) is a collection of wireless nodes without any infrastructure support. The nodes in MANET can act as either router or source and the control of the network is distributed among nodes. The nodes in MANETS are highly mobile and it maintains dynamic interconnection between those mobile nodes. MANTEs have been considered as isolated stand-alone network. This can turn the dream of networking "at any time and at any where" into reality. The main purpose of this paper is to study the issues in route discovery process in AODV protocol for MANET. Flooding of route request message imposes major concern in route establishment. This paper suggests a new approach to reduce the routing overhead during the route discovery phase. By considering the previous behaviour of the network, the new protocol reduces the unwanted searches during route establishment processComment: International Journal of Distributed and Parallel Systems (IJDPS) Vol.3, No.2, March 201

A cross-layer implementation of Ad hoc On-demand Distance Vector routing (AODV) protocol

Mobile Ad hoc Networks (MANETs) are networks which will form the basis for the ubiquitous data access because of their ease of deployment. Due to the dynamic nature of a MANET, routing is one of the most critical elements of MANET. Routing protocols for MANET can be broadly classified as a proactive routing protocol or a reactive routing protocol. In the proactive routing protocols, mobile nodes periodically exchange routing information among themselves. Hence proactive routing protocols generate high overhead messages in the network. On the other hand, reactive routing protocols work on-demand. Thereby generating less number of overhead messages in the network compared to proactive routing protocols. But reactive routing protocols use a global search mechanism called \u27flooding\u27 during the route discovery process. \u27Flooding\u27 generates a huge number of overhead messages in the network. Those overhead messages affect the performance of reactive routing protocols in term of network throughput. That kind of performance problem is called \u27scaling\u27 problem. Ad hoc On-demand Distance Vector Routing with Cross-Layer Design (AODV-CL) protocol has been proposed to solve this scaling problem. The AODV routing protocol has been modified to implement AODV-CL protocol. AODV-CL protocol reduces \u27flooding\u27 problem of reactive routing protocols by limiting the number of nodes that should participate in route discovery process based on their status in the network and also avoiding congested area of the network. It is shown that AODV-CL protocol reduces overhead messages by 73% and reduces end-to-end delay per packet by 32% compared to regular AODV protocol. I

Improved AODV Routing Protocol to Cope with High Overhead in High Mobility MANETs

Ad-hoc On-demand Distance Vector (AODV) is the most popular routing protocol for mobile ad-hoc networks (MANETs). According to its nature, AODV makes route discovery when there is data to send at source and source doesn’t have route to the specified destination. To discover a route to a destination, AODV floods the network with control messages like RREQ, and RREP which may result in unnecessarily large number of control messages that travel through the network and consume network resources such as bandwidth, and node processing power. This thesis improves AODV protocol by limiting the number of AODV control messages forwarded though the network during the route discovery process. By using Global Positioning System (GPS), each node knows its location and its traveling speed stamped by time. Each source node propagates its location and speed stamped by time to other nodes in the network by adding its location information to the generated RREQ packet and HELLO messages. Each node in the network stores location information of other nodes. We propose two protocols to limit control messages flooding in the Ad-hoc networks. The first proposed protocol which is called AODV-LAR uses alternative request region defined in LAR. It uses location information to estimate the location of the destination and then estimates the rectangular search region. To increase the accuracy of the estimation of the search region, the first proposed protocol takes into account the distance that destination node moves during discovery process by adding tolerance factor to the search region. In the second proposed protocol which is called AODV-Line, the intermediate nodes decide to participate in route discovery process according to their distance from the line connecting the source and destination locations without the need of the information about the destination traveling speed. The route discovery search region is adjusted based on the location information of both source and destination. To reduce the delay of route discovery process, AODV-LAR defines an equation to estimate the initial TTL of the RREQ message. We evaluate the performance of the two proposed protocols using two simulation scenarios. The simulation was done using JIST/SWANS simulator. Different performance metrics were measured including routing overhead, number of RREQ messages, delivery ratio, normalized routing load, and delay. The results were compared to the original AODV routing protocol. The results shows that the two proposed protocols outperform the original AODV, where the results report a valuable reduction of overhead , number of RREQ messages sent through the network, and reduction in delay compared to the original AODV. Results also show that the delivery ratio in the proposed protocols is comparable to the delivery ratio in the original AODV protocol