A Reverse AODV Routing Protocol in Ad Hoc Mobile Networks

Abstract

Abstract. In mobile ad hoc networks, mobile devices wander autonomously for the use of wireless links and dynamically varying network topology. AODV (Ad-hoc on-demand Distance vector routing) is a representative among the most widely studied on-demand ad hoc routing protocols. Previous protocols have shown some shortcomings on performance. AODV and most of the ondemand ad hoc routing protocols use single route reply along reverse path. Rapid change of topology causes that the route reply could not arrive to the source node, i.e. after a source node sends several route request messages, the node obtains a reply message, especially on high speed mobility. This increases both in communication delay and power consumption as well as decrease in packet delivery ratio. To avoid these problems, we propose a reverse AODV which tries multiple route replies. The extended AODV is called reverse AODV (R-AODV), which has a novel aspect compared to other on-demand routing protocols on Ad-hoc Networks: it reduces path fail correction messages and obtains better performance than the AODV and other protocols have. We design the R-AODV protocol and implement simulation models using NS-2. Simulation results show that the reverse AODV provides good experimental results on packet delivery ratio, power consumption and communication delay.

A Simulation Based Performance Evaluation of AODV, R-AODV and PHR-AODV Routing Protocols for Mobile Ad Hoc Networks

“…The Reverse AODV (R-AODV) [6], an optimized AODV routing protocol uses a reverse route discovery methodology in order to avoid RREP packet loss. R-AODV prevents a large number of retransmissions of RREQ packets which in turn reduces the congestion in the network and enhances the delivery ratio [7].…”

“…The R-RREQ packet format is Table1. R-RREQ Message Format [6] Reserved Hop Count Broadcast ID Destination IP address Destination Sequence Number Source IP address Reply Time node starts packet transmission after receiving the first R-RREQ message whereas the RREQ packets are saved for future use. A forward route entry is created if the node RREQ packet is not a source node.…”

“…As a result the source node starts rediscovery process, which in turn increases both consumed energy and communication delay. The Reverse-AODV (R-AODV) [6], broadcasts the route reply packet throughout the network instead of unicasting it. This process generates multiple discovered partial or full disjoint paths at the source node.…”

Performance Evaluation of On Demand Routing Protocols AODV and Modified AODV (R-AODV) in MANETS

“…In this paper we study the performance comparison of the modified AODV (R-AODV) [10] algorithm in which route reply message is multicast to its neighbors resulting in redundant route reply messages instead of unicasting the route reply to its next hop as in the traditional AODV. With this the probability of a successful route discovery is increased as we have repetitious route reply messages in our network.…”

“…The design of extended AODV(R-AODV) also called Reverse AODV and the comparative analysis of AODV with R-AODV using UDP traffic for constant bit rate applications considering scalability is discussed by E.Talipov et al in [10]. In this paper we compare the QoS parameters [7], [9] of both traditional AODV and R-AODV using TCP New Reno as the traffic source.…”