Performance Comparative Study of DSDV, E-DSDV, I-DSDV and O-DSDV MANET Routing Protocols

A Mobile Ad-hoc Network (MANET) is a dynamic single or multi-hop wireless network where nodes are connected wirelessly, and the network is self-configured. Due to the high mobility of nodes, network topology changes more frequently and thus, routing becomes a challenging task. Several routing protocols have been proposed by the researchers for MANETs like the well-known Destination Sequenced Distance Vector (DSDV) and its variants. It is a table-driven routing protocol that was mainly proposed to solve routing loop problems and it performs very well in sparse and low mobility environments. However, it suffers from several performance issues when implemented on high and dense MANETs. A number of modifications of DSDV have been proposed to make it more adaptive and suitable for different environments. In this paper, the performance of DSDV, E-DSDV, I-DSDV, and O-DSDV routing protocols is compared. The performance metrics that were considered in this analysis are packet delivery ratio, throughput, End-to-End delay, and routing overhead. Several simulation scenarios were carried out using the Network Simulator tool (NS3) by varying the number of nodes, pause time and velocity. The simulation results have shown that I-DSDV outperforms the others in low mobility scenarios, whereas O-DSDV has the best performance in high velocity environments

DSDV Extension to Enhance the Performance of Ad Hoc Networks in High Diverse-Velocity Environments

Mobile Ad-Hoc Networks (MANETs) are characterized as decentralized control networks. The mobile nodes route and forward data based on their routing information without the need for routing devices. In this type of networks, nodes move in an unstructured environment where some nodes are still fixed, others are moving in a constant velocity, and others move with diverse velocities; and thus, they need special protocols to keep track of network changes and velocity changes among the nodes. Destination Sequenced Distance- Vector (DSDV) routing protocol is one of the most popular proactive routing protocols for wireless networks. This protocol has a good performance in general, but with high speed nodes and congested networks its performance degrades quickly. In this paper we propose an extension to the DSDV (we call it Diverse- Velocity DSDV) to address this problem. The main idea is to modify the protocol to include node speed, determine update intervals and the duration of settling time. To evaluate the performance of the new protocol, we have carried a number of simulation scenarios using the Network Simulator tool (NS-3) and measured relevant parameters such as: packet delivery ratio, throughput, end-toend delay, and routing overhead. We have compared our results with the original DSDV and some of its new variants. The new protocol has demonstrated a noticeable improvement of performance in all scenarios, and the measured performance metrics outperform the others except the average delay where the performance of the new protocol was modest.The authors would like to express their highest gratitude to AL-Quds University for the funding of this research

The design and performance evaluation of a proactive multipath routing protocol for mobile ad hoc networks

Due to unpredictable network topology changes, routing in Mobile Ad Hoc Networks (MANET) is an important and challenging research area. The routing protocol should detect and maintain a good route(s) between source and destination nodes in these dynamic networks. Many routing protocols have been proposed for mobile ad hoc networks, and none can be considered as the best under all conditions. This thesis presents the design and implementation of a new proactive multipath MANET routing protocol. The protocol, named Multipath Destination Sequenced Distance Vector (MDSDV), is based on the well known single path Destination Sequenced Distance Vector (DSDV). We show that the protocol finds node-disjoint paths, i.e., paths which do not have any nodes in common, except for the source and the destination. The thesis presents a systematic evaluation of MDSDV in comparison with three well known protocols: one proactive (DSDV), and two reactive (AODV) and (DSR). MDSDV behaves very well in terms of its packet delivery fraction and data dropped in both static and dynamic networks. It delivers nearly 100% of data in dense networks (networks with more than 20 nodes). The speed of the nodes and the number of sources have a low impact on its performance