arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1010.3941cs.NI
收藏

无线局域网速率自适应算法的精确分析

Exact Analysis of Rate Adaptation Algorithms in Wireless LANs

Angad Singh, David Starobinski

摘要:

速率自适应在决定无线局域网的性能方面起着关键作用。在本文中,我们引入了一个半马尔可夫框架来分析两个最流行的速率自适应算法在无线局域网中使用的性能,即自动速率回落(ARF)和自适应自动速率回落(AARF)。鉴于我们的建模假设,分析是准确的,并提供了封闭的形式表达式的ARF和AARF的可实现的吞吐量。我们通过数值比较ARF和AARF在两个不同信道制度的吞吐量性能来说明我们的分析的好处。结果表明,这些算法都没有一贯优于其他。因此,我们提出并分析了一个新的变体AARF,称为持久AARF(或PARF),并表明,它实现了两种算法之间的一个很好的妥协,往往表现出接近最好的算法在每个研究制度。数值结果还揭示了MAC开销对三种算法性能的影响。特别是,他们表明,更保守的策略AARF和PARF规模更好的比特率增加。

英文摘要:

Rate adaptation plays a key role in determining the performance of wireless LANs. In this paper, we introduce a semi-Markovian framework to analyze the performance of two of the most popular rate adaptation algorithms used in wireless LANs, namely Automatic Rate Fallback (ARF) and Adaptive Automatic Rate Fallback (AARF). Given our modeling assumptions, the analysis is exact and provides closed form expressions for the achievable throughput of ARF and AARF. We illustrate the benefit of our analysis by numerically comparing the throughput performance of ARF and AARF in two different channel regimes. The results show that neither of these algorithms consistently outperforms the other. We thus propose and analyze a new variant to AARF, called Persistent AARF (or PAARF), and show that it achieves a good compromise between the two algorithms, often performing close to the best algorithm in each of the studied regimes. The numerical results also shed light into the impact of MAC overhead on the performance of the three algorithms. In particular, they show that the more conservative strategies AARF and PAARF scale better as the bit rate increases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