Use of Logarithmic Rates in Multi-Armed Bandit-Based Transmission Rate Control Embracing Frame Aggregations in Wireless Networks

Author:

Cho Soohyun1ORCID

Affiliation:

1. Department of General Studies, Hongik University, Seoul 04066, Republic of Korea

Abstract

Herein, we propose the use of the logarithmic values of data transmission rates for multi-armed bandit (MAB) algorithms that adjust the modulation and coding scheme (MCS) levels of data packets in carrier-sensing multiple access/collision avoidance (CSMA/CA) wireless networks. We argue that the utilities of the data transmission rates of the MCS levels may not be proportional to their nominal values and suggest using their logarithmic values instead of directly using their data transmission rates when MAB algorithms compute the expected throughputs of the MCS levels. To demonstrate the effectiveness of the proposal, we introduce two MAB algorithms that adopt the logarithmic rates of the transmission rates. The proposed MAB algorithms also support frame aggregations available in wireless network standards that aim for a high throughput. In addition, the proposed MAB algorithms use a sliding window over time to adapt to rapidly changing wireless channel environments. To evaluate the performance of the proposed MAB algorithms, we used the event-driven network simulator, ns-3. We evaluated their performance using various scenarios of stationary and non-stationary wireless network environments including multiple spatial streams and frame aggregations. The experiment results show that the proposed MAB algorithms outperform the MAB algorithms that do not adopt the logarithmic transmission rates in both the stationary and non-stationary scenarios.

Funder

2021 Hongik University Research Fund

Publisher

MDPI AG

Subject

Fluid Flow and Transfer Processes,Computer Science Applications,Process Chemistry and Technology,General Engineering,Instrumentation,General Materials Science

Reference40 articles.

1. Sutton, R.S., and Barto, A.G. (2018). Reinforcement Learning: An Introduction, Bradford Book. [2nd ed.].

2. Using Confidence Bounds for Exploitation-Exploration Trade-offs;Auer;J. Mach. Learn. Res.,2002

3. The non-stochastic multi-armed bandit problem;Auer;SIAM J. Comput.,2002

4. Garivier, A., and Cappe, O. (2011, January 24). The KL-UCB Algorithm for Bounded Stochastic Bandits and Beyond. Proceedings of the 24th Annual Conference on Learning Theory, Budapest, Hungary.

5. On the Likelihood that One Unknown Probability Exceeds Another in View of the Evidence of Two Samples;Thompson;Biometrika,1933

Cited by 2 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3