ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Journal Article Three Steps Toward Low-Complexity: Practical Interference Management in NOMA-Based mmWave Networks
Cited 3 time in scopus Download 104 time Share share facebook twitter linkedin kakaostory
Authors
Joonpyo Hong, Pildo Yoon, Suyoung Ahn, Yunhee Cho, Jeehyeon Na, Jeongho Kwak
Issue Date
2022-12
Citation
IEEE Access, v.10, pp.128366-128379
ISSN
2169-3536
Publisher
IEEE
Language
English
Type
Journal Article
DOI
https://dx.doi.org/10.1109/ACCESS.2022.3227444
Abstract
Beamforming, user scheduling and transmit power on existing interference management schemes in multi-cell mmWave networks have been independently controlled due to the high computational complexity of the problem. In this paper, we formulate a long-term utility maximization problem where beam activation, user scheduling and transmit power are incorporated in a single framework. To develop a low-complex algorithm, we first leverage the Lyapunov optimization framework to transform the original long-term problem into a series of slot-by-slot problems. Since the computational complexity to optimally solve the slot-by-slot problem is even significantly high like existing schemes, we decompose the problem into two different time scales: (i) a subproblem to find beam activation probability with a long time-scale and (ii) a subproblem to find user scheduling and power allocation with a short time-scale. Moreover, we introduce two additional gimmicks to more simplify the problem: (i) sequentially making decisions of beam activation, user scheduling, and power allocation, and (ii) considering a critical user for power allocation. Finally, via extensive simulations, we find that the proposed CRIM algorithm outperforms existing algorithms by up to 47.4% in terms of utility.
KSP Keywords
Computational complexity, Existing schemes, Long Time, Lyapunov optimization, MmWave networks, Multi-cell, Short time, Transmit power, User scheduling, activation probability, complex algorithm
This work is distributed under the term of Creative Commons License (CCL)
(CC BY NC ND)
CC BY NC ND