2004Universiti Putra Malaysia Institutional Repository (Universiti Putra Malaysia)Open access

Analysis and Simulation of Wireless Ad-Hoc Network Routing Protocols

Abdul Haimid Bashir Mohamed

Open full text 4 citations

Abstract

An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Ad-hoc networks, characterized by dynamic topology. Each host moves in an arbitrary manner and routes are subject to frequent disconnection. During the period of route reconstruction, packets can be dropped. The loss of packets will cause significant throughput degradation. A number of routing protocols like Dynamic Source Routing (DSR), Ad Hoc On-Demand Distance Vector Routing (AODV) and Destination-Sequenced Distance-Vector (DSDV. have been implemented. In this project an attempt has been made using network simulator (NS) to compare the performance of two on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol, using more stressful parameters, such as a very high mobility, large number of nodes and with a very heavy traffic loads.The simulation results show that at a small to medium field area with a considerably large number of nodes, the tabledriven DSDV protocol performs better than the On-demand protocols, AODV and DSR at low mobility.While On-demand protocols, AODV perform very well at all network conditions. While at large field area all the routing protocols performed poorly due to large number of hops that needed for one node to communicate with another and link breakage are likely to happens. Although DSR and AODV share similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials are analyzed using varying network load, mobility, and network size. The simulation results show that On-demand routing protocol AODV and Table-driven routing protocol DSDV can be used for most of ad-hoc applications delivering about 95% of data packets to the destination nodes. These simulations are carried out based on the Rice Monarch Project that has made substantial extensions to the NS-2 network simulator to run ad hoc simulations.

Open-access reader

About this research paper

What this paper is about

An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Ad-hoc networks, characterized by dynamic topology. Each host moves in an arbitrary manner and routes are subject to frequent disconnection. During the period of route reconstruction, packets can be dropped. The loss of packets will cause significant throughput degradation. A number of routing protocols like Dynamic Source Routing (DSR), Ad Hoc On-Demand Distance Vector Routing (AODV) and Destination-Sequenced Distance-Vector (DSDV. have been implemented. In this project an attempt has been made using network simulator (NS) to compare the performance of two on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol, using more stressful parameters, such as a very high mobility, large number of nodes and with a very heavy traffic loads.The simulation results show that at a small to medium field area with a considerably large number of nodes, the tabledriven DSDV protocol performs better than the On-demand protocols, AODV and DSR at low mobility.While On-demand protocols, AODV perform very well at all network conditions. While at large field area all the routing protocols performed poorly due to large number of hops that needed for one node to communicate with another and link breakage are likely to happens. Although DSR and AODV share similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials are analyzed using varying network load, mobility, and network size. The simulation results show that On-demand routing protocol AODV and Table-driven routing protocol DSDV can be used for most of ad-hoc applications delivering about 95% of data packets to the destination nodes. These simulations are carried out based on the Rice Monarch Project that has made substantial extensions to the NS-2 network simulator to run ad hoc simulations.

Why it matters

OpenAlex reports 4 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

An ad hoc network is a collection of wireless mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralized administration. Ad-hoc networks, characterized by dynamic topology. Each host moves in an arbitrary manner and routes are subject to frequent disconnection. During the period of route reconstruction, packets can be dropped. The loss of packets will cause significant throughput degradation. A number of routing protocols like Dynamic Source Routing (DSR), Ad Hoc On-Demand Distance Vector Routing (AODV) and Destination-Sequenced Distance-Vector (DSDV. have been implemented. In this project an attempt has been made using network simulator (NS) to compare the performance of two on-demand reactive routing protocols for mobile ad hoc networks: DSR and AODV, along with the traditional proactive DSDV protocol, using more stressful parameters, such as a very high mobility, large number of nodes and with a very heavy traffic loads.The simulation results show that at a small to medium field area with a considerably large number of nodes, the tabledriven DSDV protocol performs better than the On-demand protocols, AODV and DSR at low mobility.While On-demand protocols, AODV perform very well at all network conditions. While at large field area all the routing protocols performed poorly due to large number of hops that needed for one node to communicate with another and link breakage are likely to happens. Although DSR and AODV share similar on-demand behavior, the differences in the protocol mechanics can lead to significant performance differentials. The performance differentials are analyzed using varying network load, mobility, and network size. The simulation results show that On-demand routing protocol AODV and Table-driven routing protocol DSDV can be used for most of ad-hoc applications delivering about 95% of data packets to the destination nodes. These simulations are carried out based on the Rice Monarch Project that has made substantial extensions to the NS-2 network simulator to run ad hoc simulations.

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

Related papers

Back to paper searchBrowse research topicsOriginal source
Analysis and Simulation of Wireless Ad-Hoc Network Routing Protocols — Research Paper | ScholarLens