Non-Stationary Bandit Strategy for Rate Adaptation with Delayed Feedback

被引:0
|
作者
Zhao, Yapeng [1 ,2 ]
Qian, Hua [2 ]
Kang, Kai [2 ]
Jin, Yanliang [1 ]
机构
[1] School of Communication and Information Engineering, Shanghai University, Shanghai,200444, China
[2] Shanghai Advanced Research Institute, China Academy of Sciences, Shanghai,201210, China
关键词
Time division multiplexing;
D O I
暂无
中图分类号
学科分类号
摘要
Rate adaptation is an efficient mechanism to utilize the channel capacity by adjusting the modulation and coding scheme in a dynamic wireless environment. The channel feedback, such as acknowledgment/negative acknowledgment (ACK/NACK) messages or the channel measurement such as received signal strength indicator (RSSI) can be applied to the rate adaptation. Existing rate adaptation algorithms are mainly driven by heuristics. They can not achieve satisfactory transmission rates in the time-varying environment. In this paper, we focus on the rate adaptation problem in a time-division duplex (TDD) system. A multi-armed bandit (MAB) strategy is applied to learn the changes of the channel condition from both RSSI and ACK/NACK signals. A discounted upper confidence bound based rate adaptation (DUCB-RA) algorithm is proposed. We show that the performance of the proposed algorithm is converged to the optimal with mathematical proofs. Simulation results demonstrate that the proposed algorithm can adapt to the time-varying channel and achieve better transmission throughput compared to existing rate adaptation algorithms. © 2013 IEEE.
引用
收藏
页码:75503 / 75511
相关论文
共 50 条
  • [1] Non-Stationary Bandit Strategy for Rate Adaptation With Delayed Feedback
    Zhao, Yapeng
    Qian, Hua
    Kang, Kai
    Jin, Yanliang
    IEEE ACCESS, 2020, 8 : 75503 - 75511
  • [2] Non-Stationary Delayed Combinatorial Semi-Bandit With Causally Related Rewards
    Ghoorchian, Saeed
    Bilaj, Steven
    Maghsudi, Setareh
    IEEE OPEN JOURNAL OF SIGNAL PROCESSING, 2025, 6 : 369 - 384
  • [3] Bandit Convex Optimization in Non-stationary Environments
    Zhao, Peng
    Wang, Guanghui
    Zhang, Lijun
    Zhou, Zhi-Hua
    INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS, VOL 108, 2020, 108 : 1508 - 1517
  • [4] Bandit Convex Optimization in Non-stationary Environments
    Zhao, Peng
    Wang, Guanghui
    Zhang, Lijun
    Zhou, Zhi-Hua
    JOURNAL OF MACHINE LEARNING RESEARCH, 2021, 22
  • [5] Thompson Sampling for Non-Stationary Bandit Problems
    Qi, Han
    Guo, Fei
    Zhu, Li
    ENTROPY, 2025, 27 (01)
  • [6] Online Second Price Auction with Semi-Bandit Feedback under the Non-Stationary Setting
    Zhao, Haoyu
    Chen, Wei
    THIRTY-FOURTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THE THIRTY-SECOND INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE AND THE TENTH AAAI SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2020, 34 : 6893 - 6900
  • [7] Online Bayesian Learning for Rate Adaptation in Non-stationary Wireless Channels
    Lei, Xiaoying
    2022 19TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON SENSING, COMMUNICATION, AND NETWORKING (SECON), 2022, : 55 - 63
  • [8] The non-stationary stochastic multi-armed bandit problem
    Allesiardo R.
    Féraud R.
    Maillard O.-A.
    Allesiardo, Robin (robin.allesiardo@gmail.com), 1600, Springer Science and Business Media Deutschland GmbH (03): : 267 - 283
  • [9] Differential Evolution Algorithm Applied to Non-Stationary Bandit Problem
    St-Pierre, David L.
    Liu, Jialin
    2014 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2014, : 2397 - 2403
  • [10] An exploration strategy for non-stationary opponents
    Pablo Hernandez-Leal
    Yusen Zhan
    Matthew E. Taylor
    L. Enrique Sucar
    Enrique Munoz de Cote
    Autonomous Agents and Multi-Agent Systems, 2017, 31 : 971 - 1002