Performance Comparison of On-Demand and Table Driven Ad Hoc Routing Protocols Using NCTUns

The main aim of any ad-hoc network routing protocol is to meet the challenges of the dynamically changing topology and establish a correct and an efficient communication path between any two nodes with minimum routing overhead and bandwidth consumption. The design problem of such a routing protocol is not simple since an ad hoc environment introduces new challenges that are not present in fixed networks. A number of routing protocols have been proposed for this purpose like Ad Hoc On Demand Distance Vector (AODV), Dynamic Source Routing (DSR), Destination- Sequenced Distance Vector (DSDV). In this paper, we study and compare the performance of the following three routing protocols AODV, DSR and DSDV. NCTUns 4.0 is used to study the relative performance of the routing protocols according to different criteria. The notable point of our analysis is that, it is based on varying number of nodes in the ad hoc network.