Professional Documents
Culture Documents
Tutorial 6
Tutorial 6
Networks
Tutorial 6
By: Mariham Wasfy
Outline
• Random Access Dynamic MAC
Outline
• Random Access Dynamic MAC
ALOHA
Slotted ALOHA
o CSMA
o CSMA/CD
Random Access MAC
ALOHA
Slotted ALOHA
o CSMA
o CSMA/CD
Random Access MAC
ALOHA
Slotted ALOHA
o CSMA
o CSMA/CD
CSMA
• Carrier Sense
SENSE Medium
Medium Access
Access
Busy
Don’t send the frame
Idle (Free)
Send the frame
CSMA
• Vulnerable Period = Tprop
A 0 2
A B
Ttrans = 2
Tprop = 1 B
0 1 3
C
1 3
D
1 3
D C
CSMA
• Types:
P 1-P
Success Failure
1-
1- Non-
Non- P-
P-
Persistent
Persistent Persistent
Persistent Persistent
Persistent
Run
Exponential
Backoff
Algorithm
CSMA
• Collision
Run Exponential
Backoff Algorithm
1-
1- Non-
Non- P-
P-
Persistent
Persistent Persistent
Persistent Persistent
Persistent
CSMA
• Example
Ttrans = 2 A 0 2
A B
Tprop A-B = 2
Tprop A-C = 1 B
0 1 2 3 4
C
1 3
C
Random Access MAC
ALOHA
Slotted ALOHA
o CSMA
o CSMA/CD
CSMA/CD
• Carrier Sense Medium Access / Collision
COLLISION Detection
DETECTION
A 0 2
A B
Ttrans = 2
Tprop = 1 B
0 1 2 3 4
C
1 3
Abort transmission
when collision detected
C
CSMA/CD
• Vulnerable Period = Tprop
A 0 2
A B
Ttrans = 2
Tprop = 1 B
0 1 3
C
1 3
D
1 3
D C
NB: Number of trials NB = 0
CSMA and CSMA/CD CW: Clear window
BE: Backoff window
CW = 2
BE = min_BE
• Exponential Backoff Algorithm
Choose and wait
R value from 0 to R (time)
Ttrans = = 12 msec
a. Non-persistent CSMA
b. Non-persistent CSMA/CD
tB = 0.5 t
a. Non-persistent CSMA ttrans = 4 t
B
tprop A-B = tprop A-C = t
tprop B-C = 0 t
A
A tA = 0 t
0 1.5 t 4t 5.5 t
C
B tC = 1.5 t
0.5 tt 4.5 t5 t
Busy doesn’t send and will back off
C
0.5 tt 4.5 t5 t
1.5 t
tB = 0.5 t
a. Non-persistent CSMA ttrans = 4 t
B
tprop A-B = tprop A-C = t
tprop B-C = 0 t
A
A tA = 0 t
0 4t
C
B tC = 1.5 t
0.5 t 4.5 t
C
tB = 0.5 t
b. Non-persistent CSMA/CD ttrans = 4 t
B
tprop A-B = tprop A-C = t
tprop B-C = 0 t
A
A tA = 0 t
0 1.5 t 2 t 4t
C
B tC = 1.5 t
0.5 t t 5t
Busy doesn’t send and will back off
C
0.5 t tt 5t
1.5 t
tB = 0.5 t
b. Non-persistent CSMA/CD ttrans = 4 t
B
tprop A-B = tprop A-C = t
tprop B-C = 0 t
A
A tA = 0 t
0 1.5 t
C
B tC = 1.5 t
0.5 t t
C
3. Consider the network shown below where terminals A, B, C and D are
communicating over a bus with a central station. The transmission time for packets
from terminal B and C is t units while the transmission time for packets from
terminals A and D is 0.5 units.
From 0 to 2 t
From 4 t to 5.5 t
From 6 t to further
d. All 4 packets received correctly at
central station
A B C D
Send
1.5 t 0.5 t 2t 2t
at 2.5 t 2.5
5ttt
4.5
Tt 0.5 t t t 0.5 t Backoff
Tprop A-C t
Cross multiplication
Distance Tprop
4d t
xx== == =
3dd
2 x
A B H C
Send
0 0.75
1.75 tt 2.75
3t t 2.5 ttt
3.25
5.75
at
Tt t t t t
Backoff
A - B 0.5t B - A 0.5t H-A2t C-At
Tp A - H 0.25t B – H 0.25t H - B 0.25t C - B 0.5 t
A-Ct B - C 0.5t H - C 0.75t C - H 0.75t
1- Non- 1- 1-
Prot Backoff
persistant persistent persistant persistant
ocol
CSMA/CD CSMA/CD CSMA/CD CSMA/CD
Back
2 slots 1 slot 1 slot 2 slots
off