340 likes | 595 Views
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.
E N D
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 Node E drop the packet because it has forward the same ID packet F H D
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
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
AODV Route Discovery B E G A C F H D
AODV Route Discovery B E G A C F H D
AODV Route RREP • <source_addr , broadcast_id> B E G A C F H D
DSR vs AODV • Difference • Cache and Table • DSR forward greater packets than AODV • AODV periodically forward Hello Message to neighbors , DSR not.
Simulation Environment • Software • NS2 • Version:2.1b9a • OS • Linux-Red hat 7.3 • CPU • P3 900 • Memory • 128MB
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
Simulation Environment • Node radio range • 250 meters • Traffic source • CBR (Content Bit-Rate) • Node radio bandwidth • 2Mb/sec
Simulation Environment • Packet Length • 512 byte • Node Buffer • 100 • Node speed • 0~20 meter/sec
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
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
Performance Matrics • Throughput • The ratio of the data packets delivered to the destinations to those generated by the CBR sources. • received packets / sent packets
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
Performance Matrics • Normalized Routing Overhead • Normalized routing load = (routing packets sent) / receives
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