International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169 Volume: 2 Issue: 7 1855 – 1857 _______________________________________________________________________________________________ 1855 IJRITCC | July 2014, Available @ http://www.ijritcc.org _______________________________________________________________________________________ Performance Analysis of Dynamic Routing Protocols vs. Distance Vector Routing Protocols for Channel Error Rate on Multimedia Traffic. Parminderjeet Singh Research Scholar, PCET Lalru. er.parmindersaini@gmail.com Ameeta Dilbaghi AP, PCET Lalru. amitadilbaghi@gmail.com Nipun Sharma AP, Quest Group of Institutions Mohali. nipunharitash@gmail.com Abstract--The objective of the paper is to experimentally analyse the performance metric Peak Signal to noise ratio (PSNR) for varying channel error rates for multimedia (MPEG-4) traffic. The experiment is performed using two classes of routing protocols viz. dynamic routing protocol ie Ad-Hoc On-Demand Distance Vector (AODV)[3] and distance vector routing protocol ie Destination Sequenced Distance Vector (DSDV)[2]. Both the classes of routing protocols perform routing differently based on their algorithms which are complicated in case of dynamic routing protocols and relatively simpler in Distance vector. The effect of these routing algorithms not only affects the efficiency but also determines the optimization required for transmission of a particular class of traffic. The paper discusses the effect of these routing protocols in intricate detailing and concludes that simpler technique of routing ie distance vector proves more efficient in case of UDP based multimedia traffic. Keywords: PSNR, DSDV, AODV, MPEG-4, MANETs. __________________________________________________*****_________________________________________________ Introduction The multimedia traffic ie MPEG-4 is evaluated in NS-2 by integrating a framework called EvalVid [1].The Evalvid makes the NS-2 compatible to send I, P, B frames over the network at different fragment sizes over UDP[4]. Furthermore this traffic class can be routed over the network using different routing protocols for efficient traffic management and Quality of Service. In our paper we have tested and experimentally performed analysis of PSNR for two different routing protocols under different channel error rates.[6][7] Both the routing protocols’ working is briefly explained below. Destination-Sequenced Distance-Vector Routing (DSDV) [8] is a table-driven routing scheme for ad hoc mobile networks based on the Bellman–Ford algorithm. It was developed by C. Perkins and P.Bhagwat in 1994. The main contribution of the algorithm was to solve the routing loop problem. Each entry in the routing table contains a sequence number, the sequence numbers are generally even if a link is present; else, an odd number is used. The number is generated by the destination, and the emitter needs to send out the next update with this number. Routing information is distributed between nodes by sending full dumps infrequently and smaller incremental updates more frequently. In AODV, the network is silent until a connection is needed. At that point the network node that needs a connection broadcasts a request for connection. Other AODV nodes forward this message, and record the node that they heard it from, creating an explosion of temporary routes back to the needy node. When a node receives such a message and already has a route to the desired node, it sends a message backwards through a temporary route to the requesting node. The needy node then begins using the route that has the least number of hops through other nodes. Unused entries in the routing tables are recycled after a time. When a link fails, a routing error is passed back to a transmitting node, and the process repeats. Much of the complexity of the protocol is to lower the number of messages to conserve the capacity of the network. For example, each request for a route has a sequence number. Nodes use this sequence number so that they do not repeat route requests that they have already passed on. Another such feature is that the route requests have a "time to live" number that limits how many times they can be retransmitted. Another such feature is that if a route request fails, another route request may not be sent until twice as much time has passed as the timeout of the previous route request. The advantage of AODV is that it creates no extra traffic for communication along existing links. Also, distance vector routing is simple, and doesn't require much memory or calculation. However AODV requires more time to establish a connection, and the initial communication to establish a route is heavier than some other approaches. Simulation Environment and Methodology The simulations are performed on NS-2 integrated with Evalvid on Cygwin. The cygwin is a unix like environment virtually on windows (non Unix) machine. The Cygwin is installed on Windows Xp Machine. The simulation file is written in Octl script and has an extension .tcl and is