REVA INSTITUTE OF TECHNOLOGY AND MANAGEMENT. Kattigenahalli, Jala Hobli, Yelahanka, Bangalore
|
|
- Alfred Baker
- 6 years ago
- Views:
Transcription
1 REVA INSTITUTE OF TECHNOLOGY AND MANAGEMENT Kattigenahalli, Jala Hobli, Yelahanka, Bangalore Department of Master of Computer Applications III Semester MCA Laboratory Manual 1
2 Subject Code: I.A Marks: 50 Hours/Week: 3 Exam Marks: 50 Total Hours: 42 Exam Hours: 3 Particulars of the Experiments Performed CONTENTS Sl. No. Page No. Programs Write a TCL Script to Simulate the network described below Consider a small network with five nodes n0,n1,n2,n3 and n4 forming a star topology. The node n4 is at the center. Node n0 is a TCP Source, which 01 transmits pockets to n3(a TCP Sink) through the node n4. Node n1 is another Traffic Source and sends UDP packets to Node n2 through n4. The duration of the simulation time is 10 Seconds Setting up a local area network with ns2 In this exercise you will be simulating a CSMA/CD based LAN with ns2. Consider the LAN with seven nodes to be an isolated one i.e. not connected to the Internet. Node # 0 in the LAN act as a UDP traffic source, and node # 6 is the destination node. Assume CBR traffic to be flowing between the nodes. The simulation lasts for 25 seconds. In Ethernet a packet is broadcasted in the 02 shared medium, and only the destination node accepts the packet. Other nodes simply drop it. What should be the number of hops a packet from node #0 to node # 6 travel? Additional Task: Suppose the above LAN is to be connected to the Internet. Add node # 7 into the network so that it act as the gateway. Connect node # 0 and # 7 with a 1 03 Mb wired link. Move the UDP source to node # 7. Write a TCL Script to simulate a File Transfer With NS2 Consider a Client and Server. The Server is running a FTP Application (Over TCP). The Client sends a request to download s file of size 10 MB from server. Write a script to simulate this scenario. Let node #0 be the server and node #1 be the client. TCP packet size is 1500B. Assume typical values for other parameters. Note: This simulation require transfer of a fixed size file. Therefore, time required for the transfer would be constant for a given bandwidth of a link. To verify this, determine the time that would roughly be required for the transfer. 2
3 Then look at the bottom of the trace file and verify whether there is any transmission beyond the time calculated. To verify that the client has downloaded the entire file, plot the "Bytes Received " curve for node #1. The y-axis is in Kbits. Convert it to MB and verify whether it approximates the specified file size. TCP headers would effectively increase the count of received bytes at node # Simulating link errors Consider the following network diagram 04 Here node # 2 act as a router. Any traffic to or from the LAN passes through it. Consider node #1 running a FTP server, and node # 5 is downloading a file of size 4 MB. However, the link between node # 2 and # 3 is fault. It drops packets with a fixed probability of 0.2. Implement a link error model to reflect this. It may be noted here that the file download time will be more than the we had in exercise # 2 of experiment # 1. Try different values of the simulation time to ensure that the file has been entirely transferred. Is the plot of bytes received a linear curve or non-linear? Why?Presence of link errors cause one or more packets to be retransmitted. Verify this from the "Packet Retransmissions" plot. 05 Measuring Network Performances Bottleneck in the network 3
4 Consider a dumbbell topology with eight nodes as shown as in the following figure. Consider nodes# 2 and 3 to be two routers connecting two different networks. When the bandwidth of the link 2-3 is much lower than the sum of bandwidths of the other links in the network, it act as a bottleneck. Assume node # 0 running a FTP application (over TCP) and sending data to node # 6. Node # 1 is sending CBR data node # 7. Assume all the links except 2-3 has a bandwidth of 1 Mb, propagation delay of 10ms and queue type as DropTail. (All are duplex links). Tasks: The link 2-3 has a propagation delay of 10 ms. Vary it's bandwidth from 0.5 Mb to 2.5 Mb in steps of 0.25Mb. Compute the throughput for node # 3 in each case Plot the throughput vs. bandwidth data in the "Custom Plot" section below Based on the above plots, suggest what should be the recommended bandwidth of the link 2-3. Now, plot the end-to-end delay between nodes 0 and 6 for the above chosen values of link 2-3 bandwidth. Revisit your previous answer (i.e. optimum bandwidth of link 2-3)based on these graphs. Measuring Network Performances 4
5 Write a TCL script to simulate the following scenario with ns2 simulator. Consider six nodes, (as shown in the figure below) moving within a flat topology of 700m x 700m. The initial positions of nodes are 0 (150,300),1 (300,500),2 (500,500),3 (300,100),4(500,100) and 5(650,300) respectively.a TCP connection is initiated between node 0 (source) and node 5 (destination) through node 3 and node 4 i.e the route is At time t = 3 seconds the FTP application runs over it. After time t=4.0 sec, node 3 (300,100) moves towards node 1 06 (300,500) with a speed of 5.0m/secand after some time the path break, then the data transmit with a new path via node 1 and node 2 i.e the new route The simulation lasts for 60 secs. In the above said case both the route has equal cost Use DSR as the routing protocol and the IEEE MAC protocol. Now Analyze the trace file and determine when the use of second route commence, and Plot the number of packets received by each node over the entire time duration of the simulation Simulate a network which will create congestion in the network. With the trace file created identfy the points at which congestion occurs by writing sed / awk scripts. Also write a mechanism to correct/control the congestion. Simulate a wired network and demonstrate Distance Vector Routing algorithm. Bandwidth sharing between TCP and UDP Consider the dumbbell topology from our previous exercise: 5
6 Node # 0 is a TCP source, and the corresponding sink is at node # 6. Node # 1 is a UDP source (CBR traffic) with a null agent attached to node # 7. These two traffic flows through the common link 2-3. The aim of this exercise is to examine how TCP and UDP share the bandwidth between themselves when the rate of CBR traffic is changed. Set the TCP packet size to 1460 B. The UDP and CBR packet sizes are 1500 B. All the links in the network have same bandwidths (say, 4 Mb), delay and queue types. Part 1: Set the initial rate of CBR traffic to 0.5 Mb. Run the simulation, and plot the "Bytes Received" by node #s 4 and 5 (sinks for TCP and UDP traffic) Now, increment the rate up to 4 Mb, the link bandwidth, in steps of 0.5 Mb. Run the simulation and plot the graphs again. How does the graphs change after each run? In particular, what's the nature of the graphs when the rate of CBR traffic is 50% of the bandwidth? Part 2: Behaviour of UDP Reduce the bandwidth of the link 2-3 to say, 2 Mb. Repeat the above steps and observe the graphs in this case.from the graphs plotted observe how UDP occupies a larger portion of the bandwidth. How does the behaviour change for other variations of TCP (Newreno, Vegas)? 6
7 INSTRUCTIONS TO COMPILE AND EXECUTE PROGRAMS Type the program in any editor and save it with.tcl extention To compile the program use ns filename.tcl To construct the graph use xgraph filename.tr 7
8 1. Write a TCL Script to Simulate the network described below Consider a small network with five nodes n0,n1,n2,n3 and n4 forming a star topology. The node n4 is at the center. Node n0 is a TCP Source, which transmits pockets to n3(a TCP Sink) through the node n4. Node n1 is another Traffic Source and sends UDP packets to Node n2 through n4. The duration of the simulation time is 10 Seconds set val(stop) 10.0 ;#time of simulation end #Create a ns simulator set ns [new Simulator] $ns color 1 Blue $ns color 2 Red #Open the NS trace file set tracefile [open p1.tr w] $ns trace-all $tracefile #Open the NAM trace file set namfile [open p1.nam w] $ns namtrace-all $namfile #Create 5 nodes set n0 [$ns node] set n1 [$ns node] set n2 [$ns node] set n3 [$ns node] set n4 [$ns node] #Create labels for nodes $n0 label "Tcp Source" $n3 label "Tcp_Destination" $n1 label "Udp Source " $n2 label "Udp Destination" #Give shapes to nodes $n0 shape square $n3 shape square $n4 shape circle 8
9 $n1 shape hexagon $n2 shape hexagon #Give colors to nodes $n0 color green $n3 color red $n1 color green $n2 color red $n4 color black #Create links between nodes $ns duplex-link $n0 $n Mb 40ms DropTail $ns queue-limit $n0 $n4 5 ; # default queue limit is 50 $ns duplex-link $n4 $n Mb 40ms DropTail $ns queue-limit $n4 $n3 5 $ns duplex-link $n1 $n Mb 40ms DropTail $ns queue-limit $n1 $n4 5 $ns duplex-link $n4 $n Mb 40ms DropTail $ns queue-limit $n4 $n2 5 $ns duplex-link-op $n4 $n2 queuepos 0.5 ; # give reading when queue content is 50% $ns duplex-link-op $n4 $n0 queuepos 0.5 #Give node position (for NAM) $ns duplex-link-op $n4 $n0 orient left-down $ns duplex-link-op $n1 $n4 orient left-up $ns duplex-link-op $n3 $n4 orient left-down $ns duplex-link-op $n2 $n4 orient right-down #Setup a TCP connection set tcp0 [new Agent/TCP] $ns attach-agent $n0 $tcp0 set sink3 [new Agent/TCPSink] $ns attach-agent $n3 $sink3 $ns connect $tcp0 $sink3 $tcp0 set packetsize_
10 #Setup a UDP connection set udp1 [new Agent/UDP] $ns attach-agent $n1 $udp1 set null2 [new Agent/Null] $ns attach-agent $n2 $null2 $ns connect $udp1 $null2 $udp1 set packetsize_ 1000 #Assign flow-id $tcp0 set fid_ 1 $udp1 set fid_ 2 #Setup a CBR Application over TCP connection set cbr0 [new Application/Traffic/CBR] $cbr0 attach-agent $tcp0 $cbr0 set packetsize_ 1000 $cbr0 set rate_ 3.0Mb $cbr0 set random_ null $ns at 0.01 "$cbr0 start" $ns at 9.9 "$cbr0 stop" #Setup a CBR Application over UDP connection set cbr1 [new Application/Traffic/CBR] $cbr1 attach-agent $udp1 $cbr1 set packetsize_ 1000 $cbr1 set rate_ 2.0Mb $cbr1 set random_ null $ns at 0.1 "$cbr1 start" $ns at 9.0 "$cbr1 stop" #Define a 'finish' procedure proc finish { { global ns tracefile namfile 10
11 $ns flush-trace close $tracefile close $namfile exec nam p1.nam & exit 0 $ns at $val(stop) "$ns nam-end-wireless $val(stop)" $ns at $val(stop) "finish" $ns at $val(stop) "puts \"done\" ; $ns halt" $ns run OUTPUT 11
12 2.Setting up a local area network with ns2 In this exercise you will be simulating a CSMA/CD based LAN with ns2. Consider the LAN with seven nodes to be an isolated one i.e. not connected to the Internet. Node # 0 in the LAN act as a UDP traffic source, and node # 6 is the destination node. Assume CBR traffic to be flowing between the nodes. The simulation lasts for 25 seconds. In Ethernet a packet is broadcasted in the shared medium, and only the destination node accepts the packet. Other nodes simply drop it. What should be the number of hops a packet from node #0 to node # 6 travel? Additional Task: Suppose the above LAN is to be connected to the Internet. Add node # 7 into the network so that it act as the gateway. Connect node # 0 and # 7 with a 1 Mb wired link. Move the UDP source to node # 7. Program set ns [new Simulator] $ns color 1 Blue $ns color 2 Red set ntrace [open prg2.tr w] $ns trace-all $ntrace set namfile [open prg2.nam w] $ns namtrace-all $namfile proc finish { { global ns ntrace namfile $ns flush-trace close $ntrace close $namfile exec nam prg2.nam & exit 0 12
13 for { set i 0 {$i < 7 { incr i { set n($i) [$ns node] $n(0) label "Udp Source " #X $n(6) label "Udp Sink" set lan [$ns newlan "$n(0) $n(1) $n(2) $n(3) $n(4) $n(5) $n(6)" 0.5Mb 40ms LL Queue/DropTail MAC/802_3 Channel] set udp [new Agent/UDP] #remove the comments for this block to perform additional task and comment the lines which have been marked as X at the end of the line # set n7 [$ns node] # $n7 label "Udp Source " # $ns attach-agent $n7 $udp # $ns duplex-link $n(0) $n7 10Mb 20ms DropTail # $ns duplex-link-op $n(0) $n7 orient left $ns attach-agent $n(0) $udp #X set sink0 [new Agent/Null] $ns attach-agent $n(6) $sink0 $ns connect $udp $sink0 set cbr0 [new Application/Traffic/CBR] $cbr0 set packetsize_ 1000 $cbr0 set interval_ 0.1 $cbr0 attach-agent $udp $udp set fid_ 1 $ns at 0.01 "$cbr0 start" $ns at 20.0 "$cbr0 stop" $ns at 25.0 "finish" $ns run 13
14 OUTPUT 14
15 Additional Tasks 15
16 3. Write a TCL Script to simulate a File Transfer With NS2 Consider a Client and Server. The Server is running a FTP Application (Over TCP). The Client sends a request to download s file of size 10 MB from server. Write a script to simulate this scenario. Let node #0 be the server and node #1 be the client. TCP packet size is 1500B. Assume typical values for other parameters. Note: This simulation require transfer of a fixed size file. Therefore, time required for the transfer would be constant for a given bandwidth of a link. To verify this, determine the time that would roughly be required for the transfer. Then look at the bottom of the trace file and verify whether there is any transmission beyond the time calculated. To verify that the client has downloaded the entire file, plot the "Bytes Received " curve for node #1. The y-axis is in Kbits. Convert it to MB and verify whether it approximates the specified file size. TCP headers would effectively increase the count of received bytes at node # 1. Program #Create a ns simulator set ns [new Simulator] #Open the NS trace file set tracefile [open p3.tr w] $ns trace-all $tracefile #Open the NAM trace file set namfile [open p3.nam w] $ns namtrace-all $namfile #Create 2 nodes set s [$ns node] set c [$ns node] $ns color 1 Blue #Create labels for nodes $s label "Server" $c label "Client" 16
17 #Create links between nodes $ns duplex-link $s $c 10Mb 22ms DropTail #Give node position (for NAM) $ns duplex-link-op $s $c orient right #Setup a TCP connection for node s(server) set tcp0 [new Agent/TCP] $ns attach-agent $s $tcp0 $tcp0 set packetsize_ 1500 #Setup a TCPSink connection for node c(client) set sink0 [new Agent/TCPSink] $ns attach-agent $c $sink0 $ns connect $tcp0 $sink0 #Setup a FTP Application over TCP connection set ftp0 [new Application/FTP] $ftp0 attach-agent $tcp0 $ftp0 set type_ FTP $tcp0 set fid_ 1 proc finish { { global ns tracefile namfile $ns flush-trace close $tracefile close $namfile exec nam p3.nam & exec awk -f p3.awk p3.tr & exec awk -f p31.awk p3.tr > p31.tr & exec xgraph p31.tr -geometry 800*400 -t "bytes_received_at_client" -x "time_in_secs" -y "bytes_in_bps" & $ns at 0.01 "$ftp0 start" $ns at 15.0 "$ftp0 stop" 17
18 $ns at 15.1 "finish" $ns run Awk Script for finding time taken for data transmission(p3.awk) # AWK script to calculate the time required to transfer the 10 MB file from the server to client BEGIN { count=0; time=0; total_bytes_sent =0; total_bytes_received=0; { if ( $1 == "r" && $4 == 1 && $5 == "tcp") total_bytes_received += $6; if($1 == "+" && $3 == 0 && $5 == "tcp") total_bytes_sent += $6; END { system("clear"); printf("\n Transmission time required to transfer the file is %lf",$2); printf("\n Actual data sent from the server is %lf Mbps", (total_bytes_sent)/ ); printf("\n Data Received by the client is %lf Mbps\n", (total_bytes_received)/ ); 18
19 # AWK Script to calculate amount of data recived for every time intervel(p31.awk) BEGIN { count=0; time=0; { if ( $1 == "r" && $4 == "1" && $5 == "tcp") { count += $6; time=$2; printf("\n%lf\t%lf",time,(count)/ ); END { 19
20 OUTPUT 20
21 4. Simulating link errors Consider the following network diagram Here node # 2 act as a router. Any traffic to or from the LAN passes through it. Consider node #1 running a FTP server, and node # 5 is downloading a file of size 4 MB. However, the link between node # 2 and # 3 is fault. It drops packets with a fixed probability of 0.2. Implement a link error model to reflect this. It may be noted here that the file download time will be more than the we had in exercise # 2 of experiment # 1. Try different values of the simulation time to ensure that the file has been entirely transferred. Is the plot of bytes received a linear curve or non-linear? Why? Presence of link errors cause one or more packets to be re-transmitted. Verify this from the "Packet Re-transmissions" plot. set val(stop) 20.0 ;#time of simulation end #Create a ns simulator set ns [new Simulator] #Open the NS trace file set tracefile [open p4.tr w] $ns trace-all $tracefile #Open the NAM trace file set namfile [open p4.nam w] $ns namtrace-all $namfile #Create 7 nodes 21
22 set n0 [$ns node] set n1 [$ns node] $n1 shape square $n1 label "ftp_server" set n2 [$ns node] $n2 color green $n2 label "error_node" set n3 [$ns node] $n3 color green $n3 label "error_node" set n4 [$ns node] set n5 [$ns node] $n5 label "ftp_client" set n6 [$ns node] #Createlinks between nodes $ns duplex-link $n0 $n Mb 10ms DropTail $ns queue-limit $n0 $n2 50 $ns duplex-link $n0 $n Mb 10ms DropTail $ns queue-limit $n0 $n1 50 $ns duplex-link $n1 $n Mb 10ms DropTail $ns queue-limit $n1 $n2 50 $ns duplex-link $n2 $n Mb 10ms DropTail $ns queue-limit $n2 $n3 50 #Give node position (for NAM) $ns duplex-link-op $n0 $n2 orient right $ns duplex-link-op $n0 $n1 orient right-down $ns duplex-link-op $n1 $n2 orient right-up $ns duplex-link-op $n2 $n3 orient right set em [new ErrorModel] $em unit pkt ; # error unit (default: packets) (Other units: time, bits) 22
23 $em set rate_ 0.2 ; # error rate probability $em ranvar [new RandomVariable/Uniform] ; # specify the rv for generating errors $em drop-target [new Agent/Null] ; # collect corrupted packets and handle #Create a LAN of four nodes and record the trace (ex: collision-c, hop-h) $ns make-lan -trace on " $n3 $n4 $n5 $n6 " 0.5Mb 40ms LL Queue/DropTail Mac/802_3 #Associate a link loss model between nodes n2 and n3 $ns link-lossmodel $em $n2 $n3 #Setup a TCP connection set tcp0 [new Agent/TCP] $ns attach-agent $n1 $tcp0 set sink2 [new Agent/TCPSink] $ns attach-agent $n5 $sink2 $ns connect $tcp0 $sink2 $tcp0 set packetsize_ 1000 #Setup a FTP Application over TCP connection set ftp0 [new Application/FTP] $ftp0 attach-agent $tcp0 $ns at 0.01 "$ftp0 start" $ns at 48.0 "$ftp0 stop" #Define a 'finish' procedure proc finish { { global ns tracefile namfile $ns flush-trace close $tracefile close $namfile exec nam p4.nam & exec awk -f p4.awk p4.tr >> p_plo.tr & exec awk -f ReTans.awk p4.tr > p_rtran.tr & exit 0 23
24 Note: repeat the experiment for different simulation timing and record the reading(simulation time and total data transmitted) example Awk Script for generating total simulation time and total data transmitted BEGIN { count=0; { if( $1 == "r" && ( $4 == 2 $4==3)) { count += $6; END { printf("%lf\t%lf\n",$2,(count/ )); 24
25 Simulation time Total Data Transferred Graph between Simulation time and Data Transfer 25
26 Awk Script for generating sequence no and no of retransmissions BEGIN{ i=0; a[1500]; { if($1=="d") { for(i=0;i<1500;i++) { if($11==i) a[i]=a[i]+1; END{ for(i=0;i<1500;i++) { printf("%d\t%d\n",i,a[i]); 26
27 OUTPUT Graph between packet number and number of re transmissions 27
28 5. Measuring Network Performances Bottleneck in the network Consider a dumbbell topology with eight nodes as shown as in the following figure. Consider nodes# 2 and 3 to be two routers connecting two different networks. When the bandwidth of the link 2-3 is much lower than the sum of bandwidths of the other links in the network, it act as a bottleneck. Assume node # 0 running a FTP application (over TCP) and sending data to node # 6. Node # 1 is sending CBR data node # 7. Assume all the links except 2-3 has a bandwidth of 1 Mb, propagation delay of 10ms and queue type as DropTail. (All are duplex links). Tasks: The link 2-3 has a propagation delay of 10 ms. Vary it's bandwidth from 0.5 Mb to 2.5 Mb in steps of 0.25Mb. Compute the throughput for node # 3 in each case Plot the throughput vs. bandwidth data in the "Custom Plot" section below Based on the above plots, suggest what should be the recommended bandwidth of the link 2-3. Now, plot the end-to-end delay between nodes 0 and 6 for the above chosen values of link 2-3 bandwidth. Revisit your previous answer (i.e. optimum bandwidth of link 2-3) based on these graphs. Measuring Network Performances 28
29 Program #Program 5 set bv [lindex $argv 0] set val(stop) 100.0; #time of simulation end #Create a ns simulator set ns [new Simulator] $ns color 1 Blue $ns color 2 Red #Open the NS trace file set tracefile [open p5.tr w] $ns trace-all $tracefile #Open the NAM trace file set namfile [open p5.nam w] $ns namtrace-all $namfile #Create 8 nodes set n0 [$ns node] $n0 label "ftp source" set n1 [$ns node] $n1 label "cbr source" $n1 shape square set n2 [$ns node] set n3 [$ns node] set n4 [$ns node] set n5 [$ns node] set n6 [$ns node] $n6 label "ftp receiver" set n7 [$ns node] $n7 label "cbr receiver" #Create links between nodes $ns duplex-link $n2 $n0 1.0Mb 10ms DropTail $ns queue-limit $n2 $n0 5 29
30 $ns duplex-link $n1 $n2 1.0Mb 10ms DropTail $ns queue-limit $n1 $n2 5 $ns duplex-link $n2 $n3 ${bvmb 10ms DropTail $ns queue-limit $n2 $n3 2 $ns duplex-link $n3 $n4 1.0Mb 10ms DropTail $ns queue-limit $n3 $n4 5 $ns duplex-link $n3 $n5 1.0Mb 10ms DropTail $ns queue-limit $n3 $n5 5 $ns duplex-link $n5 $n7 1.0Mb 10ms DropTail $ns queue-limit $n5 $n7 5 $ns duplex-link $n4 $n6 1.0Mb 10ms DropTail $ns queue-limit $n4 $n6 5 #Give node position (for NAM) $ns duplex-link-op $n2 $n0 orient left-up $ns duplex-link-op $n1 $n2 orient right-up $ns duplex-link-op $n2 $n3 orient right $ns duplex-link-op $n3 $n4 orient right-up $ns duplex-link-op $n3 $n5 orient right-down $ns duplex-link-op $n5 $n7 orient right $ns duplex-link-op $n4 $n6 orient right #Setup a TCP connection set tcp0 [new Agent/TCP] $ns attach-agent $n0 $tcp0 set sink6 [new Agent/TCPSink] $ns attach-agent $n6 $sink6 $ns connect $tcp0 $sink6 $tcp0 set packetsize_ 1500 #Setup a UDP connection set udp1 [new Agent/UDP] $ns attach-agent $n1 $udp1 30
31 set null7 [new Agent/Null] $ns attach-agent $n7 $null7 $ns connect $udp1 $null7 $udp1 set packetsize_ 1500 $tcp0 set fid_ 1 $udp1 set fid_ 2 #Setup a FTP Application over TCP connection set ftp0 [new Application/FTP] $ftp0 attach-agent $tcp0 $ns at 0.01 "$ftp0 start" $ns at 40.0 "$ftp0 stop" #Setup a CBR Application over UDP connection set cbr1 [new Application/Traffic/CBR] $cbr1 attach-agent $udp1 $ns at 0.01 "$cbr1 start" $ns at 40.0 "$cbr1 stop" #Define a 'finish' procedure proc finish { { global ns tracefile namfile bv $ns flush-trace close $tracefile close $namfile exec nam p5.nam & exec awk -f p5.awk -v var1=$bv p5.tr >> p51.tr & exec awk -f p5_delay.awk p5.tr xgraph exit 0 $ns at $val(stop) "finish" $ns run 31
32 Output 32
33 #AWK script to calculate throughput for specific bandwidth BEGIN { count=0; time=0.01; { if ( $1 == "r" && $3 == 2 && $4 == 3) { count += $6; time=$2; END { printf(" %lf \t %lf\n ", var1,((count/time) * (8/ )) ); Bandwidths Throughput
34 34
35 BEGIN { hpid = 0; { e=$1; t=$2; fid=$8; pid=$12; s=$9; d=$10; if(pid > hpid) hpid = pid; if( st[pid]== 0) st[pid]=t; if(fid == 1 && e == "r" && s==0 && d==6) { et[pid]=t; else { et[pid]=0; END { for(pid=0; pid<=hpid; pid++) { start = st[pid]; end = et[pid]; packet_duration = end - start; if( start < end ) printf("%d\t%lf\n",pid,packet_duration); 35
36 36
37 6. Write a TCL script to simulate the following scenario with ns2 simulator. Consider six nodes, (as shown in the figure below) moving within a flat topology of 700m x 700m. The initial positions of nodes are 0 (150,300),1 (300,500),2 (500,500),3 (300,100),4(500,100) and 5(650,300) respectively.a TCP connection is initiated between node 0 (source) and node 5 (destination) through node 3 and node 4 i.e the route is At time t = 3 seconds the FTP application runs over it. After time t=4.0 sec, node 3 (300,100) moves towards node 1 (300,500) with a speed of 5.0m/secand after some time the path break, then the data transmit with a new path via node 1 and node 2 i.e the new route The simulation lasts for 60 secs. In the above said case both the route has equal cost Use DSR as the routing protocol and the IEEE MAC protocol. Now Analyze the trace file and determine when the use of second route commence, and Plot the number of packets received by each node over the entire time duration of the simulation # Program 7 # Simulation parameters setup set val(chan) Channel/WirelessChannel ;# channel type set val(prop) Propagation/TwoRayGround ;# radio-propagation model set val(netif) Phy/WirelessPhy ;# network interface type set val(mac) ;# MAC type set val(ifq) set val(ll) set val(ant) Mac/802_11 CMUPriQueue LL ;# interface queue type ;# link layer type Antenna/OmniAntenna set val(ifqlen) 50 ;# antenna model ;# max packet in ifq set val(nn) 6 set val(rp) DSR set val(x) 700 ;# X dimension of topography set val(y) 700 ;# Y dimension of topography set val(stop) 60.0 ;# number of mobilenodes ;# routing protocol ;# time of simulation end #Create a ns simulator set ns [new Simulator] #Setup topography object set topo [new Topography] 37
38 $topo load_flatgrid $val(x) $val(y) create-god $val(nn) #Open the NS trace file set tracefile [open p6.tr w] $ns trace-all $tracefile #Open the NAM trace file set namfile [open p6.nam w] $ns namtrace-all $namfile $ns namtrace-all-wireless $namfile $val(x) $val(y) set chan [new $val(chan)];#create wireless channel # Mobile node parameter setup $ns node-config -adhocrouting $val(rp) \ -lltype $val(ll) \ -mactype $val(mac) \ -ifqtype -ifqlen $val(ifq) \ $val(ifqlen) \ -anttype $val(ant) \ -proptype $val(prop) \ -phytype $val(netif) \ -channel $chan \ -topoinstance $topo \ -agenttrace ON \ -routertrace ON \ -mactrace ON \ -movementtrace ON #Create 6 nodes with initial positions set n0 [$ns node] $n0 set X_ 150 $n0 set Y_ 300 $n0 set Z_ 0.0 $ns initial_node_pos $n
39 set n1 [$ns node] $n1 set X_ 300 $n1 set Y_ 500 $n1 set Z_ 0.0 $ns initial_node_pos $n1 20 set n2 [$ns node] $n2 set X_ 500 $n2 set Y_ 500 $n2 set Z_ 0.0 $ns initial_node_pos $n2 20 set n3 [$ns node] $n3 set X_ 300 $n3 set Y_ 100 $n3 set Z_ 0.0 $ns initial_node_pos $n3 20 set n4 [$ns node] $n4 set X_ 500 $n4 set Y_ 100 $n4 set Z_ 0.0 $ns initial_node_pos $n4 20 set n5 [$ns node] $n5 set X_ 650 $n5 set Y_ 300 $n5 set Z_ 0.0 $ns initial_node_pos $n5 20 #Setup a TCP connection set tcp0 [new Agent/TCP] $ns attach-agent $n0 $tcp0 set sink5 [new Agent/TCPSink] 39
40 $ns attach-agent $n5 $sink5 $ns connect $tcp0 $sink5 $tcp0 set packetsize_ 1500 #Setup a FTP Application over TCP connection set ftp0 [new Application/FTP] $ftp0 attach-agent $tcp0 $ns at 0.0 "$ftp0 start" $ns at 60.0 "$ftp0 stop" #Allow node n3 to move towards node n1 with speed 5 m/sec $ns at 4.0 "$n3 setdest " #Define a 'finish' procedure proc finish { { global ns tracefile namfile $ns flush-trace close $tracefile close $namfile exec nam p6.nam & exec cat p6.tr awk -f p6.awk & exit 0 for {set i 0 {$i < $val(nn) { incr i { $ns at $val(stop) "\$n$i reset" $ns at $val(stop) "$ns nam-end-wireless $val(stop)" $ns at $val(stop) "finish" $ns at $val(stop) "puts \"done\" ; $ns halt" $ns run 40
41 AWK Script for calculating total amount transferred by each node BEGIN { count1=0; count2=0; count3=0; count4=0; count5=0; { if( $1=="r" && $3=="_1_" && $4=="RTR") count1++; if( $1=="r" && $4=="RTR" && $3=="_2_") count2++; if( $1=="r" && $4=="RTR" && $3=="_3_") count3++; if( $1=="r" && $4=="RTR" && $3=="_4_") count4++; if( $1=="r" && $4=="RTR" && $3=="_5_") count5++; END { printf("\n packet received by node 1 %d",count1); printf("\n packet received by node 2 %d",count2); printf("\n packet received by node 3 %d",count3); printf("\n packet received by node 4 %d",count4); printf("\n packet received by node 5 %d\n",count5); 41
42 OUTPUT num_nodes is set 6 INITIALIZE THE LIST xlisthead channel.cc:sendup - Calc highestantennaz_ and distcst_ highestantennaz_ = 1.5, distcst_ = SORTING LISTS...DONE! packet received by node packet received by node packet received by node packet received by node packet received by node
43 7. Simulate a network which will create congestion in the network. With the trace file created identify the points at which congestion occurs by writing sed / awk scripts. Also write a mechanism to correct/control the congestion. #Program set bv [lindex $argv 0] set val(stop) 100.0; #time of simulation end #Create a ns simulator set ns [new Simulator] $ns color 1 Blue $ns color 2 Red $ns color 3 Green #Open the NS trace file set tracefile [open p7.tr w] $ns trace-all $tracefile #Open the NAM trace file set namfile [open p7.nam w] $ns namtrace-all $namfile #Create 8 nodes set n0 [$ns node] $n0 label "cbr1 source" set n1 [$ns node] $n1 label "cbr2 source" $n1 shape square set n2 [$ns node] set n3 [$ns node] set n4 [$ns node] set n5 [$ns node] set n6 [$ns node] $n6 label "cbr1 receiver" set n7 [$ns node] $n7 label "cbr1 receiver" 43
44 #Create links between nodes $ns duplex-link $n0 $n3 1.0Mb 10ms DropTail $ns queue-limit $n0 $n3 5 $ns duplex-link $n1 $n3 1.0Mb 10ms DropTail $ns queue-limit $n1 $n3 5 $ns duplex-link $n2 $n3 1.0Mb 10ms DropTail $ns queue-limit $n2 $n3 5 $ns duplex-link $n3 $n4 ${bvmb 10ms DropTail $ns queue-limit $n3 $n4 5 $ns duplex-link $n4 $n5 1.0Mb 10ms DropTail $ns queue-limit $n4 $n5 5 $ns duplex-link $n4 $n6 1.0Mb 10ms DropTail $ns queue-limit $n4 $n6 5 $ns duplex-link $n4 $n7 1.0Mb 10ms DropTail $ns queue-limit $n4 $n7 5 #Give node position (for NAM) $ns duplex-link-op $n0 $n3 orient right-down $ns duplex-link-op $n1 $n3 orient right $ns duplex-link-op $n2 $n3 orient right-up $ns duplex-link-op $n3 $n4 orient right $ns duplex-link-op $n4 $n5 orient right-up $ns duplex-link-op $n4 $n6 orient right-down $ns duplex-link-op $n4 $n7 orient right #Setup a TCP connection set tcp0 [new Agent/TCP/Newreno] $ns attach-agent $n0 $tcp0 set sink5 [new Agent/TCPSink] $ns attach-agent $n5 $sink5 $ns connect $tcp0 $sink5 $tcp0 set packetsize_
45 set tcp1 [new Agent/TCP/Vegas] $ns attach-agent $n1 $tcp1 set sink7 [new Agent/TCPSink] $ns attach-agent $n7 $sink7 $ns connect $tcp1 $sink7 $tcp1 set packetsize_ 1500 #Setup a UDP connection #Agent/TCP - a ``tahoe'' TCP sender set tcp2 [new Agent/TCP] $ns attach-agent $n2 $tcp2 set sink6 [new Agent/TCPSink] $ns attach-agent $n6 $sink6 $ns connect $tcp2 $sink6 $tcp2 set packetsize_ 1500 $tcp0 set fid_ 1 $tcp1 set fid_ 2 $tcp2 set fid_ 3 #Setup a FTP Application over TCP connection set cbr0 [new Application/Traffic/CBR] $cbr0 attach-agent $tcp0 $ns at 0.01 "$cbr0 start" $ns at 40.0 "$cbr0 stop" set cbr1 [new Application/Traffic/CBR] $cbr1 attach-agent $tcp1 $ns at 0.01 "$cbr1 start" $ns at 40.0 "$cbr1 stop" #Setup a CBR Application over UDP connection set cbr2 [new Application/Traffic/CBR] $cbr2 attach-agent $tcp2 $ns at 0.01 "$cbr2 start" 45
46 $ns at 40.0 "$cbr2 stop" #Define a 'finish' procedure proc finish { { global ns tracefile namfile bv $ns flush-trace close $tracefile close $namfile # exec nam p7.nam & exec awk -f p7.awk -v var1=$bv p7.tr >> p71.tr & exit 0 $ns at $val(stop) "finish" $ns run OUTPUT 46
47 AWK Script for calculating number of congestion actions taken by TCPThaho, NewReno, Vegas BEGIN { countvagus=0; countreno=0; counttcp=0; { if ($8=="1" && $7=="---A---" ) countnewreno++; if ($8=="2" && $7=="---A---" ) countvegas++; if ($8=="3" && $7=="---A---" ) counttahoe++; END { printf(" %lf \t %d\t %d\t %d\n ", var1,countnewreno,countvegas,counttahoe); 47
48 Graph for number of actions taken by Newreno, Vegas, TCP Thaho Bandwidth TCP Newreno TCP Vegas TCP Thaho
49 49
50 8. Simulate a wired network and demonstrate Distance Vector Routing algorithm. set ns [new Simulator] $ns color 1 blue $ns color 2 red set nf [open out.nam w] $ns namtrace-all $nf set tr [open out.tr w] $ns trace-all $tr proc finish { { global nf ns tr $ns flush-trace close $tr close $nf exec nam out.nam & exit 0 set n0 [$ns node] set n1 [$ns node] set n2 [$ns node] set n3 [$ns node] set n4 [$ns node] set n5 [$ns node] $ns duplex-link $n0 $n1 10Mb 10ms DropTail $ns duplex-link $n1 $n3 4Mb 10ms DropTail $ns duplex-link $n2 $n1 10Mb 10ms DropTail $ns duplex-link $n1 $n4 10Mb 10ms DropTail $ns duplex-link $n4 $n5 10Mb 10ms DropTail $ns duplex-link $n5 $n3 10Mb 10ms DropTail $ns duplex-link-op $n0 $n1 orient right-down $ns duplex-link-op $n1 $n3 orient right $ns duplex-link-op $n2 $n1 orient right-up $ns duplex-link-op $n1 $n4 orient right-up 50
51 $ns duplex-link-op $n4 $n5 orient right $ns duplex-link-op $n5 $n3 orient right-down set tcp [new Agent/TCP] $ns attach-agent $n0 $tcp set ftp [new Application/FTP] $ftp attach-agent $tcp set sink [new Agent/TCPSink] $ns attach-agent $n3 $sink set udp [new Agent/UDP] $ns attach-agent $n2 $udp set cbr [new Application/Traffic/CBR] $cbr attach-agent $udp set null [new Agent/Null] $ns attach-agent $n3 $null $ns connect $tcp $sink $ns connect $udp $null $tcp set fid_ 1 $udp set fid_ 2 $ns rtmodel-at 1.0 down $n1 $n3 $ns rtmodel-at 2.0 up $n1 $n3 $ns rtproto DV $ns at 0.1 "$ftp start" $ns at 0.0 "$cbr start" $ns at 10.0 "finish" $ns run 51
52 Output 52
53 9. Bandwidth sharing between TCP and UDP Consider the dumbbell topology from our previous exercise: Node # 0 is a TCP source, and the corresponding sink is at node # 6. Node # 1 is a UDP source (CBR traffic) with a null agent attached to node # 7. These two traffic flows through the common link 2-3. The aim of this exercise is to examine how TCP and UDP share the bandwidth between themselves when the rate of CBR traffic is changed. Set the TCP packet size to 1460 B. The UDP and CBR packet sizes are 1500 B. All the links in the network have same bandwidths (say, 4 Mb), delay and queue types. Part 1: Set the initial rate of CBR traffic to 0.5 Mb. Run the simulation, and plot the "Bytes Received" by node #s 4 and 5 (sinks for TCP and UDP traffic) Now, increment the rate up to 4 Mb, the link bandwidth, in steps of 0.5 Mb. Run the simulation and plot the graphs again. How does the graphs change after each run? In particular, what's the nature of the graphs when the rate of CBR traffic is 50% of the bandwidth? Part 2: Behaviour of UDP 53
54 Reduce the bandwidth of the link 2-3 to say, 2 Mb. Repeat the above steps and observe the graphs in this case.from the graphs plotted observe how UDP occupies a larger portion of the bandwidth. How does the behaviour change for other variations of TCP (Newreno, Vegas)? Program set val(stop) 50.0 ;#time of simulation end set rt [lindex $argv 0] #Create a ns simulator set ns [new Simulator] $ns color 1 Blue $ns color 2 Red #Open the NS trace file set tracefile [open p6.tr w] $ns trace-all $tracefile #Open the NAM trace file set namfile [open p6.nam w] $ns namtrace-all $namfile #Create 8 nodes set n0 [$ns node] $n0 label "ftp source" set n1 [$ns node] $n1 label "cbr source" $n1 shape square set n2 [$ns node] set n3 [$ns node] set n4 [$ns node] set n5 [$ns node] set n6 [$ns node] $n6 label "ftp receiver" set n7 [$ns node] $n7 label "cbr receiver" #Create links between nodes $ns duplex-link $n2 $n0 8.0Mb 10ms DropTail $ns queue-limit $n2 $n
55 $ns duplex-link $n1 $n2 8.0Mb 10ms DropTail $ns queue-limit $n1 $n2 50 $ns duplex-link $n2 $n3 8.0Mb 10ms DropTail $ns queue-limit $n2 $n3 50 $ns duplex-link $n3 $n4 8.0Mb 10ms DropTail $ns queue-limit $n3 $n4 50 $ns duplex-link $n3 $n5 8.0Mb 10ms DropTail $ns queue-limit $n3 $n5 50 $ns duplex-link $n5 $n7 8.0Mb 10ms DropTail $ns queue-limit $n5 $n7 50 $ns duplex-link $n4 $n6 8.0Mb 10ms DropTail $ns queue-limit $n4 $n6 50 #Give node position (for NAM) $ns duplex-link-op $n2 $n0 orient left-up $ns duplex-link-op $n1 $n2 orient right-up $ns duplex-link-op $n2 $n3 orient right $ns duplex-link-op $n3 $n4 orient right-up $ns duplex-link-op $n3 $n5 orient right-down $ns duplex-link-op $n5 $n7 orient right $ns duplex-link-op $n4 $n6 orient right #Setup a TCP connection set tcp0 [new Agent/TCP/Vegas] $ns attach-agent $n0 $tcp0 set sink6 [new Agent/TCPSink] $ns attach-agent $n6 $sink6 $ns connect $tcp0 $sink6 $tcp0 set packetsize_ 1460 #Setup a UDP connection set udp1 [new Agent/UDP] $ns attach-agent $n1 $udp1 set null7 [new Agent/Null] $ns attach-agent $n7 $null7 $ns connect $udp1 $null7 55
56 $udp1 set packetsize_ 1500 $tcp0 set fid_ 1 $udp1 set fid_ 2 #Setup a FTP Application over TCP connection set cbr0 [new Application/Traffic/CBR] $cbr0 attach-agent $tcp0 $cbr0 set packetsize_ 1460 $cbr0 set rate_ ${rtmb $cbr0 set random_ null $ns at 0.01 "$cbr0 start" $ns at 40.0 "$cbr0 stop" #Setup a CBR Application over UDP connection set cbr1 [new Application/Traffic/CBR] $cbr1 attach-agent $udp1 $cbr1 set packetsize_ 1500 $cbr1 set rate_ ${rtmb $cbr1 set random_ null $ns at 0.01 "$cbr1 start" $ns at 40.0 "$cbr1 stop" #Define a 'finish' procedure proc finish { { global ns tracefile namfile rt $ns flush-trace close $tracefile close $namfile exec nam p6.nam & exec awk -f p6_tcp.awk -v var1=$rt p6.tr >> p61.tr & exit 0 $ns at $val(stop) "finish" $ns run 56
57 Output 57
58 Awk Script for calculating throughput of TCP and UDP BEGIN { tcp_sink=0; udp_sink=0 { if($1=="r" && $4 == 4){ tcp_sink += $6; if($1=="r" && $4 == 5 ){ udp_sink += $6; END { printf("%lf\t%lf\t%lf\n",var1,tcp_sink/ ,udp_sink/ ); 58
59 Newreno vs UDP Bandwidth TCP Newreno UDP
60 TCP vs UDP CBR Rate Throughput for TCP UDP
61 TCP vs UDP for 2 Mbps Link CBR Rate Throughput for TCP UDP
62 Throughput Throughput for Vegas UDP CBR Data Rate 62
Eexercise5: How to do Data Transmission between Nodes Using TCP in NS2
Eexercise5: How to do Data Transmission between Nodes Using TCP in NS2 In wireless network, nodes communicate using the communication model that consists of TCP agent, TCPSink agent, and FTP application.
More informationPart 5. Wireless Network
Introduction to NS-2 Part 5. Wireless Network Min Chen School of Computer Science and Engineering Seoul National University 1 Outline Introduction to Wireless Network An Example of Wireless Simulation
More informationPART A SIMULATION EXERCISES
PART A SIMULATION EXERCISES 1. Simulate a three nodes point to point network with duplex links between them. Set the queue size and vary the bandwidth and find the number of packets dropped. set ns [ new
More informationCDA6530: Performance Models of Computers and Networks. Chapter 10: Introduction to Network Simulator (NS2)
CDA6530: Performance Models of Computers and Networks Chapter 10: Introduction to Network Simulator (NS2) Some Contents are from. USC ISI Network Simulator (ns) Tutorial 2002 http://www.isi.edu/nsnam/ns/ns-tutorial/tutorial-02/index.html
More informationNetwork Simulator 2. Reti di Telecomunicazioni (CdL Ing. TLC) Telematica I (CdL Ing. INF) Ing. Carla Passiatore.
Network Simulator 2 Reti di Telecomunicazioni (CdL Ing. TLC) Telematica I (CdL Ing. INF) Ing. Carla Passiatore c.passiatore@poliba.it 1 NS2 wireless simulation Use NS to simulate Wireless Network Simple
More informationComparing ad-hoc wireless to wiredwireless
TNK092: Network Simulation/Nätverkssimulering Network Simulation---ns2 Lecture 6 wired-wireless simulation Comparing ad-hoc wireless to wiredwireless We are going to make modifications to the tcl script
More informationIJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY INVESTIGATION ON THE INTERNET OF THINGS Jin Wang *, Yi bin Hou *
IJESRT INTERNATIONAL JOURNAL OF ENGINEERING SCIENCES & RESEARCH TECHNOLOGY INVESTIGATION ON THE INTERNET OF THINGS Jin Wang *, Yi bin Hou * School of software engineering, Department of Information, Beijing
More informationANALYSIS OF SMART DEVICE GAME PROTOCOL
ENSC 427: COMMUNICATION NETWORKS SPRING 2013 ANALYSIS OF SMART DEVICE GAME PROTOCOL http://www.sfu.ca/~mea19/ Mehdi Elahi (mea19@sfu.ca) 301043763 Seyed Ahmari (mahmari@sfu.ca) 301124836 Bilal Nurhusien
More informationFACULTY OF ENGINEERING
FACULTY OF ENGINEERING LAB SHEET ETM 3056 - COMMUNICATIONS NETWORKS TRIMESTER 1 (2010/2011) CN1 COMMUNICATION PROTOCOLS ANALYSIS CN2 WIRELESS NETWORK SIMULATION Note: On-the-spot evaluation may be carried
More informationns-2 Tutorial Exercise (1)
ns-2 Tutorial Exercise (1) Multimedia Networking Group, The Department of Computer Science, UVA Jianping Wang Adopted from Nicolas s slides Jianping Wang, 2002 cs757 On to the Tutorial Work in group of
More informationNetwork Simulator 2. Telematica I (CdL Ing. INF) Ing. Giuseppe Piro.
Network Simulator 2 Telematica I (CdL Ing. INF) Ing. Giuseppe Piro g.piro@poliba.it 1 NS-2 Goals NS-2 is a Network Simulator - version 2 Can setup network topologies Generate packet traffic similar to
More informationThe Transport Control Protocol (TCP)
TNK092: Network Simulation - Nätverkssimulering Lecture 3: TCP, and random/short sessions Vangelis Angelakis Ph.D. The Transport Control Protocol (TCP) Objectives of TCP and flow control Create a reliable
More informationAn Introduction to NS-2
An Introduction to NS-2 * Roadmap For Today s Lecture 1. ns Primer 2. Extending ns Part I: ns Primer What is ns? Object-oriented, discrete event-driven network simulator Written in C++ and OTcl By VINT:
More informationNetwork Simulator 2 (NS2)
Network Simulator 2 (NS2) Basics and Mobility Management 1. Experiment 1 Let the following example be considered. All links in this network have a bandwidth of 1 Mbit/s. Please go through the tasks (1-1)
More informationScholars Research Library. Investigation of attack types in Ad Hoc networks and simulation of wormhole avoidance routing protocol
Available online at www.scholarsresearchlibrary.com European Journal of Applied Engineering and Scientific Research, 2012, 1 (4):207-215 (http://scholarsresearchlibrary.com/archive.html) ISSN: 2278 0041
More informationAnalysis and Performance Evaluation of Routing Protocols in MANETS
Analysis and Performance Evaluation of Routing Protocols in MANETS Team Effort by Ankita Mukherjee Roopashree N Department of Computer Science & Engineering, Santa Clara University Fall 2014 Preface Mobile
More informationSimple Data Link Protocols
Simple Data Link Protocols Goals 1) Become familiar with Network Simulator 2 2) Simulate Stop & wait and Sliding Window 3) Investigate the effect of channel with loss on link utilization Introduction Data
More informationMohammad Hossein Manshaei 1393
Mohammad Hossein Manshaei manshaei@gmail.com 1393 A brief Introduction to ns-2 2 Contents 1. Introduction to ns-2 2. ns-2 Components 3. Create a Basic ns-2 Model 4. Case Study: WiFi Simulation 5. Simulation
More informationNetwork Simulator 2: Introduction
Network Simulator 2: Introduction Presented by Ke Liu Dept. Of Computer Science SUNY Binghamton Spring, 2006 1 NS-2 Overview 2 NS-2 Developed by UC Berkeley Maintained by USC Popular simulator in scientific
More informationPart 6. Confidence Interval
Introduction to NS-2 Part 6. Confidence Interval Min Chen School of Computer Science and Engineering Seoul National University 1 Outline Definitions Normal Distribution Confidence Interval Central Limit
More informationWireless Networks - Preliminaries
This chapter describes an overview and classification of networks used for communication. A comparative simulation study regarding nature of wired and wireless network through commercially available simulators
More informationProject Network Simulation CSE 5346/4346
Project Network Simulation CSE 5346/4346 Project Overview This is a comprehensive project designed to be completed by 4 phases, and intended to demonstrate network performance and quality of service (QoS)
More informationTCP over Ad Hoc Networks : NS-2 Simulation Analysis. Ren Mao, Haobing Wang, Li Li, Fei Ye
TCP over Ad Hoc Networks : NS-2 Simulation Analysis Ren Mao, Haobing Wang, Li Li, Fei Ye Chapter 1 Introduction This report is for simulation of TCP transimition in Ad-hoc networks.to begin with,we have
More informationDMN1 : COMMUNICATION PROTOCOL SIMULATION. Faculty of Engineering Multimedia University
DMN1 : COMMUNICATION PROTOCOL SIMULATION Faculty of Engineering Multimedia University DMN1 Marking Scheme No Component Criteria Not answered 0 marks Poor 2 marks Acceptable 4 (max) marks 1 Viva Students
More informationABSTRACT. socialize with nearby users of common interest, but there exists no pre-established session
ii ABSTRACT An opportunistic network application is a scenario in which mobile node users socialize with nearby users of common interest, but there exists no pre-established session by which users register
More informationSimulations: ns2 simulator part I a
Simulations: ns2 simulator part I a Lecturer: Dmitri A. Moltchanov E-mail: moltchan@cs.tut.fi http://www.cs.tut.fi/ moltchan/modsim/ a Based on: Eitan Altman and Tania Jimenez NS Simulator for Beginners,...
More informationThe Network Simulator Fundamentals. Downloads and further info at:
ns-2 The Network Simulator Fundamentals Downloads and further info at: http://www.isi.edu/nsnam/ns 1 ns Primer Basic ns Architecture Basic Tcl, OTcl Elements of ns 2 ns Architecture Object-oriented (C++,
More informationSimulation with NS-2 and CPN tools. Ying-Dar Lin Department of Computer Science, National Chiao Tung University
Simulation with NS-2 and CPN tools Ying-Dar Lin Department of Computer Science, National Chiao Tung University Outline NS-2 simulator NS-2 basics Basic syntax Tracing a simple network Mini and term projects
More information1 What is network simulation and how can it be useful?
CESNET Technical Report 26/2003 Experience with using simulations for congestion control research Sven Ubik, ubik@cesnet.cz Jan Klaban, xklaban@quick.cz December 5, 2003 Abstract As part of the CESNET
More informationarxiv: v2 [cs.ni] 26 Jul 2010
arxiv:1007.4065v2 [cs.ni] 26 Jul 2010 A Tutorial on the Implementation of Ad-hoc On Demand Distance Vector (AODV) Protocol in Network Simulator (NS-2) Mubashir Husain Rehmani, Sidney Doria, and Mustapha
More informationENSC 427: COMMUNICATION NETWORKS SPRING 2014 FINAL PROJECT
ENSC 427: COMMUNICATION NETWORKS SPRING 2014 FINAL PROJECT VoIP Performance of City-Wide Wi-Fi and LTE www.sfu.ca/~tly/webpage.html Ou, Cheng Jie 301144355 Yang, Tian Lin 301107652
More informationBrief Overview and Background
Brief Overview and Background In this assignment you will be studying the performance behavior of TCP, using ns 2. At the end of this exercise, you should be able to write simple scripts in ns 2 as well
More informationns-2 Tutorial Contents: Today Objectives of this week What is ns-2? Working with ns-2 Tutorial exercise ns-2 internals Extending ns-2
ns-2 Tutorial Contents: Objectives of this week What is ns-2? Working with ns-2 Tutorial exercise ns-2 internals Extending ns-2 Today Partly adopted from Nicolas slides. 1 Objectives of this week Get some
More informationBabak Shahabi ( ), Shaoyun Yang ( ) Team # 7
www.sfu.ca/~bshahabi Babak Shahabi (301102998), Shaoyun Yang (301133524) bshahabi@sfu.ca yshaoyun@sfu.ca Team # 7 1 Table of contents Contents Contents... 2 Related Works... 5 1. Mobile IP overview...
More informationPerformance Analysis of Routing Protocols
IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 08, Issue 5 (May. 2018), VI PP 69-77 www.iosrjen.org Performance Analysis of Routing Protocols N Dinesh Kumar 1, V.S
More informationEE 122: Computer Networks Network Simulator ns2
EE 122: Computer Networks Network Simulator ns2 Department of Electrical Engineering and Computer Sciences University of California, Berkeley Berkeley, CA 94720-1776 Adapted from F04 Slides K. Fall, J.
More informationLAMPIRAN. set ns [new Simulator]
LAMPIRAN set ns [new Simulator] $ns color 0 pink $ns color 1 red $ns color 2 green $ns color 3 yellow $ns color 4 brown $ns color 5 purple $ns color 6 black $ns color 7 grey $ns color 8 maroon set n0 [$ns
More informationns-2 Tutorial (1) Multimedia Networking Group, The Department of Computer Science, UVA Jianping Wang Jianping Wang, 2002 cs757 1
ns-2 Tutorial (1) Multimedia Networking Group, The Department of Computer Science, UVA Jianping Wang Jianping Wang, 2002 cs757 1 Contents: Objectives of this week What is ns-2? Working with ns-2 Tutorial
More informationNS-2 Tutorial. Kumar Viswanath CMPE 252a.
NS-2 Tutorial Kumar Viswanath CMPE 252a kumarv@cse.ucsc.edu 1 What is ns-2? ns-2 stands for Network Simulator version 2. ns-2: Is a discrete event simulator for networking research packet level simulator.
More informationQoS in Network Simulator 2
QoS in Network Simulator 2 This experiment provides experience in how to apply and simulate QoS mechanisms in communication networks by means of NS2. We focus on RSVP in this experiment. 1. RSVP in NS2
More informationSimulation-Based Comparative Study of Routing Protocols for Wireless Ad-Hoc Network
Master s Thesis Electrical Engineering September 2014 Simulation-Based Comparative Study of Routing Protocols for Wireless Ad-Hoc Network Jani Saida Shaik School of Computing Blekinge Institute of Technology
More informationIntroduction. Ns Tutorial Ns Goals. SAMAN and CONSER Projects. Ns Status. Ns functionalities
Introduction Ns Tutorial 2002 Padmaparna Haldar (haldar@isi.edu) Xuan Chen (xuanc@isi.edu) Nov 21, 2002 1989: REAL network simulator 1995: DARPA VINT project at LBL, Xerox PARC, UCB, and USC/ISI Present:
More informationPart 3. Result Analysis
Introduction to NS-2 Part 3. Result Analysis Min Chen School of Computer Science and Engineering Seoul National University 1 Outline A Simulation and its results The Format of Trace File The AWK language
More informationS Ns2 simulation exercise
S-38.3148 Ns2 simulation exercise Fall 2007 1 Table of contents 1. Introduction... 3 2. Theoretical background... 3 2.1. IEEE 802.11 MAC protocol... 3 2.2. Overview of TCP s congestion control... 4 2.3.
More informationChannabasaveshwara Institute of Technology. (An ISO 9001:2008 Certified Institution) NH 206 (B.H. Road), Gubbi, Tumkur Karnataka.
Channabasaveshwara Institute of Technology (An ISO 9001:2008 Certified Institution) NH 206 (B.H. Road), Gubbi, Tumkur 572 216. Karnataka. QMP 7.1 D/F Department of Computer Science & Engineering Network
More informationTcl script 2
Ns : 5... 1 5...nam ns 6... ns 6... nam 1.1 1.2 1.3 7... Tcl script 2 8... 9... 10... 2.1 2.2 2.3 12... 3 13... ( ) 14... 16... 17... 3.1 3.2 3.3 3.4 18... 4 18... 20... 4.1 4.2 22... Xgraph 5 22... 5.1
More informationS Quality of Service in Internet. Introduction to the Exercises Timo Viipuri
S-38.180 Quality of Service in Internet Introduction to the Exercises Timo Viipuri 8.10.2003 Exercise Subjects 1) General matters in doing the exercises Work environment Making the exercises and returning
More informationEvaluation of Epidemic Routing Protocol in Delay Tolerant Networks
Evaluation of Epidemic Routing Protocol in Delay Tolerant Networks D. Kiranmayi Department of CSE, Vignan s Institute Of IT, Visakhapatnam, India ABSTRACT:There are many routing protocols that which can
More informationENSC 427. Group 05 - Final Report UMTS Cellular & Wi- Fi Network Simulation in NS- 2 3/17/2012
2012 ENSC 427 Group 05 - Final Report UMTS Cellular & Wi- Fi Network Simulation in NS- 2 Gyuhan David Choi Seungjae Andy Back Calvin Chun Kwan Ho gca16@sfu.ca sjb18@sfu.ca cch8@sfu.ca 3/17/2012 Contents
More informationModeling of data networks by example: ns-2 (I)
Modeling of data networks by example: ns-2 (I) Holger Füßler Holger Füßler Course overview 1. Introduction 7. NS-2: Fixed networks 2. Building block: RNG 8. NS-2: Wireless networks 3. Building block: Generating
More informationICE 1332/0715 Mobile Computing (Summer, 2008)
ICE 1332/0715 Mobile Computing (Summer, 2008) Ns-2 Laboratory Prof. Chansu Yu http://academic.csuohio.edu/yuc/ In-Class Lab: Mobile IP 5 nodes 2 wired nodes, W(0) and W(1) 2 mobile agents, HA and FA A
More informationLAN-WAN-LAN end-to-end Network Simulation with NS2
International Journal of Applied Engineering Research ISSN 0973-4562 Volume 13, Number 17 (2018) pp 13136-13140 Research India Publications http://wwwripublicationcom LAN-WAN-LAN end-to-end Network Simulation
More informationFlow Control Packet Marking Scheme: to identify the sources of Distributed Denial of Service Attacks
Flow Control Packet Marking Scheme: to identify the sources of Distributed Denial of Service Attacks A.Chitkala, K.S. Vijaya Lakshmi VRSE College,India. ABSTRACT-Flow Control Packet Marking Scheme is a
More informationJohn Heidemann, USC/ISI and Polly Huang, ETH-Zurich 14 March 2002
QVWKHQHWZRUNVLPXODWRU,3$07XWRULDO 1HWZRUN0RGHOLQJDQG7UDIILF $QDO\VLVZLWKQV John Heidemann, USC/ISI and Polly Huang, ETH-Zurich 14 March 2002 a discrete event simulator simple model focused on modeling
More informationWIRELESS NETWORK STUDY AND ANALYSIS USING NS2 SIMULATOR
UNIVERSITY OF VAASA FACULTY OF TECHNOLOGY TELECOMMUNICATIONS ENGINEERING Xiang Chao WIRELESS NETWORK STUDY AND ANALYSIS USING NS2 SIMULATOR Master s thesis for the degree of Master of Science in Technology
More informationPerformance Analysis of WLAN MAC algorithms
MEE10:91 Performance Analysis of WLAN MAC algorithms Author: Ramaz Samhan Amer Khoulani Supervisor: Dr. Jorgen Nordberg A Thesis Presented in partial fulfillment of the requirements for the degree of Master
More informationS Ns2 simulation exercise
S-38.148 Ns2 simulation exercise 1. Introduction...3 2. Theoretical background...3 2.1. Overview of TCP s congestion control...3 2.1.1. Slow start and congestion avoidance...4 2.1.2. Fast Retransmit...4
More informationProject report Cross-layer approach in mobile as hoc routing by
Project report Cross-layer approach in mobile as hoc routing by Alexandre Boursier boursier@kom.aau.dk Stéphane Dahlen sdahlen@kom.aau.dk Julien Marie-Françoise mariefra@kom.aau.dk Thior Santander Marin
More information[1] Chowdhury, A. K., Ibrahim, M., Shanmugam, V., Singh, A. K. (2013). [2] Chowdhury, A. K., Raj, N., Singh, A. K., Area efficient MAX operator for
References [1] Chowdhury, A. K., Ibrahim, M., Shanmugam, V., Singh, A. K. (2013). Multiple valued logic (MVL) reduction operator, its synthesis and application on network congestion. Proceeding of 7th
More informationPESIT Bangalore South Campus. Department OF Information Science & Engineering
PESIT Bangalore South Campus 1Km before Electronic City, Hosur Road, Bangalore-560100. Department OF Information Science & Engineering COMPUTER NETWORK LABORATORY 15CSL57 Lab Manual 2017-18 Introduction
More informationComparison of AODV, DSR, and DSDV Routing Protocols in a Wireless Network
Comparison of AODV, DSR, and DSDV Routing Protocols in a Wireless Network Pushpender Sarao Hyderabad Institute of Technology and Management, Hyderabad-1401, India Email: drpushpendersarao@gmail Abstract
More informationUSE OF THE NETWORK SIMULATOR NS-2 TOOL IN LECTURES
USE OF THE NETWORK SIMULATOR NS-2 TOOL IN LECTURES Petr Berka, Petr Hujka Department of Telecommunications, Brno University of Technology, Purkynova 118, 612 00 Brno, Czech Republic, phone: +420 5 41149190,
More informationCSE 573S Protocols for Computer Networks (Spring 2005 Final Project)
CSE 573S Protocols for Computer Networks (Spring 2005 Final Project) To Investigate the degree of congestion control synchronization of window-based connections bottlenecked at the same link Kumar, Vikram
More informationTutorial Schedule. Introduction Ns fundamentals Ns programming internal Extending ns-2 Simulator. Sep. 25,
NS-2 Tutorial Presenter: Qing (Kenny) Shao (SFU/CNL) Author: Polly Huang (AT&T Labs Research) Padmaparna Haldar (USC/ISI) Xuan Chen (USC/ISI) Communication Networks Laboratory http://www.ensc.sfu.ca/research/cnl
More informationQMP 7.1 D/F Channabasaveshwara Institute of Technology (An ISO 9001:2008 Certified Institution) NH 206 (B.H. Road), Gubbi, Tumkur Karnataka.
QMP 7.1 D/F Channabasaveshwara Institute of Technology (An ISO 9001:2008 Certified Institution) NH 206 (B.H. Road), Gubbi, Tumkur 572 216. Karnataka. Department of Computer Science & Engineering LAB MANUAL
More informationA BENEFICIAL ANALYSIS OF NODE DEPLOYMENT SCHEMES FOR WIRELESS SENSOR NETWORKS
A BENEFICIAL ANALYSIS OF NODE DEPLOYMENT SCHEMES FOR WIRELESS SENSOR NETWORKS G Sanjiv Rao 1 and V Vallikumari 2 1 Associate Professor, Dept of IT, Sri Sai Aditya Institute of Science And Technology, Surampalem,
More informationModeling of data networks by example: NS-2 (II)
Modeling of data networks by example: NS-2 (II) Holger Füßler H. Füßler Course overview 1. Introduction 7. NS-2: Fixed networks 2. Building block: RNG 8. NS-2: Wireless networks 3. Building block: Generating
More informationPart 3: Network Simulator 2
S-38.148 Simulation of data networks / fall-04 Part 3: Network Simulator 2 24.11.2004 1 NS2: Contents NS2 Introduction to NS2 simulator Background info Main concepts, basics of Tcl and Otcl NS2 simulation
More informationS Ns2 simulation exercise
S-38.148 Ns2 simulation exercise Table of contents 1. Introduction...3 2. Theoretical background...3 2.1. Overview of TCP s congestion control...3 2.1.1. Slow start and congestion avoidance...4 2.1.2.
More informationSimulation and Analysis of Impact of Buffering of Voice Calls in Integrated Voice and Data Communication System
Simulation and Analysis of Impact of Buffering of Voice Calls in Integrated Voice and Data Communication System VM Chavan 1, MM Kuber 2 & RJ Mukhedkar 3 1&2 Department of Computer Engineering, Defence
More informationECEN Final Exam Fall Instructor: Srinivas Shakkottai
ECEN 424 - Final Exam Fall 2013 Instructor: Srinivas Shakkottai NAME: Problem maximum points your points Problem 1 10 Problem 2 10 Problem 3 20 Problem 4 20 Problem 5 20 Problem 6 20 total 100 1 2 Midterm
More informationNetwork Simulator 2: Introduction
Network Simulator 2: Introduction Presented by Ke Liu Dept. Of Computer Science SUNY Binghamton Spring, 2006 1 NS-2 Overview 2 NS-2 Developed by UC Berkeley Maintained by USC Popular simulator in scientific
More informationEvaluation Strategies. Nick Feamster CS 7260 February 26, 2007
Evaluation Strategies Nick Feamster CS 7260 February 26, 2007 Evaluation Strategies Many ways to evaluate new protocols, systems, implementations Mathematical analysis Simulation (ns, SSFNet, etc.) Emulation
More informationImplementation of Wired and Wireless Networks, Analysis Simulation and Result Comparison Using Ns2
Implementation of Wired and Wireless Networks, Analysis Simulation and Result Comparison Using Ns2 1 S.Jeneeth Subashini, 2 D. Guna Shekar, 3 C.Harinath Reddy, 4 M. Manikanta 1,2,3,4 ECE, Final year students,
More informationMANET With ADMEN SIMULATION
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 6.017 IJCSMC,
More informationPerformance of a Wi-Fi Network as a function of Distance and Number of Connections in a School Environment
Performance of a Wi-Fi Network as a function of Distance and Number of Connections in a School Environment Group 1 Rajdeep Bhullar - 301187037 Kamal Ezz - 301213002 Daniel Quon 301170142 http://www.sfu.ca/~rsa83/
More informationNSIS for NS-2. N4 TCP connection. Figure 1: TCP connection reuse
NSIS for NS-2 NSIS (Next Steps in Signalling) is a signalling framework being developed by the IETF, based on various signalling protocols, of which the Resource Reservation Protocol (RSVP) is the corner
More informationA Study on the Behaviour of SAODV with TCP and SCTP Protocols in Mobile Adhoc Networks
International Journal of Research in Advent Technology, Vol.6, No.8, August 218 A Study on the Behaviour of SAODV with TCP and SCTP Protocols in Mobile Adhoc Networks S. Mahalakshmi 1, Dr. K. Geetha 2
More informationCS 421: COMPUTER NETWORKS SPRING FINAL May 21, minutes
CS 421: COMPUTER NETWORKS SPRING 2015 FINAL May 21, 2015 150 minutes Name: Student No: Show all your work very clearly. Partial credits will only be given if you carefully state your answer with a reasonable
More informationInterface The exit interface a packet will take when destined for a specific network.
The Network Layer The Network layer (also called layer 3) manages device addressing, tracks the location of devices on the network, and determines the best way to move data, which means that the Network
More informationSTUDY OF PERFORMANCE OF ROUTING PROTOCOLS FOR MOBILE ADHOC NETWORKING IN NS-2
STUDY OF PERFORMANCE OF ROUTING PROTOCOLS FOR MOBILE ADHOC NETWORKING IN NS-2 A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Bachelor of Technology In Computer Science
More informationCHAPTER 4 SIMULATION MODEL AND PERFORMANCE METRICS
59 CHAPTER 4 SIMULATION MODEL AND PERFORMANCE METRICS 4.1 OVERVIEW OF SIMULATION MODEL The performance of a MANET routing protocol under varying network conditions is to be evaluated in order to understand
More informationCOMPARISON OF DIFFERENT VERSIONS OF TCP IN
SONG XING COMPARISON OF DIFFERENT VERSIONS OF TCP IN 802.11 WLANS Master of Science Thesis Examiner: Yevgeni Koucheryavy Dmitri Moltchanov Examiner and topic approved by the Faculty Council of the Faculty
More informationCongestions control through cloud computing with MANET
Congestions control through cloud computing with MANET Ajey Singh 1, Maneesh Shrivastava 2 Department of Information Technology 1,2 Lakshmi Narain College of Technology Bhopal, India 1,2 Abstract Adhoc
More informationHubs. twisted pair. hub. 5: DataLink Layer 5-1
Hubs Hubs are essentially physical-layer repeaters: bits coming from one link go out all other links at the same rate no frame buffering no CSMA/CD at : adapters detect collisions provides net management
More informationA Case Based Study to Identify Malicious Node in Packet Routing
A Case Based Study to Identify Malicious Node in Packet Routing Suhasini Sodagudi #1, Dr.Rajasekhara Rao Kurra *2 # Associate Professor, Department of Information Technology, VRSiddhartha Engineering College
More informationNext Steps Spring 2011 Lecture #18. Multi-hop Networks. Network Reliability. Have: digital point-to-point. Want: many interconnected points
Next Steps Have: digital point-to-point We ve worked on link signaling, reliability, sharing Want: many interconnected points 6.02 Spring 2011 Lecture #18 multi-hop networks: design criteria network topologies
More informationEEL6951 Project: Simulation of LDoS Attack in Ad-hoc Network by Y. He et al. I. Introduction
EEL6951 Project: Simulation of LDoS Attack in Ad-hoc Network by Y. He et al. By Paul Muri, Carlo Pascoe, and Brian Sapp I. Introduction Research Paper: LDoS Attack in Ad-hoc Network by Y. He et al. Citation:
More informationStudying Fairness of TCP Variants and UDP Traffic
Studying Fairness of TCP Variants and UDP Traffic Election Reddy B.Krishna Chaitanya Problem Definition: To study the fairness of TCP variants and UDP, when sharing a common link. To do so we conduct various
More informationMedium Access Protocols
Medium Access Protocols Summary of MAC protocols What do you do with a shared media? Channel Partitioning, by time, frequency or code Time Division,Code Division, Frequency Division Random partitioning
More informationCS 421: COMPUTER NETWORKS SPRING FINAL May 16, minutes
CS 4: COMPUTER NETWORKS SPRING 03 FINAL May 6, 03 50 minutes Name: Student No: Show all your work very clearly. Partial credits will only be given if you carefully state your answer with a reasonable justification.
More informationUNIVERSITY OF NAIROBI STABILITY OF TCP/IP PROTOCOLS
UNIVERSITY OF NAIROBI STABILITY OF TCP/IP PROTOCOLS PROJECT INDEX: PRJ 148 BY NAME: NJERU PATRICK MAGOCHI REG. NO: F17/1360/2010 SUPERVISOR: DR. G.S. ODHIAMBO EXAMINER: PROF. V.K. ODUOL Project report
More informationAppendix B. Standards-Track TCP Evaluation
215 Appendix B Standards-Track TCP Evaluation In this appendix, I present the results of a study of standards-track TCP error recovery and queue management mechanisms. I consider standards-track TCP error
More informationThis manual is for informational purposes only. TETCOS MAKES NO WARRANTIES, EXPRESS, IMPLIED OR STATUTORY, AS TO THE INFORMATION IN THIS DOCUMENT.
Experiment Manual 1 The information contained in this document represents the current view of TETCOS on the issues discussed as of the date of publication. Because TETCOS must respond to changing market
More informationReview: Performance Evaluation of TCP Congestion Control Mechanisms Using Random-Way-Point Mobility Model
Review: Performance Evaluation of TCP Congestion Control Mechanisms Using Random-Way-Point Mobility Model Rakesh K Scholar (M.Tech) The Oxford College of Engineering Bangalore Mrs. Kalaiselvi Asst. Prof,
More informationInternational Journal of Intellectual Advancements and Research in Engineering Computations. Efficient routing protocol for MANET using.
www.ijiarec.com ISSN:2348-2079 Volume-5 Issue-1 International Journal of Intellectual Advancements and Research in Engineering Computations Efficient routing protocol for MANET using STP and BRM First
More informationPERFORMANCE COMPARISON OF THE DIFFERENT STREAMS IN A TCP BOTTLENECK LINK IN THE PRESENCE OF BACKGROUND TRAFFIC IN A DATA CENTER
PERFORMANCE COMPARISON OF THE DIFFERENT STREAMS IN A TCP BOTTLENECK LINK IN THE PRESENCE OF BACKGROUND TRAFFIC IN A DATA CENTER Vilma Tomço, 1 Aleksandër Xhuvani 2 Abstract: The purpose of this work is
More informationEFFICIENT ROUTING AND FALSE NODE DETECTION IN MANET
International Conference on Information Engineering, Management and Security [ICIEMS] 27 International Conference on Information Engineering, Management and Security 2015 [ICIEMS 2015] ISBN 978-81-929742-7-9
More informationLecture 9 The Data Link Layer part II. Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it
Lecture 9 The Data Link Layer part II Antonio Cianfrani DIET Department Networking Group netlab.uniroma1.it Physical Addresses Physical (or LAN or MAC) address: 48 bit string Hexadecimal representation
More informationNetwork Simulator Version 2 for VANET
International Journal of Scientific Research in Computer Science, Engineering and Information Technology 2017 IJSRCSEIT Volume 2 Issue 5 ISSN : 2456-3307 Network Simulator Version 2 for VANET Venkatatamangarao
More information