Reinforcement Learning for Random Access in Multi-cell Networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Lee, D. | - |
dc.contributor.author | Zhao, Y. | - |
dc.contributor.author | Lee, J. | - |
dc.date.accessioned | 2021-07-28T08:11:39Z | - |
dc.date.available | 2021-07-28T08:11:39Z | - |
dc.date.issued | 2021-04 | - |
dc.identifier.issn | 0000-0000 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/105791 | - |
dc.description.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. © 2021 IEEE. | - |
dc.format.extent | 4 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Reinforcement Learning for Random Access in Multi-cell Networks | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/ICAIIC51459.2021.9415281 | - |
dc.identifier.scopusid | 2-s2.0-85105520898 | - |
dc.identifier.wosid | 000674469600069 | - |
dc.identifier.bibliographicCitation | 3rd International Conference on Artificial Intelligence in Information and Communication, ICAIIC 2021, pp 335 - 338 | - |
dc.citation.title | 3rd International Conference on Artificial Intelligence in Information and Communication, ICAIIC 2021 | - |
dc.citation.startPage | 335 | - |
dc.citation.endPage | 338 | - |
dc.type.docType | Conference Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | Reinforcement learning | - |
dc.subject.keywordPlus | Exploration and exploitation | - |
dc.subject.keywordPlus | Greedy algorithms | - |
dc.subject.keywordPlus | Greedy exploration | - |
dc.subject.keywordPlus | Multi-cell networks | - |
dc.subject.keywordPlus | Optimal transmission policy | - |
dc.subject.keywordPlus | Random-access communications | - |
dc.subject.keywordPlus | System throughput | - |
dc.subject.keywordPlus | Transmission policy | - |
dc.subject.keywordPlus | Learning algorithms | - |
dc.subject.keywordAuthor | Exponential-weight algorithm for Exploration and Exploitation | - |
dc.subject.keywordAuthor | Multi-Armed bandit | - |
dc.subject.keywordAuthor | Random access | - |
dc.subject.keywordAuthor | Reinforcement learning | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9415281 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.