on optimizing the backoff interval for random access scheme zygmunt j. hass and jing deng ieee...
TRANSCRIPT
![Page 1: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/1.jpg)
On Optimizing the Backoff Interval On Optimizing the Backoff Interval for Random Access Schemefor Random Access Scheme
Zygmunt J. Hass and Jing DengZygmunt J. Hass and Jing Deng
IEEE Transactions on Communications,IEEE Transactions on Communications, Dec 2003 Dec 2003
![Page 2: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/2.jpg)
OutlineOutline
IntroductionIntroductionRelated WorkRelated WorkSBA (Sensing Backoff Algorithm)SBA (Sensing Backoff Algorithm)Performance EvaluationPerformance EvaluationConclusionsConclusions
![Page 3: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/3.jpg)
IntroductionIntroduction
Two fundamental characteristics of a good Two fundamental characteristics of a good backoff algorithmbackoff algorithmHigh channel throughputHigh channel throughputLow delayLow delay
FairnessFairness among competing nodes should among competing nodes should also be consideredalso be considered
![Page 4: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/4.jpg)
Related Work(1)Related Work(1)
Binary exponential backoff (BEB)Binary exponential backoff (BEB)
collision upon ),,2min(ion transmisssuccessful upon ,
max
min{ Bxx
Bx
![Page 5: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/5.jpg)
Related Work(2)Related Work(2)
A B
CW=Bmin=7 CW=Bmin=7
A B
CW=Bmin=7 CW=Bmin=15
A B
CW=Bmin=7 CW=Bmin=255
……
…
![Page 6: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/6.jpg)
Related Work(3)Related Work(3)
Multiplicative increase linear decrease (MILD), Multiplicative increase linear decrease (MILD), introduced in MACAWintroduced in MACAW
![Page 7: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/7.jpg)
Related Work(4)Related Work(4)
MILDMILDMaintains a backoff interval for each stream inMaintains a backoff interval for each stream in
stead of each nodestead of each node Improves the fairness performanceImproves the fairness performance
![Page 8: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/8.jpg)
Related Work(5)Related Work(5)
MILD still has 2 disadvantagesMILD still has 2 disadvantagesBackoff interval stored into the transmitted paBackoff interval stored into the transmitted pa
ckets increases the overhead and the probabilckets increases the overhead and the probability of packet collisionity of packet collision
Backoff intervals migrate to the whole network,Backoff intervals migrate to the whole network, the channel throughput in these areas will be the channel throughput in these areas will be degradeddegraded
![Page 9: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/9.jpg)
SBA(1)SBA(1)
α( > 1)θ( < 1)β( steps)γ( transmission time of a packet
![Page 10: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/10.jpg)
SBA(2)SBA(2)
AssumptionsAssumptionsN nodes within the transmission range of each N nodes within the transmission range of each
other ( N <= 100 )other ( N <= 100 )Packet collisions are the only source of packePacket collisions are the only source of packe
t errort errorTransmission can be overheard by other nodeTransmission can be overheard by other node
ssPackets should be transmitted in turnPackets should be transmitted in turnAll nodes have the same CWAll nodes have the same CWminmin and CW and CWmaxmax
![Page 11: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/11.jpg)
SBA(3)SBA(3)
TTff : duration of faild period : duration of faild period II : idle period : idle periodTTss : success busy period : success busy periodUU : utilization period : utilization period
![Page 12: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/12.jpg)
SBA(4)SBA(4)
Within , the mean interarrival time at eaWithin , the mean interarrival time at each node is B/2, where B is a fixed backoff inch node is B/2, where B is a fixed backoff intervalterval
Prob{ A node starts transmission in } = Prob{ A node starts transmission in } = 2 / B * 2 / B *
PPss = Prob{ None of the other nodes transmit = Prob{ None of the other nodes transmit
in γ} = in γ} = 12
1
N
B
![Page 13: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/13.jpg)
SBA(5)SBA(5)
By approximating the arrivals of all nodes By approximating the arrivals of all nodes by a Poisson arrival process, the total by a Poisson arrival process, the total arrival rate is N * 2 / B, so the average idle arrival rate is N * 2 / B, so the average idle time istime is
![Page 14: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/14.jpg)
SBA(6)SBA(6)
The average failed period can be expressed The average failed period can be expressed asas
![Page 15: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/15.jpg)
SBA(7)SBA(7)
Applying the above 3 equations into Applying the above 3 equations into channel model, the channel throughput as channel model, the channel throughput as a function of a function of NN and and BB can be obtains can be obtains
![Page 16: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/16.jpg)
SBA(8)SBA(8)
To find the optimum B(BTo find the optimum B(Boptopt),),
must be solved numericallymust be solved numericallyBBoptopt(N) = 4Nγ (N) = 4Nγ
![Page 17: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/17.jpg)
SBA(9)SBA(9)
![Page 18: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/18.jpg)
SBA(10)SBA(10)
![Page 19: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/19.jpg)
SBA(11)SBA(11)
![Page 20: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/20.jpg)
SBA(12)SBA(12)
![Page 21: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/21.jpg)
SBA(13)SBA(13)
Based on the above calculation of the optiBased on the above calculation of the optimum backoff intervals, we can find the optimum backoff intervals, we can find the optimum values of (α, β, and γ)mum values of (α, β, and γ)
(α, β, γ) = (1.2, 0.8, 0.93)(α, β, γ) = (1.2, 0.8, 0.93)
![Page 22: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/22.jpg)
Performance Evaluation(1)Performance Evaluation(1)
![Page 23: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/23.jpg)
Performance Evaluation(2)Performance Evaluation(2)
![Page 24: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/24.jpg)
Performance Evaluation(3)Performance Evaluation(3)
![Page 25: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/25.jpg)
Performance Evaluation(4)Performance Evaluation(4)
![Page 26: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/26.jpg)
Performance Evaluation(5)Performance Evaluation(5)
![Page 27: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/27.jpg)
ConclusionsConclusions
SBA operates close to the optimum, maxiSBA operates close to the optimum, maximizing the network throughput with mizing the network throughput with fair accfair accessess from active nodes, without the from active nodes, without the precise precise knowledgeknowledge of the number of active nodes of the number of active nodes
SBA can also be extended to other types oSBA can also be extended to other types of MAC schemesf MAC schemes
![Page 28: On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003](https://reader030.vdocuments.mx/reader030/viewer/2022032414/56649ee95503460f94bfaca9/html5/thumbnails/28.jpg)
Thank youThank you