Successfully reported this slideshow.
We use your LinkedIn profile and activity data to personalize ads and to show you more relevant ads. You can change your ad preferences anytime.

Performance Evaluation of Routing Protocols


Published on

This is a research project based on Performance checking of the Routing Protocols. This Presentation shows the basic knowledge of the Protocols use (AODV, DSDV and DSR) and in the end it shows the Result and Conclusion by comparing the graphs which are generated through out the work.

Published in: Engineering, Technology

Performance Evaluation of Routing Protocols

  1. 1. Performance Evaluation of AODV, DSDV and DSR Routing Protocols Submitted to: Submitted by: Ms. Vartika Saxena Soham Gupta (9910103429) Mrs. Ambalika Sarkar Ankush Mehta (9910103436) Mr. Sanjeev Patel
  2. 2. Objective The main objective of this project is to study and compare the working of different routing protocols which are AODV, DSDV and DSR. With the help of these protocols, we do a comparative analysis to understand the quality of communication between the different nodes communicating in terms of No. of packets dropped, throughput and various other factors. We are considering node mobility, node density, node energy as input parametes for doing the same. The topology will be simulated using Network Simulator (NS2). The simulation results show that the network using routing protocol can provide quality of service support and react dynamically to the network status changes with low control overheads.
  3. 3. Output Parameters 1) Throughput Ratio of received packets with sent packets. 2) Dropped packets Total No of packets Dropped.
  4. 4. 3) Received Packets Total number of packets received. 4) Jitter A packet's delay varies with its position in the queues of the routers along the path between source and destination. This variation in delay is known as jitter. 5)Energy Rate of energy consumption by nodes of different protocols.
  5. 5. ROUTING PROTOCOLS AODV(Ad Hoc On Demand Distance Vector Protocol)  This is an On Demand Mechanism.  Each node maintain its own routing table. Source broadcast a route request which contains Source IP address and Destination IP address. Each node forwards the packet depending on the IP address.
  6. 6. DSR (Dynamic Source Routing Protocol) This is an On Demand Mechanism. It uses Source routing which is a technique whereby the sender of a packet can specify the route that a packet should take through the network. It uses Route discovery is in which suitable source route by searching its Route Cache of routes previously learned, but if no route is found in its cache, it will initiate the Route Discovery protocol to dynamically find a new route.  Route maintenance
  7. 7. DSDV ( Destination Sequenced Distance Vector Protocol) Reactive Protocol. Maintains Routing table at each node. Follows Bellman Fords algorithm.
  8. 8. NO. OF PACKETS DROPPED • From Figure it is clear that the dropped packets for the AODV protocol with 100 nodes is pretty much high. It shows high jumps at certain places which means that the packets are frequently dropped. •Packets dropped in AODV protocol with 50 nodes is less than the AODV protocol with 100 nodes although it also shows certain amount of packet drop at times. •The packet drop for the AODV protocol with 10 nodes is very low.
  9. 9. NO. OF RECEIVED PACKETS •For DSDV 100 nodes from Figure the no of received packets increases and decreases in the starting time and after that it increases consistently. •For DSDV 50 nodes, we find out from Figure that the no of received packets increases gradually over time for some time but after that we see a little fall in the same. •For DSDV 10 nodes protocol, it is clear that no of received packets is constantly increasing.
  10. 10. THROUGHPUT •Figure shows that the throughput for AODV 100 nodes is constant, but in the end it has a it has a higher and straight peak graph. •Figure depicts that the throughput for AODV 50 nodes has no throughput in the beginning but after that it rises with a straight peak and than remains constant for some time. It also have a final straight peak towards the end. •For AODV 10 nodes there is no throughput for a very long time but towards the end of the graph we see a little throughput.
  11. 11. JITTER •The graph shows that the initial jitter for AODV 10 nodes is at higher peaks and than it is forming spikes from 10.0 to 150.0 seconds and has a little peak again at 30 seconds. •For the DSDV 10 nodes the graph shows that the jitter is constantly increasing and decreasing in the formation of spikes but is always lesser than AODV 10 nodes. system/
  12. 12. Energy  In this graph we can see that the DSR is constant in energy consumption.  If we compare it with others (DSR) we see that AODV is consuming energy a little more faster (but constantly) than DSR.  And in DSDV we see that the energy consumption is much faster than the other two. So DSR it most consistent in all three.
  13. 13. CONCLUSION The table gives a comprehensive view of the performance of the three protocols i.e. AODV, DSR and DSDV and clearly shows that DSDV gives the best performance. Protocols DROPPED PACKETS RECEIVED PACKETS JITTER THROUGHPUT ENERGY AODV Highest packet drop Most consistency Average performance Most consistency Average consistent DSDV packet drop acceptable Average consistency High performance Least consistency Least consistent DSR Least packet drop Least consistency Low performance Average consistency Most consistent