Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks

We investigate the performance issues of destinationsequenced distance vector (DSDV) and ad-hoc on-demand distance vector (AODV) routing protocols for mobile ad hoc networks. Four performance metrics are measured by varying the maximum speed of mobile hosts, the number of connections, and the network size. The correlation between network topology change and mobility is investigated by using linear regression analysis. The simulation results indicate that AODV outperforms DSDV in less stressful situations, while DSDV is more scalable with respect to the network size. It is observed that network congestion is the dominant reason for packet drop for both protocols. We propose a new routing protocol, congestion-aware distance vector (CADV), to address the congestion issues. CADV outperforms AODV in delivery ratio by about 5%, while introduces less protocol load. The result demonstrates that integrating congestion avoidance mechanisms with proactive routing protocols is a promising way to ...

• Type: Conference
• Year: 2003
• Where: PERCOM
• Authors: Yi Lu, Weichao Wang, Yuhui Zhong, Bharat K. Bhargava
• Keywords: Distance Vector, Network Size, PERCOM 2003, Routing Protocols, Wireless Networks