The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Kertas kerja ini menyiasat masalah peruntukan sumber untuk pautan ke bawah rangkaian akses berbilang bukan ortogon (NOMA). Kaedah peruntukan sumber baru dicadangkan untuk menangani masalah memaksimumkan kapasiti sistem sambil mengambil kira keadilan pengguna. Memandangkan masalah pengoptimuman adalah tidak cembung dan sukar diatasi, kami menerima pakai idea pengoptimuman langkah demi langkah, menguraikannya kepada submasalah gandingan pengguna, subsaluran dan peruntukan kuasa. Pertama, semua pengguna dipasangkan mengikut keuntungan saluran mereka yang berbeza. Kemudian, peruntukan subsaluran dilaksanakan oleh algoritma pemilihan subsaluran (SSA) yang dicadangkan berdasarkan keutamaan saluran. Setelah peruntukan subsaluran ditetapkan, untuk meningkatkan lagi kapasiti sistem, peruntukan kuasa subsaluran dilaksanakan dengan pendekatan penghampiran cembung (SCA) berturut-turut di mana masalah pengoptimuman bukan cembung diubah menjadi masalah pengoptimuman cembung anggaran dalam setiap lelaran. Untuk memastikan kesaksamaan pengguna, sempadan atas dan bawah pekali peruntukan kuasa diperoleh dan digabungkan dengan memperkenalkan pekali penalaan. Pekali peruntukan kuasa boleh dilaraskan secara dinamik dengan melaraskan pekali penalaan, oleh itu keperluan kualiti perkhidmatan (QoS) yang pelbagai boleh dipenuhi. Akhir sekali, hasil simulasi menunjukkan keunggulan kaedah yang dicadangkan berbanding kaedah sedia ada dari segi prestasi sistem, selain itu, pertukaran yang baik antara kapasiti sistem dan keadilan pengguna boleh dicapai.
Qingyuan LIU
Beijing University of Posts and Telecommunications
Qi ZHANG
Beijing University of Posts and Telecommunications
Xiangjun XIN
Beijing University of Posts and Telecommunications
Ran GAO
Beijing Institute of Technology
Qinghua TIAN
Beijing University of Posts and Telecommunications
Feng TIAN
Beijing University of Posts and Telecommunications
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Salinan
Qingyuan LIU, Qi ZHANG, Xiangjun XIN, Ran GAO, Qinghua TIAN, Feng TIAN, "Subchannel and Power Allocation with Fairness Guaranteed for the Downlink of NOMA-Based Networks" in IEICE TRANSACTIONS on Communications,
vol. E103-B, no. 12, pp. 1447-1461, December 2020, doi: 10.1587/transcom.2019EBP3256.
Abstract: This paper investigates the resource allocation problem for the downlink of non-orthogonal multiple access (NOMA) networks. A novel resource allocation method is proposed to deal with the problem of maximizing the system capacity while taking into account user fairness. Since the optimization problem is nonconvex and intractable, we adopt the idea of step-by-step optimization, decomposing it into user pairing, subchannel and power allocation subproblems. First, all users are paired according to their different channel gains. Then, the subchannel allocation is executed by the proposed subchannel selection algorithm (SSA) based on channel priority. Once the subchannel allocation is fixed, to further improve the system capacity, the subchannel power allocation is implemented by the successive convex approximation (SCA) approach where the nonconvex optimization problem is transformed into the approximated convex optimization problem in each iteration. To ensure user fairness, the upper and lower bounds of the power allocation coefficients are derived and combined by introducing the tuning coefficients. The power allocation coefficients are dynamically adjustable by adjusting the tuning coefficients, thus the diversified quality of service (QoS) requirements can be satisfied. Finally, simulation results demonstrate the superiority of the proposed method over the existing methods in terms of system performance, furthermore, a good tradeoff between the system capacity and user fairness can be achieved.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2019EBP3256/_p
Salinan
@ARTICLE{e103-b_12_1447,
author={Qingyuan LIU, Qi ZHANG, Xiangjun XIN, Ran GAO, Qinghua TIAN, Feng TIAN, },
journal={IEICE TRANSACTIONS on Communications},
title={Subchannel and Power Allocation with Fairness Guaranteed for the Downlink of NOMA-Based Networks},
year={2020},
volume={E103-B},
number={12},
pages={1447-1461},
abstract={This paper investigates the resource allocation problem for the downlink of non-orthogonal multiple access (NOMA) networks. A novel resource allocation method is proposed to deal with the problem of maximizing the system capacity while taking into account user fairness. Since the optimization problem is nonconvex and intractable, we adopt the idea of step-by-step optimization, decomposing it into user pairing, subchannel and power allocation subproblems. First, all users are paired according to their different channel gains. Then, the subchannel allocation is executed by the proposed subchannel selection algorithm (SSA) based on channel priority. Once the subchannel allocation is fixed, to further improve the system capacity, the subchannel power allocation is implemented by the successive convex approximation (SCA) approach where the nonconvex optimization problem is transformed into the approximated convex optimization problem in each iteration. To ensure user fairness, the upper and lower bounds of the power allocation coefficients are derived and combined by introducing the tuning coefficients. The power allocation coefficients are dynamically adjustable by adjusting the tuning coefficients, thus the diversified quality of service (QoS) requirements can be satisfied. Finally, simulation results demonstrate the superiority of the proposed method over the existing methods in terms of system performance, furthermore, a good tradeoff between the system capacity and user fairness can be achieved.},
keywords={},
doi={10.1587/transcom.2019EBP3256},
ISSN={1745-1345},
month={December},}
Salinan
TY - JOUR
TI - Subchannel and Power Allocation with Fairness Guaranteed for the Downlink of NOMA-Based Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1447
EP - 1461
AU - Qingyuan LIU
AU - Qi ZHANG
AU - Xiangjun XIN
AU - Ran GAO
AU - Qinghua TIAN
AU - Feng TIAN
PY - 2020
DO - 10.1587/transcom.2019EBP3256
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E103-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2020
AB - This paper investigates the resource allocation problem for the downlink of non-orthogonal multiple access (NOMA) networks. A novel resource allocation method is proposed to deal with the problem of maximizing the system capacity while taking into account user fairness. Since the optimization problem is nonconvex and intractable, we adopt the idea of step-by-step optimization, decomposing it into user pairing, subchannel and power allocation subproblems. First, all users are paired according to their different channel gains. Then, the subchannel allocation is executed by the proposed subchannel selection algorithm (SSA) based on channel priority. Once the subchannel allocation is fixed, to further improve the system capacity, the subchannel power allocation is implemented by the successive convex approximation (SCA) approach where the nonconvex optimization problem is transformed into the approximated convex optimization problem in each iteration. To ensure user fairness, the upper and lower bounds of the power allocation coefficients are derived and combined by introducing the tuning coefficients. The power allocation coefficients are dynamically adjustable by adjusting the tuning coefficients, thus the diversified quality of service (QoS) requirements can be satisfied. Finally, simulation results demonstrate the superiority of the proposed method over the existing methods in terms of system performance, furthermore, a good tradeoff between the system capacity and user fairness can be achieved.
ER -