08 S Csma

Slotted Carrier Sense Multiple Access
Dr. José Jaime Camacho Escoto
2022-1
Dr. José Jaime Camacho Escoto Slotted Carrier Sense Multiple Access 2022-1 1 / 23
Outline
1 Goal
2 Introduction
3 Analysis
Throughput
4 Homework
5 Bibliography
Goal
Goal
The student will understand the basics of Slotted CSMA protocols as long
as it’s formal modeling.
Introduction
Slotted Carrier Sense Multiple Access
Devices willing to transmit wait for the next slot.

When in the begining of the following slot, it listens to the channel
and then transmit if no device was transmitting.
If the channel is sensed busy, the packet is re-scheduled (NP-CSMA)
or wait until it’s not busy anymore (1P-CSMA).
When two devices sense the channel and both decide to transmit,
collissions might occur.
When a collission occurs, the packet ir re-scheduled.
Introduction
Disadvantages
Hidden terminal.
In highly congested networks, many collissions might occur.
Starvation might occur.
Need of synchronization.
Analysis
Assumptions
The same as other CSMA analysis.

Time is slotted with each slot sizr equal to τ .
Carrier sensing can be done in zero time.
Al packets are of the same length and require T seconds to transmit.
T is an integer multiple of τ .
Analysis
Successful Tranmission [2, 1]
Denote B̃ as the duration of the busy (transmission) period, and let B

its mean.
Let I˜ the duration of the idle period (with mean I).
Let Ũ be the time duration within the transmission period in which a
successful packet is being transmitted (mean U).
The throughput is given by
U
S= (1)
B +I
Analysis
Idle Period [2, 1]
The idle period will be one slot if it arrived at least one packet in the
first slot.
The idle period will be two slot if no packets arrived during the first
slot and it arrived at least one packet in the second slot slot.
The hseries can
i be written as
˜ k−1
P I = kτ = [1 − (1 − e −g τ )] (1 − e −g τ ) k = 1, 2, 3 (2)
h i X∞
k−1
˜ kτ 1 − 1 − e −g τ 1 − e −g τ

E I = (3)
k=1
To simplify, we will substitute p = 1 − e −g τ

h i X ∞
E I˜ = kτ p (1 − p)k−1 (4)
k=1
Analysis
Idle Period [2, 1]
h i ∞
X
E I˜ = τ p k (1 − p)k−1 (5)
k=1
∞
" #
d X k d 1−p
= τp − (1 − p) = τ p − (6)
dp dp p
k=1

d −1
d −1
= τp 1−p = τp −p (7)
dp dp
τ
= τ p p −2 =

(8)
p
τ
I = (9)
1 − e −g τ
Analysis
Busy Period [2, 1]
Every transmission sill last exactly T + τ seconds.

A collision occurs if two or more arrive within the same slot.
A busy period will contain k transmission periods if there is at least
one arrival in the last slot of each of the first k − 1 transmission
periods and no arrival in the last slot of the kth transmission period.
h i k−1 −g τ
Prob B̃ = k (T + τ ) = 1 − e −g τ e (10)
h i X ∞
k−1 −g τ
E B̃ = k (T + τ ) 1 − e −g τ e (11)
k=1
h i ∞
X k−1 −g τ
E B̃ = (T + τ ) k 1 − e −g τ e (12)
k=1
Analysis
Busy Period [2, 1]
We substitute p = e −g τ
h i ∞
X
E B̃ = (T + τ ) kp (1 − p)k−1 (13)
k=1
Following the same procedure of the idle period we obtain

h i 1
E B̃ = (T + τ ) (14)
p
T +τ
B= (15)
e −g τ
Analysis
Useful Period [2, 1]
When a successful transmission occurs, useful information is carried

for T seconds.
Since transmissions last for T + τ seconds, the number of
transmission periods during B̃ is TB̃+τ .
Then, we can compute U as
h i B
E Ũ = T Psuc (16)
T +τ
Analysis
To compute Psuc as

Single arrival in last slot
Psuc = Prob | some arrivals (17)
before the transmission period
Given the conditional probability formula

P (A ∩ B)
P (A | B) = (18)
P (B)
Prob [Single arrival in last slot]
Psuc = (19)
Prob [Some arrivals in last slot]
Analysis
Poisson process states that

