19-11-2012, 04:24 PM
Performance Comparison of DSDV, DSR, AODV Protocol with IEEE 802.11 MAC for Chain Topology for Mobile Ad-hoc Network using NS-2
1Performance Comparison.pdf (Size: 484.7 KB / Downloads: 48)
ABSTRACT
An Ad-hoc network is a collection of mobile nodes dynamically forming a temporary network without the use of any existing network infrastructure or centralised administer. Because of limited communication range among mobile nodes in ad-hoc network, several network hopes may be needed to deliver a packet from one node to another node in the wireless network. In recent years, a variety of different routing protocols addressing multi-hop ad-hoc network have been presented and their performance issues are discussed. This paper is subjected to comprehensive analysis among DSR,DSDV,AODV routing protocols of ad-hoc network with IEEE 802.11 Mac protocol in chain topology using Network Simulator-2(NS-2).Various important performance metrics of MANET such as Generated Packet Vs. no. of nodes, Received Packet Vs. no. of nodes, Packet delivery ratio Vs. no. of nodes, Total dropped packets Vs. no. of nodes, Average end to end delay Vs. no. of nodes are investigated to confirm the best routing protocol in the simulation environment.
INTRODUCTION
Ad-hoc wireless network are self creating, self organizing, and self-administrating networks. Ad hoc networks are used where wired network and mobile access is unproductive and not feasible. A fundamental problem in ad hoc networking is how to deliver data packets among MNs efficiently without predetermined topology or centralized control, which is the main objective of ad hoc routing protocols. A fundamental problem in ad hoc networking is how to deliver data packets among mobile nodes efficiently without predetermined topology or centralized control, which is the main objective of ad hoc routing protocols. A central challenge in the design of ad hoc networks is the development of dynamic routing protocols that can efficiently find routes between two communicating nodes. The goal is to carry out a systematic performance study of DSDV, DSR, AODV routing protocol for ad hoc networks. Moreover performance analysis is based on varying number of nodes in the Mobile Ad Hoc Network in chain topology. The rest of the paper is organized as follows: The work contributed in this area is provided in section II. The AODV, DSDV, DSR routing protocol description is summarized in section III.
RELATED WORK
A Several researchers have done the qualitative and quantitative analysis of Ad Hoc Routing Protocols by means of different performance metrics. They have used different simulators for this purpose.
1) Mr.Rafi U Zamam [1] studied & compared the performance of DSDV, AODV and DSR routing protocols for ad hoc networks using NS-2 simulations. In this paper, auther observed that the competitive reactive routing protocols, AODV and DSR, both show better performance than the other in terms of certain metrics. It is still difficult to determine which of them has overall better performance in MANET.
2) Vahid Garousi [2] studied an analysis of network traffic in ad-hoc networks based on the DSDV protocol with an emphasis on mobility and communication patterns of the nodes. In this paper, he observed that simulations measured the ability of DSDV routing protocol to react to multi-hop ad-hoc network topology changes in terms of scene size, mobile nodes movement, number of connections among nodes, and also the amount of data each mobile node transmits.
3) C.E. Perkins & P. Bhagwat[3] studied & proposed an efficient DSDV (Eff-DSDV) protocol for ad hoc networks. Eff-DSDV overcomes the problem of stale routes, and thereby improves the performance of regular DSDV. The proposed protocol has been implemented in the NCTUns Simulator and performance comparison has been made with regular DSDV and DSR protocols. The performance metrics considered are packet-delivery ratio, end-end delay, dropped packets, routing overhead, route length. It has been found after analysis that the performance of Eff-DSDV is superior to regular DSDV and sometimes better than DSR in certain cases.
Destination-Sequenced Distance Vector (DSDV)
The Destination Sequenced Distance Vector Protocol (DSDV) is a proactive, distance vector protocol which uses the Bellmann -Ford algorithm. DSDV is a hop-by hop distance vector routing protocol, wherein each node maintains a routing table listing the “next hop” and “number of hops” for each reachable destination. This protocol requires each mobile station to advertise, to each of its current neighbors, its own routing table (for instance, by broadcasting its entries). The entries in this list may change fairly dynamically over time, so the advertisement must be made often enough to ensure that every mobile computer can almost always locate every other mobile computer of the collection. In addition, each mobile computer agrees to relay data packets to other computers upon request. This agreement places a premium on the ability to determine the shortest number of hops for a route to a destination we would like to avoid unnecessarily disturbing mobile hosts if they are in sleep mode. In this way a mobile computer may exchange data with any other mobile computer in the group even if the target of the data is not within range for direct communication.