By Muhamad Khaled Alhamwi 260212
description
Transcript of By Muhamad Khaled Alhamwi 260212
![Page 1: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/1.jpg)
COE-541 Research Presentation
Saturation Throughput Analysis for Different Backoff Algorithms in
IEEE802.11
By
Muhamad Khaled Alhamwi
260212
![Page 2: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/2.jpg)
2
Outline Introduction Backoff Algorithms Markov Models Analysis
Algorithms Throughput
Simulation Results Conclusions References Q & A
![Page 3: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/3.jpg)
3
Introduction Backoff periods are used to minimize
collision by deferring transmission in CSMA protocols
Different existing backoff algorithms BEB EIED EILD
![Page 4: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/4.jpg)
4
BEB Algorithm (1) Binary Exponential Backoff algorithm:
Transmit using CSMA/CA protocol If transmission was unsuccessful
Double the backoff window Otherwise (successful)
Reset the window to its minimum value
![Page 5: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/5.jpg)
5
BEB Algorithm (2) This aggressive reduction in backoff period
can result in more collisions After successful transmission more stations
will try to transmit Higher probability of collision
![Page 6: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/6.jpg)
6
EIED Algorithm Exponential Increase Exponential Decrease
algorithm
Transmit using CSMA/CA protocol If transmission was unsuccessful
Double the backcoff window Otherwise (successful)
Halve the backoff window
![Page 7: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/7.jpg)
7
EILD Algorithm Exponential Increase Linear Decrease
algorithm
Transmit using CSMA/CA protocol If transmission was unsuccessful
Double the backcoff window Otherwise (successful)
Subtract one from the backoff window
![Page 8: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/8.jpg)
8
Markov Model of BEB
P is the probability of collision Assumed constant (does not depend on the state)
1-P is the probability of successful transmission Wi (W0 to Wm) is the backoff window size Assuming NO limit on retransmission trials
![Page 9: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/9.jpg)
9
Markov Model of EIED (1)
Double when unsuccessful ri = 2 Halve when successful rd = 2
![Page 10: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/10.jpg)
10
Markov Model of EIED (2)
Multiply by 4 when unsuccessful ri = 4 Halve when successful rd = 2
![Page 11: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/11.jpg)
11
Markov Model of EILD
Double when unsuccessful Subtract one when successful W is the minimum Window size = W0
(20+21+22+… +2m-1)W+1 = 2mW-W+1 states
![Page 12: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/12.jpg)
12
Analysis Approach Markov Model Steady-state probabilities Transmission probability Success probability Collision probability Throughput
![Page 13: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/13.jpg)
13
BEB Analysis (unlimited retransmission) Steady-state probability
PqP
m
ii
11
1 00
0
m
iiq
0
1
miqPq ii 1for ,. 1
).( 1 mmm qqPq
Solve for q0, we get
![Page 14: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/14.jpg)
14
BEB Analysis, cont’ The steady-state probabilities can be expressed by
miP
miPPq
m
i
ifor
0for )1.(
The average number of slots E[Z] spent in each state between transitions, averaged over all states is given by
)21(2
2)2(1
2
121][
1
0 P
WPWPWq
WZE
mm
i
m
i
i
![Page 15: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/15.jpg)
15
BEB Analysis, cont’ Since only one slot is used for transmission between state
transitions, the probability of backlogged station to transmit in a random slot is given by
PPPW
WZE m
21))2(1(
)1(
2
][
1
This is the same result obtained by [2] that uses 2-D Markov model
![Page 16: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/16.jpg)
16
BEB Analysis (limited ret’)
Markov model for limited retransmission Maximum number of transmissions per packet is
M+1 All states (Wm,i) have the same maximum
deference time of 2mW-1
![Page 17: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/17.jpg)
17
BEB Analysis (limited ret’), cont Steady-state probabilities are given by
M
iiii qMiqPq
01 1 ,1 ,.
Solving for q0, we get
MiP
PPq
M
i
i
0 ,
1
)1.(1
)21(21
))2(1()1(
)1(2
2
12
2
121
1
][
1
1
1
1
0
WPP
PPWW
P
qW
qWZE mM
m
M
m
i
M
mii
m
i
i
![Page 18: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/18.jpg)
18
EIED Analysis (ri=2, rd=2)
Similarly, steady-state probabilities qi:
m
iiii qmiq
P
Pq
01 1 ,1 ,.
1 Solving for q0, we get
miP
Pr
r
rrq
m
i
i
0 ,
1 ,
1
)1(1
Transmission probability in a random slot
WPPPP
PP
PP
qWZE mmmm
mm
m
ii
i
))2()1(()31()21(
))1((
))1((2
212
1
1
][
1
1111
11
0
![Page 19: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/19.jpg)
19
EILD Analysis Steady-state probabilities
iWqPiq
P
WiqP
P
q
ii
i
i
1 ),.).2mod((1
1
11 ,)1(
2
11
0
WW
ii
m
qWiZE 2
0 21
1
1
][
1
![Page 20: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/20.jpg)
20
Saturation Throughput Analysis At steady-state, each transmission sees
)1/(1*1 )1(1)())(1(1 nn PPPP τ*(P) is continuous and monotone increasing
function, τ*(0)=0, and τ*(1)=1 For BEB case, τ is given by (monotone
decreasing), τ(0) > τ*(0), and τ(1) < τ*(1)
PPPW
WZE
P m
21))2(1(
)1(
2
][
1)(
![Page 21: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/21.jpg)
21
Saturation Throughput Analysis, cont’ Solve for P, obtaining P* and τ*= τ(P*)
]length cycle[
cycle] a during ed transmittPayload[
E
ES
Where ‘cycle’ is the time between two consecutive ends of DIFS/EIFS
![Page 22: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/22.jpg)
22
Saturation Throughput Analysis, cont’ Probability of successful transmission in a cycle is a probability
of one station transmitting given that one transmitted in a slot
n
n
s
nP
)1(1
)1)((*
1**
Where n is number of backlogged stations Transmission cycle
Idle (backoff) period following DIFS/EIFS Busy period (one or more transmissions), and
followed by SIFS, ACK, and DIFS in case of success EIFS in case of collision
![Page 23: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/23.jpg)
23
Saturation Throughput Analysis, cont’ Idle period length is a product of a geometric
random variable and the slot length
slotnTE
1
)1(1
1]Period Idle[
* Busy Period length for basic mode (ignore
propagation delay
)1(.]PeriodBusy [ sbasCs
bass PTPTE
Different values of Ts, and Tc for RTS/CTS mode
![Page 24: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/24.jpg)
24
Saturation Throughput Analysis, cont’
Throughput is given by
]iodPerBusy []Period Idle[
.
X
sX EE
PayloadPS
Where X is either Basic Access Mode RTS/CTS Mode
![Page 25: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/25.jpg)
25
Saturation Throughput (Basic Mode)
![Page 26: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/26.jpg)
26
Saturation Throughput (RTS/CTS)
![Page 27: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/27.jpg)
27
Average Maximum Backoff Window
![Page 28: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/28.jpg)
28
Conclusions New Markov chain models were used to analyze
BEB, EIED, EILD algorithms EIED can provide a slight improvement over BEB in
a small network and using basic access mode EILD can provide significant improvement in a large
network The algorithms provide only slight improvement for
RTS/CTS mode
![Page 29: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/29.jpg)
29
References [1] Vukovic, I.N.; Smavatkul, N., “Saturation
throughput analysis of different backoff algorithms in IEEE802.11,” Personal, Indoor and Mobile Radio Communications, 2004. PIMRC 2004. 15th IEEE International Symposium on , vol.3, no., pp. 1870-1875 Vol.3, 5-8 Sept. 2004
[2] G. Bianchi, “Performance Analysis of The IEEE802.11 Distributed Coordination Function”, IEEE Journal on Selected Areas in Communications, pp. 535-547, Vol. 18, March 2000.
![Page 30: By Muhamad Khaled Alhamwi 260212](https://reader035.fdocuments.us/reader035/viewer/2022062217/56815a73550346895dc7d907/html5/thumbnails/30.jpg)
30
Thank you Q & A