(λt)j −λt
Pj (t) = e (20)
j!
Where j is the number of occurrences ultil time t.
We will define j = 1 and t = τ obtaining:
(g τ )1 −g τ
P1 (τ ) = e = g τ e −g τ (21)
1!
Finally
g τ e −g τ
Psuc = (22)
1 − e −g τ
Analysis
Replacing equations 15 and 22 in 16 we obtain

T +τ

g τ e −g τ

e −g τ
U=T (23)
T + τ 1 − e −g τ
(T + τ ) Tg τ e −g τ
U= (24)
(T + τ ) (e −g τ ) (1 − e −g τ )
Tg τ
U= (25)
1 − e −g τ
Analysis Throughput
Outline
1 Goal
2 Introduction
3 Analysis
Throughput
4 Homework
5 Bibliography
Analysis Throughput
Throughput [2, 1]
Recall equation 1 and substituting 9, 15 and 25 we obtain

Tg τ
1−e −g τ
S= (26)
T +τ τ

e −g τ
+ 1−e −g τ
Reducing
Tg τ
1−e −g τ
S= (T +τ )(1−e −g τ )+τ e −g τ
(27)
e −g τ (1−e −g τ )
Tg τ e −g τ
S= (28)
T +τ − Te −g τ − τ e −g τ + τ e −g τ
Tg τ e −g τ
S= (29)
T + τ − Te −g τ
Analysis Throughput
Throughput [2, 1]
τ
Using α = T abd G = gT we have
αGe −αG
S= (30)
1 + α − e −αG
Analysis Throughput
Throughput [2, 1]
Now let’s find the maximum value of S

α (α + 1) e αG (αG − 1) + 1

0
S =− 2
(31)
((α + 1) e αG − 1)
Solving we obtain

1
W − eα+e +1
G= (32)
α
Where W is the product log function.
Analysis Throughput
Throughput [2, 1]
0.6
α=0.2
α=0.4
α=0.6
α=0.8
α=1.0
0.5
0.4
Throughput (S)
0.3
0.2
0.1
0
10 -3 10 -2 10 -1 10 0 10 1 10 2
Offered Load (G)
Figure: Slotted CSMA Throughput.

Analysis Throughput
Throughput [2, 1]
α=10 1
α=10 0
0.9 α=10 -1
α=10 -2
α=10 -3
0.8
0.7
0.6
Throughput (S)
0.5
0.4
0.3
0.2
0.1
0
10 -3 10 -2 10 -1 10 0 10 1 10 2 10 3 10 4 10 5
Offered Load (G)
Figure: Slotted CSMA Throughput.

Homework
Homework
Simulate Slotted-CSMA and compare the offered load VS throughput

plot.
Bibliography
Bibliography
Dimitri Bertsekas and Robert Gallager.

Data Network (2Nd Ed.).
Pearson India Education Services, 7th Floor, Knowledge Boulevard,
A-8(A), Sector 62, Noida 201 309U.P., India, 2015.
Raphael Rom and Moshe Sidi.
Multiple Access Protocols: Performance and Analysis.
Springer-Verlag New York, Inc., New York, NY, USA, 1990.

08 S Csma

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

08 S Csma

Uploaded by

Copyright:

Available Formats

Slotted Carrier Sense Multiple Access

Dr. José Jaime Camacho Escoto

Slotted Carrier Sense Multiple Access

Devices willing to transmit wait for the next slot.

The same as other CSMA analysis.

Successful Tranmission [2, 1]

Denote B̃ as the duration of the busy (transmission) period, and let B

Idle Period [2, 1]

To simplify, we will substitute p = 1 − e −g τ

Idle Period [2, 1]

Busy Period [2, 1]

Every transmission sill last exactly T + τ seconds.

Busy Period [2, 1]

Following the same procedure of the idle period we obtain

Useful Period [2, 1]

When a successful transmission occurs, useful information is carried

Useful Period [2, 1]

Given the conditional probability formula

Useful Period [2, 1]

Poisson process states that

Useful Period [2, 1]

Replacing equations 15 and 22 in 16 we obtain

Recall equation 1 and substituting 9, 15 and 25 we obtain

Now let’s find the maximum value of S

Figure: Slotted CSMA Throughput.

Figure: Slotted CSMA Throughput.

Simulate Slotted-CSMA and compare the offered load VS throughput

Dimitri Bertsekas and Robert Gallager.

You might also like