Study and implementation of Ad-hoc ROUTING PROTOCOLS

Ad-hoc networks are characterized by a lack of infrastructure, and by a random and quickly changing network topology; thus the need for a robust dynamic routing protocol that can accommodate such an environment. Consequently, many routing algorithms have come in to existence to satisfy the needs of communications in such networks. This project work presents a performance comparison between two categories of routing protocols, table-driven (Proactive) and on-demand (Reactive) routing protocols, this two categories were illustrated by using two different examples of routing protocols, first example is DSDV (Destination Sequenced Distance-Vector) from the Proactive family and the second example is AODV (Ad Hoc On-Demand Distance Vector) from the Reactive family. Both protocols were simulated by using NS-2 (network simulator-2) package. Both routing protocols were compared in terms of average throughput (packets delivery ratio) and packet loss ratio, while varying number of nodes and by using the Trace file. Although DSDV perfectly scales to small networks with low node speeds, AODV is preferred due to its more efficient use of bandwidth.