TY - JOUR
T1 - Three Steps Toward Low-Complexity
T2 - Practical Interference Management in NOMA-Based mmWave Networks
AU - Hong, Joonpyo
AU - Yoon, Pildo
AU - Ahn, Suyoung
AU - Cho, Yunhee
AU - Na, Jeehyeon
AU - Kwak, Jeongho
N1 - Publisher Copyright:
© 2013 IEEE.
PY - 2022
Y1 - 2022
N2 - 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.
AB - 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.
KW - Beam ON/OFF scheduling
KW - Lyapunov optimization
KW - inter-beam interference
KW - power allocation
KW - user scheduling
UR - http://www.scopus.com/inward/record.url?scp=85144745556&partnerID=8YFLogxK
U2 - 10.1109/ACCESS.2022.3227444
DO - 10.1109/ACCESS.2022.3227444
M3 - Article
AN - SCOPUS:85144745556
SN - 2169-3536
VL - 10
SP - 128366
EP - 128379
JO - IEEE Access
JF - IEEE Access
ER -