1 / 33

Simulation in AODV and DSR

Simulation in AODV and DSR. 492516207 邱朝螢. Outline. Review DSR and AODV Simulation Environment Simulation Graph Simulation Result Conclusion. DSR Route Discovery. [A,G,ID,ABE]. [A,G,ID,AB]. Source A forward data to destination G. B. E. G. [A,G,ID,A]. [A,G,ID,AC]. A. C.

ishi
Download Presentation

Simulation in AODV and DSR

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Simulation in AODV and DSR 492516207 邱朝螢

  2. Outline • Review DSR and AODV • Simulation Environment • Simulation Graph • Simulation Result • Conclusion

  3. DSR Route Discovery [A,G,ID,ABE] [A,G,ID,AB] Source A forward data to destination G B E G [A,G,ID,A] [A,G,ID,AC] A C Node E drop the packet because it has forward the same ID packet F H D

  4. DSR Route Reply [A,B,E] [A,B,E] B E G [A,B,E] [A,B,E] Node A stores the route from A to G in its route cache A C F H D

  5. AODV Route Discovery Source A forward data to destination G B E G A broadcast RREQ sets up a reverse path A C F H D

  6. AODV Route Discovery B E G A C F H D

  7. AODV Route Discovery B E G A C F H D

  8. AODV Route RREP • <source_addr , broadcast_id> B E G A C F H D

  9. DSR vs AODV • Difference • Cache and Table • DSR forward greater packets than AODV • AODV periodically forward Hello Message to neighbors , DSR not.

  10. Simulation Environment • Software • NS2 • Version:2.1b9a • OS • Linux-Red hat 7.3 • CPU • P3 900 • Memory • 128MB

  11. Simulation Environment • Simulation Range • 1500*300 meters • Number of node in the range • Random creating 50 nodes • Number of source node in the range • Random 20 sources • Random 40 sources

  12. Simulation Environment • Node radio range • 250 meters • Traffic source • CBR (Content Bit-Rate) • Node radio bandwidth • 2Mb/sec

  13. Simulation Environment • Packet Length • 512 byte • Node Buffer • 100 • Node speed • 0~20 meter/sec

  14. Simulation Environment • Random create 50 nodes in 1500*300 meters • Random select 20(40) nodes to deliver packets • Each node starts its journey from a random location to a random location with a randomly chosen speed 0~20 m/s

  15. Simulation Environment • Each node move in 50 seconds, then move again after pause 20(40 or 60 or 80) seconds • Total Run Time: 300 seconds

  16. Simulation of AODV

  17. Simulation of AODV

  18. Simulation of AODV

  19. Performance Matrics • Throughput • The ratio of the data packets delivered to the destinations to those generated by the CBR sources. • received packets / sent packets

  20. Throughput(20sources)

  21. Throughput(40sources)

  22. Performance Matrics • Average Delay • For each packet with id of trace level (AGT) and type (CBR), calculate the send(s) time(s) and the receive(r) time(t) and average it

  23. Average Delay (20 sources)

  24. Average Delay (40 sources)

  25. Performance Matrics • Normalized Routing Overhead • Normalized routing load = (routing packets sent) / receives

  26. Normalized Routing Overhead (20 sources)

  27. Normalized Routing Overhead (40 sources)

  28. Source Code

  29. Trace File

  30. Conclusion • DSR have triple numbers of control messages than AODV • AODV has difficult when the nodes are moving fast • AODV has the shortest end-to-end delay • DSR has higher routing overhead than AODV

More Related