COMPARATIVE ANALYSIS AND STUDY OF DIFFERENT QOS PARAMETERS OF WIRELESS AD-HOC NETWORK
Nalin Gahlaut, Pankaj Kumar, K. R. Mahesh Kumar
Abstract
Nalin Gahlaut, Pankaj Kumar, K. R. Mahesh Kumar
Abstract
A wireless Ad-hoc network is a collection of two or more wireless nodes equipped with wireless communications and networking capability. They communicate with each other without the need of centralized administration, in which all nodes potentially contribute to routing process. In Ad-hoc scenario, any node can move anytime so these types of networks need to have routing protocol with dynamically changing topology. To accomplish this, many protocols have been proposed and developed; these are ad-hoc on-demand distance vector (AODV) routing, Dynamic Source Routing (DSR) and Destination Sequenced Distance Vector (DSDV). In this work, we evaluate the performance of proposed Ad-hoc network model in terms of Control traffic received, Control traffic sent, Data traffic received, Data traffic sent, Throughput and number of retransmission attempts to compare above-mentioned commonly used routing protocols. We analyze the simulation results of three different protocols for wireless ad-hoc networks having thirty nodes. For simulation, we use OPNET (Optimized Network Engineering Tool) simulator, which is a discrete event, object-oriented and general purpose network simulator. In our simulation environment, ad-hoc on-demand distance vector (AODV) routing protocol perform better than other two protocols; Dynamic Source Routing (DSR) and Destination Sequenced Distance Vector (DSDV).
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A wireless Ad-hoc network is a collection of two or more wireless nodes equipped with wireless communications and networking capability. They communicate with each other without the need of centralized administration, in which all nodes potentially contribute to routing process. In Ad-hoc scenario, any node can move anytime so these types of networks need to have routing protocol with dynamically changing topology. To accomplish this, many protocols have been proposed and developed; these are ad-hoc on-demand distance vector (AODV) routing, Dynamic Source Routing (DSR) and Destination Sequenced Distance Vector (DSDV). In this work, we evaluate the performance of proposed Ad-hoc network model in terms of Control traffic received, Control traffic sent, Data traffic received, Data traffic sent, Throughput and number of retransmission attempts to compare above-mentioned commonly used routing protocols. We analyze the simulation results of three different protocols for wireless ad-hoc networks having thirty nodes. For simulation, we use OPNET (Optimized Network Engineering Tool) simulator, which is a discrete event, object-oriented and general purpose network simulator. In our simulation environment, ad-hoc on-demand distance vector (AODV) routing protocol perform better than other two protocols; Dynamic Source Routing (DSR) and Destination Sequenced Distance Vector (DSDV).
Key concepts: Computer network, Computer science, Optimized Link State Routing Protocol, Destination-Sequenced Distance Vector routing, Wireless Routing Protocol, Dynamic Source Routing, Wireless ad hoc network, Ad hoc On-Demand Distance Vector Routing