2012 IEEE 23rd International Symposium on Personal, Indoor and Mobile Radio Communications - (PIMRC) 2012
DOI: 10.1109/pimrc.2012.6362819
|View full text |Cite
|
Sign up to set email alerts
|

On the performance of rate control algorithm Minstrel

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
15
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 21 publications
(15 citation statements)
references
References 9 publications
0
15
0
Order By: Relevance
“…This probability is used to estimate the throughput of each rate and the retry chain is re-evaluated based on this estimate every 100ms. In each 100ms sampling window, the success rate, R S , is calculated for each data rate based on the 1 The data rate that gives the highest throughput 2 The data rate that has the highest rate of successful transmissions 3 The lowest available data rate historical observation of packet successes and failures as in (1), where N S is the number of packets transmitted successfully at the data rate and N T is the total number of packets attempted at the data rate.…”
Section: Statistics Calculationmentioning
confidence: 99%
See 1 more Smart Citation
“…This probability is used to estimate the throughput of each rate and the retry chain is re-evaluated based on this estimate every 100ms. In each 100ms sampling window, the success rate, R S , is calculated for each data rate based on the 1 The data rate that gives the highest throughput 2 The data rate that has the highest rate of successful transmissions 3 The lowest available data rate historical observation of packet successes and failures as in (1), where N S is the number of packets transmitted successfully at the data rate and N T is the total number of packets attempted at the data rate.…”
Section: Statistics Calculationmentioning
confidence: 99%
“…This work builds on our previous study which evaluates Minstrel [2]. In this paper we consider different scenarios to provide a more detailed evaluation.…”
Section: Introductionmentioning
confidence: 99%
“…Therefore, we have designed two typical collision scenarios for verification: hidden node collision and multi-user collision. Then we simulate three typical Channel Modes B, D and E in 802.11n [13] to assess on Gi Adaption and verify its gain compared with fixed ShortGi and LongGi mode. Finally a experiment of real deployment is done to evaluate the composite enhancement of the total solution.…”
Section: Experiments and Simulationmentioning
confidence: 99%
“…Minstrel has been proved to enjoy favorable effect in most slow-varying and low-density indoor channel condition. But when channel varies quickly or in high-density condition, in which random and unexpected collision is frequent, this algorithm has its limitation too, and even inferior to constant-rate algorithm [13,14]. And with the evolution of WLAN and increasing of MCS levels, periodical training itself would have influence on performance.…”
Section: Introductionmentioning
confidence: 99%
“…AARF [10], SampleRate [11] and Minstrel [12] are collision-ignored and bit rates are reducing once packet loss occurs. Frame-based ones by nature are not responsive to variations of link status, because they require multiple frame transmissions to converge to a meaningful estimated value of link status.…”
Section: Open-loop Approach Rate Adaptation Schemesmentioning
confidence: 99%