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 条
  • [21] A strategy for assessment of non-stationary free spans
    Mork, KJ
    Fyrileiv, O
    Nes, H
    Sortland, L
    PROCEEDINGS OF THE NINTH (1999) INTERNATIONAL OFFSHORE AND POLAR ENGINEERING CONFERENCE, VOL IV, 1999, 1999, : 421 - 428
  • [22] Identification and control of non-stationary time delayed systems
    Dréano, P
    Laurent, R
    ROBUST CONTROL DESIGN 2000, VOLS 1 & 2, 2000, 1-2 : 267 - 271
  • [23] Handling Concept Drift in Non-stationary Bandit Through Predicting Future Rewards
    Tsai, Yun-Da
    Lin, Shou-De
    TRENDS AND APPLICATIONS IN KNOWLEDGE DISCOVERY AND DATA MINING, PAKDD 2024 WORKSHOPS, RAFDA AND IWTA, 2024, 14658 : 161 - 173
  • [24] An Optimal Algorithm for Adversarial Bandit Problem with Multiple Plays in Non-Stationary Environments
    Vural, N. Mert
    Ozturk, Bugra
    Kozat, Suleyman S.
    2020 28TH SIGNAL PROCESSING AND COMMUNICATIONS APPLICATIONS CONFERENCE (SIU), 2020,
  • [25] A Comparison of Adaptation Techniques for the Solution of Non-stationary Flow
    Felcman, J.
    Kubera, P.
    NUMERICAL ANALYSIS AND APPLIED MATHEMATICS, 2008, 1048 : 835 - 838
  • [26] Stochastic Bandits with Graph Feedback in Non-Stationary Environments
    Lu, Shiyin
    Hu, Yao
    Zhang, Lijun
    THIRTY-FIFTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, THIRTY-THIRD CONFERENCE ON INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE AND THE ELEVENTH SYMPOSIUM ON EDUCATIONAL ADVANCES IN ARTIFICIAL INTELLIGENCE, 2021, 35 : 8758 - 8766
  • [27] Recursive Adaptation of Stepsize Parameter for Non-stationary Environments
    Noda, Itsuki
    PRINCIPLES OF PRACTICE IN MULTI-AGENT SYSTEMS, 2009, 5925 : 525 - 533
  • [28] Recursive Adaptation of Stepsize Parameter for Non-stationary Environments
    Noda, Itsuki
    ADAPTIVE AND LEARNING AGENTS, 2010, 5924 : 74 - 90
  • [29] Stochastic Bandits with Graph Feedback in Non-Stationary Environments
    National Key Laboratory for Novel Software Technology, Nanjing University, Nanjing
    210023, China
    不详
    100102, China
    AAAI Conf. Artif. Intell., AAAI, 1600, (8758-8766): : 8758 - 8766
  • [30] Sequential non-stationary dynamic classification with sparse feedback
    Lowne, D. R.
    Roberts, S. J.
    Garnett, R.
    PATTERN RECOGNITION, 2010, 43 (03) : 897 - 905