Distributed fair channel access in NOMA random access systems
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Qu, Miao | - |
dc.contributor.author | Liu, Jie | - |
dc.contributor.author | Seo, Jun bae | - |
dc.contributor.author | Jin, Hu | - |
dc.date.accessioned | 2021-06-22T11:02:20Z | - |
dc.date.available | 2021-06-22T11:02:20Z | - |
dc.date.created | 2021-01-22 | - |
dc.date.issued | 2019-12 | - |
dc.identifier.issn | 1930-529X | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/4621 | - |
dc.description.abstract | This paper considers non-orthogonal multiple access (NOMA) systems in which users randomly transmit packets in each slot while the transmit power is adjusted so that the receive power of each packet at the base station can be one of two predetermined values. While the NOMA random access system can support simultaneous transmissions from up to two users with different target receive powers, it complicates the access protocol design as each user not only has to optimize the transmission probability but also has to suitably choose the target receive power. By considering the fact that users may have different capability of choosing the target receive power due to their diverse locations in a cell, we propose an online distributed channel access algorithm which enables the users to adaptively choose the target receive power and control the transmission probability over time through observing channel outcomes such as idle, success and collision. Numerical results demonstrate that the proposed algorithm can optimize the system performance in terms of throughput and access fairness. © 2019 IEEE. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | - |
dc.title | Distributed fair channel access in NOMA random access systems | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Jin, Hu | - |
dc.identifier.doi | 10.1109/GLOBECOM38437.2019.9013283 | - |
dc.identifier.scopusid | 2-s2.0-85081955738 | - |
dc.identifier.wosid | 000552238601025 | - |
dc.identifier.bibliographicCitation | 2019 IEEE Global Communications Conference, GLOBECOM 2019 - Proceedings, pp.1 - 6 | - |
dc.relation.isPartOf | 2019 IEEE Global Communications Conference, GLOBECOM 2019 - Proceedings | - |
dc.citation.title | 2019 IEEE Global Communications Conference, GLOBECOM 2019 - Proceedings | - |
dc.citation.startPage | 1 | - |
dc.citation.endPage | 6 | - |
dc.type.rims | ART | - |
dc.type.docType | Conference Paper | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.subject.keywordPlus | Distributed channels | - |
dc.subject.keywordPlus | Fairness | - |
dc.subject.keywordPlus | Multiple access | - |
dc.subject.keywordPlus | Random access | - |
dc.subject.keywordPlus | Random access systems | - |
dc.subject.keywordPlus | S- ALOHA | - |
dc.subject.keywordPlus | Simultaneous transmission | - |
dc.subject.keywordPlus | Transmission probabilities | - |
dc.subject.keywordAuthor | Fairness | - |
dc.subject.keywordAuthor | Non-orthogonal multiple access (NOMA) | - |
dc.subject.keywordAuthor | Random access | - |
dc.subject.keywordAuthor | S-ALOHA | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/9013283/ | - |
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.