Comparative Performance Analysis of AODV and AODV-MIMC Routing Protocols for Mobile Ad hoc Networks

Abstract

Bandwidth Scarcity is a major drawback in multi-hop ad hoc networks. When a single-interface single-channel (SISC) approach is used for both incoming and outgoing traffic the bandwidth contention between nodes along the path has occurred as well as throughput is degraded. This drawback is overwhelmed by using MIMC approach as well as some of the Quality of Service (QoS) requirements has been enhanced. In this paper we applied multi-interface muti-channel approach to AODV routing protocol, called AODV-MIMC routing protocol and its performance is compared with AODV routing protocol. The simulation results show the Network Life Time, Throughput, and Packet Delivery Ratio of AODV-MIMC routing protocol has been tremendously improved than the AODV routing protocol.

Performance Evaluation of AODV, DSDV, OLSR Routing Protocols using NS-3 Simulator

“…In [8] comparing AODV and OLSR routing protocols .In [12] evaluation parameter's for deferent network size are control overhead, packet delivery ratio, end to end delay are throughput at different pause time are discussed. In [13] different routing protocols are classified which are based on their reactive, proactive and hybrid nature.In [17] comparing the AODV MIMC & AODV with simulation results.…”

Performance Analysis of Routing Protocol in Mobile Ad-Hoc Networks

“…In contrast, reactive routing protocols [3][4][5] create routes only when needed by the source node, utilizing network bandwidth more effectively. Examples of reactive (ondemand) ad hoc network routing protocols include Ad Hoc On-Demand Distance Vector (AODV), Temporally Ordered Routing Algorithm (TORA), and Dynamic Source Routing (DSR) [6][7][8].…”

“…Each node in the network maintains a routing table that contains information about available routes. When a node needs to communicate with another node, it broadcasts a route request (RREQ) [7] packet that includes the source and destination node addresses and a unique sequence number. Upon receiving an RREQ packet, a node checks its routing table to see if it has a route to the destination node.…”

“…This process continues until the destination node is found or the maximum hop count is reached. Each node caches the route information and sends a route reply (RREP) [7]packet back to the source node along the same path as the RREQ packet. As each node receives the RREP packet, it updates its routing table with the new route information.…”