2009European journal of scientific researchRequires access

Performance comparison of AODV, DSDV and I-DSDV routing protocols in mobile ad hoc networks.

Abdul Hadi Abd Rahman, Zuriati Ahmad Zukarnain

Open publisher page 158 citations

Abstract

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. To improve the packet delivery ratio of Destination Sequenced Distance Vector (DSDV) routing protocol in mobile ad hoc networks with high mobility, a message exchange scheme for its invalid route reconstruction is being used. Three protocols AODV, DSDV and I-DSDV were simulated using NS-2 package and were compared in terms of packet delivery ratio, end to end delay and routing overhead in different environment; varying number of nodes, speed and pause time. Simulation results show that I-DSDV compared with DSDV, it reduces the number of dropped data packets with little increased overhead at higher rates of node mobility but still can’t compete with AODV in higher node speed and number of node.

About this research paper

What this paper is about

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. To improve the packet delivery ratio of Destination Sequenced Distance Vector (DSDV) routing protocol in mobile ad hoc networks with high mobility, a message exchange scheme for its invalid route reconstruction is being used. Three protocols AODV, DSDV and I-DSDV were simulated using NS-2 package and were compared in terms of packet delivery ratio, end to end delay and routing overhead in different environment; varying number of nodes, speed and pause time. Simulation results show that I-DSDV compared with DSDV, it reduces the number of dropped data packets with little increased overhead at higher rates of node mobility but still can’t compete with AODV in higher node speed and number of node.

Why it matters

OpenAlex reports 158 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

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. To improve the packet delivery ratio of Destination Sequenced Distance Vector (DSDV) routing protocol in mobile ad hoc networks with high mobility, a message exchange scheme for its invalid route reconstruction is being used. Three protocols AODV, DSDV and I-DSDV were simulated using NS-2 package and were compared in terms of packet delivery ratio, end to end delay and routing overhead in different environment; varying number of nodes, speed and pause time. Simulation results show that I-DSDV compared with DSDV, it reduces the number of dropped data packets with little increased overhead at higher rates of node mobility but still can’t compete with AODV in higher node speed and number of node.

Key concepts: Destination-Sequenced Distance Vector routing, Computer network, Ad hoc On-Demand Distance Vector Routing, Optimized Link State Routing Protocol, Computer science, Distance-vector routing protocol, Dynamic Source Routing, Wireless Routing Protocol

Related papers

Back to paper searchBrowse research topicsOriginal source
Performance comparison of AODV, DSDV and I-DSDV routing protocols in mobile ad hoc networks. — Research Paper | ScholarLens