Reinforcement Learning for Random Access in Multi-cell Networks

Dongwook Lee, Yu Zhao, Joohyung Lee
{"title":"Reinforcement Learning for Random Access in Multi-cell Networks","authors":"Dongwook Lee, Yu Zhao, Joohyung Lee","doi":"10.1109/ICAIIC51459.2021.9415281","DOIUrl":null,"url":null,"abstract":"In this paper, our goal is to maximize the system throughput in a time-slotted uplink multi-cell random access communication system. To this end, we propose a two-stage reinforcement learning (RL)-based algorithm based on the exponential-weight algorithm for exploration and exploitation (EXP3). In each macro-time slot that consists of multiple time slots, users run the RL-based algorithm to choose the associated access point (AP). Then, a transmission policy determines the sub-time slot that user will transmit data in each time slot. Another RL-based learning algorithm is used to obtain an optimal transmission policy. To show that our method is efficient, we compare our proposed algorithm with the $\\epsilon$-greedy algorithm in two different scenarios. The simulation results show that the average system throughput of our algorithm outperforms that of $\\epsilon$-greedy exploration.","PeriodicalId":432977,"journal":{"name":"2021 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 International Conference on Artificial Intelligence in Information and Communication (ICAIIC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAIIC51459.2021.9415281","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, our goal is to maximize the system throughput in a time-slotted uplink multi-cell random access communication system. To this end, we propose a two-stage reinforcement learning (RL)-based algorithm based on the exponential-weight algorithm for exploration and exploitation (EXP3). In each macro-time slot that consists of multiple time slots, users run the RL-based algorithm to choose the associated access point (AP). Then, a transmission policy determines the sub-time slot that user will transmit data in each time slot. Another RL-based learning algorithm is used to obtain an optimal transmission policy. To show that our method is efficient, we compare our proposed algorithm with the $\epsilon$-greedy algorithm in two different scenarios. The simulation results show that the average system throughput of our algorithm outperforms that of $\epsilon$-greedy exploration.
多单元网络随机访问的强化学习
在本文中,我们的目标是在时隙上行多小区随机接入通信系统中实现系统吞吐量的最大化。为此,我们提出了一种基于指数权重探索和利用算法(EXP3)的两阶段强化学习(RL)算法。在每个由多个时隙组成的宏时隙中,用户通过基于rl的算法选择关联的AP (access point)。然后,传输策略确定用户在每个时隙中传输数据的子时隙。另一种基于强化学习的学习算法用于获得最优传输策略。为了证明我们的方法是有效的,我们在两个不同的场景中将我们提出的算法与$\epsilon$-greedy算法进行了比较。仿真结果表明,该算法的平均系统吞吐量优于$\epsilon$-greedy算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信