Introduction to Network Simulator
Mouhamad IBRAHIM and Giovanni NEGLIA
mibrahim@sophia.inria.fr, gneglia@sophia.inria.fr www-sop.inria.fr/maestro/personnel/Giovanni.Neglia/ns course/ns course.htm
Maestro team INRIA Sophia-Antipolis - France
– p.1/??
Introduction to Network Simulator Mouhamad I BRAHIM and Giovanni N - - PowerPoint PPT Presentation
Introduction to Network Simulator Mouhamad I BRAHIM and Giovanni N EGLIA mibrahim@sophia.inria.fr, gneglia@sophia.inria.fr www-sop.inria.fr/maestro/personnel/Giovanni.Neglia/ns course/ns course.htm Maestro team INRIA Sophia-Antipolis - France
mibrahim@sophia.inria.fr, gneglia@sophia.inria.fr www-sop.inria.fr/maestro/personnel/Giovanni.Neglia/ns course/ns course.htm
– p.1/??
– p.2/??
directly among them.
– p.3/??
– p.4/??
WT WT WT
WT WT WT AP AP Distributed System (DS) BSS BSS
– p.5/??
– p.6/??
Node A is transmitting to node B. When node C has a packet to transmit to node B, it will sense an idle channel as it is out of range of A. Therefore it starts its transmission which causes collision at B which is in the range of A and C. Similarly, node A is hidden to node C.
C B A
– p.7/??
– p.8/??
– p.9/??
a.
If the packet is successfully transmitted (node receives an ACK), the node resets its CW to CWmin, and proceeds with next packet. If the ACK times out, the node computes a new random backoff time with a higher CW: CWi+1 = 2 ∗ CWi
PACKET A ACK ACK busy medium SIFS DIFS DIFS 4 DIFS DIFS Slot Time Slot Time Slot Time 5: frozen backoff time 8 7 6 5 3 2 1 0 STATION B STATION A
aFigure taken from "Performance Analysis of the IEEE 802.11 Distributed
Coordination Function", by Giuseppe Bianchi
– p.10/??
Model taken from the paper: Performance Analysis of the IEEE 802.11 Distributed Coordination Function, by Giuseppe Bianchi
0, 0 0, 1 0, 2 0, CW0 − 1 i, 0 i, 1 i, 2 i, CWi − 1 m, 0 m, 1 m, 2 m − 1, 0
· · · · · · · · ·
i − 1, 0 p/CWm p/CWm p/CWi (1 − p)/CW0 p/CW1
· · · · · · · · ·
p/CWi+1
· · · · · · · · · · · · · · · · · · · · · · · ·
m, CWm − 1
– p.11/??
Throughput: reflects the efficiency of using channel resources. It is the fraction of the channel capacity used to transmit usefull data. Packet
Delay: is the amount of time spent by a packet to successfully reach its destination, taking into account queuing delays, retransmission delays etc. Fairness: it is the capability to distribute the available resources equally among the nodes. When we intend to support QoS, fairness is hence defined as the capability to distribute bandwidth in proportion to their intended allocation. Power consumption: Power consumption is critical since it is decreases battery life of the wireless nodes. Collision and subsequent retransmissions are the main factors influencing the energy consumption
– p.12/??
– p.13/??
– p.14/??
– p.15/??
– p.16/??
set topo [new Topography] $topo load_flatgrid <X> <Y> This initializes the grid for the topography object. <X> and <Y> are the x-y coordinates for the topology and are used for sizing the grid.
– p.17/??
– p.18/??
$ns_ node-config -addressingType <usually flat or hierarchical used for wireless topologies> \
DSR, TORA, AODV, DumbAgent > \
Queue/DropTail/PriQueue> \
\
Propagation/TwoRayGround or Propagation/FreeSpace> \
Phy/WirelessPhy> \
Channel/WirelessChannel> \
– p.19/??
OFF> \
OFF> \
\
turned ON or OFF>
– p.20/??
– p.21/??
– p.22/??
– p.23/??
– p.24/??
There are six identical fixed wireless nodes uniformly distributed within a square area of 100 × 100 m2. The propagation model is FreeSpace and the queue length of each node is assumed set to 100. Using the default physical parameter values of the model, transmission range of each node is in the order of 250 m. There are three sources nodes working in saturation conditions which run CBR applications, and three receiving
The first source starts at t1 = 20s, the second at t2 = 40s, and the third at t3 = 60s. All the sources stop at t4 = 100s. Plot on the same graph the maximal throughput in bits/s
Conclude. Hint: Trace all the events and turn ON agentTrace and let OFF the other
– p.25/??