상세 보기
Optimal User Pairing for Achieving Rate Fairness in Downlink NOMA Networks
- Bui, V.-P.;
- Nguyen, P.X.;
- Nguyen, H.V.;
- Nguyen, V.-D.;
- Shin, O.-S.
Citations
SCOPUS
25초록
In this paper, a downlink non-orthogonal multiple access (NOMA) network is studied. We investigate the problem of jointly optimizing user pairing and beam-forming design to maximize the minimum rate among all users. The considered problem belongs to a difficult class of mixed-integer nonconvex optimization programming. We first relax the binary constraints and adopt sequential convex approximation method to solve the relaxed problem, which is guaranteed to converge at least to a locally optimal solution. Numerical results show that the proposed method attains higher rate fairness among users, compared with traditional beamforming solutions, i.e., random pairing NOMA and beamforming systems. © 2019 IEEE.
키워드
Beamforming; convex optimization; nonorthogonal multiple access (NOMA); Beamforming; Convex optimization; Integer programming; Numerical methods; Binary constraints; Convex approximation methods; Multiple access; Non-orthogonal; Nonconvex optimization; Numerical results; Optimal solutions; Relaxed problem; Problem solving
- 제목
- Optimal User Pairing for Achieving Rate Fairness in Downlink NOMA Networks
- 저자
- Bui, V.-P.; Nguyen, P.X.; Nguyen, H.V.; Nguyen, V.-D.; Shin, O.-S.
- 발행일
- 2019-03
- 유형
- Conference Paper
- 저널명
- 1st International Conference on Artificial Intelligence in Information and Communication, ICAIIC 2019
- 페이지
- 575 ~ 578
- 언어
- ENG
- 출판사
- Institute of Electrical and Electronics Engineers Inc.
- 발행국가
- 미국
- 분량
- 4 페이지
- ISSN
- P 0000-0000