Dynamic Power Allocation and User Scheduling for Power-Efficient and Delay-Constrained Multiple Access Networks
- Authors
- Choi, Minseok; Kim, Joongheon; Moon, Jaekyun
- Issue Date
- 10월-2019
- Publisher
- IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
- Keywords
- Delay-constrained networks; power-efficient networks; non-orthogonal multiple access (NOMA); Internet of Things (IoT); power allocation; user scheduling
- Citation
- IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, v.18, no.10, pp.4846 - 4858
- Indexed
- SCIE
SCOPUS
- Journal Title
- IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
- Volume
- 18
- Number
- 10
- Start Page
- 4846
- End Page
- 4858
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/62769
- DOI
- 10.1109/TWC.2019.2929809
- ISSN
- 1536-1276
- Abstract
- In this paper, we propose a joint dynamic power control and user pairing algorithm for power-efficient and delay-constrained hybrid multiple access systems. In a hybrid multiple access system, user pairing determines whether the transmitter serves as a certain user by orthogonal multiple access (OMA) or non-orthogonal multiple access (NOMA). The proposed optimization framework minimizes the long-term time-average transmit power expenditure while reducing the queuing delay and guaranteeing the minimum time-average data rates. The proposed technique observes both channel and queue state information and adjusts queue backlogs to avoid an excessive queueing delay by appropriate user pairing and power allocation. Furthermore, the flexible use of resources is captured in the proposed algorithm by employing NOMA. The data-intensive simulation results show that the proposed scheme for power allocation and user scheduling achieves a balance among multiple performance goals, i.e., power efficiency, queueing delay, and data rate.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Engineering > School of Electrical Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.