Experimental Analysis of Distributed Routing Algorithms in Ad Hoc Mobile Networks

Wireless networks can be classified in two types: infrastructured wireless networks and infrastructureless (ad hoc) wireless networks. Ad hoc networks are characterized by the need for efficient routing protocols. According to previous research, the Destination-Sequenced Distance-Vector (DSDV) routing protocol and the Ad Hoc On-Demand Distance Vector (AODV) routing protocol are two good representatives for each routing protocol category, Table-Driven category and On Demand category respectively. This paper analyses via simulation their performance with respect to the pause time of nodes movement. We find which routing protocol is appropriate for certain network conditions. When the nodes move continually then AODV seems to be better than DSDV. When nodes stay unmoving for a long time then DSDV is preferable.