Performance Analysis of Ad-Hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR) Routing Protocols During Data Broadcast Storm Problem in Wireless Ad Hoc Network

Abstract

Ad Hoc networks consist of a group of free nodes that can communicate with each other without the need for a base station or access point to exchange information. In communicating between nodes, Ad Hoc networks require a routing protocol that is tasked with finding routes from the source to the recipient. When active nodes in the network try to communicate simultaneously, for example in the condition of broadcast storm data, the routing protocol finds the address of the receiving node from each sending node simultaneously. In this condition, the network is filled with packets of data sent by active nodes while trying to find the destination node for sending messages. The same thing happens when active nodes try to send repeated messages simultaneously. These nodes can flood the network so that it reduces the network's performance. In this paper, we investigated the performance of AODV and DSR routing protocols when experiencing the data broadcast storm problem. The simulation results indicate that the AODV routing protocol performance was better than DSR in terms of throughput and delay in the process of sending data. Meanwhile, both routing protocols show nearly similar values in each simulation scenario in packet loss analysis.