Optimal Resource Allocation for Multicarrier NOMA in Short Packet Communications

In this paper, we study the resource allocation problem for downlink multicarrier non-orthogonal multiple access systems with short-packet communications (MC-NOMA-SPC). In contrast to long-packet communications in conventional wireless systems, SPC suffers from a transmission rate degradation and an...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	IEEE transactions on vehicular technology Ročník 69; číslo 2; s. 2141 - 2156
Hlavní autori:	Chen, Jie, Zhang, Lin, Liang, Ying-Chang, Ma, Shaodan
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York IEEE 01.02.2020 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:	Algorithms Complexity Computer simulation Decoding Downlink Dynamic programming Error analysis Heuristic algorithms Mixed integer multicarrier non-orthogonal multiple access NOMA Nonlinear programming Nonorthogonal multiple access optimal resource allocation Optimization Performance evaluation Resource allocation Resource management Short packet communications Silicon carbide Subcarriers Wireless communications
ISSN:	0018-9545, 1939-9359
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Abstract	In this paper, we study the resource allocation problem for downlink multicarrier non-orthogonal multiple access systems with short-packet communications (MC-NOMA-SPC). In contrast to long-packet communications in conventional wireless systems, SPC suffers from a transmission rate degradation and an unavoidable decoding error rate. Thus conventional resource allocation based on the Shannon capacity assuming infinite blocklength is no longer optimal. In this paper, we propose to use the effective-throughput as the performance metric to evaluate the tradeoff between the transmission rate and the decoding error rate. Building on that, we jointly optimize the subcarrier assignment, transmission power allocation, and transmission rate adaptation of each user to maximize the total weighted effective-throughput subject to transmission reliability and various practical constraints. Since the formulated problem belongs to a non-convex mixed integer nonlinear programming (MINLP) problem, we develop an efficient algorithm based on the dynamic programming (DP) recursion framework to obtain its optimal solutions. We further propose a low-complexity algorithm based on the principles of block coordinate descent (BCD) and concave-convex procedure (CCCP). Finally, the simulation results show that the proposed low-complexity algorithm can achieve similar performance as that of the optimal solution and outperform the other baseline schemes significantly.
AbstractList	In this paper, we study the resource allocation problem for downlink multicarrier non-orthogonal multiple access systems with short-packet communications (MC-NOMA-SPC). In contrast to long-packet communications in conventional wireless systems, SPC suffers from a transmission rate degradation and an unavoidable decoding error rate. Thus conventional resource allocation based on the Shannon capacity assuming infinite blocklength is no longer optimal. In this paper, we propose to use the effective-throughput as the performance metric to evaluate the tradeoff between the transmission rate and the decoding error rate. Building on that, we jointly optimize the subcarrier assignment, transmission power allocation, and transmission rate adaptation of each user to maximize the total weighted effective-throughput subject to transmission reliability and various practical constraints. Since the formulated problem belongs to a non-convex mixed integer nonlinear programming (MINLP) problem, we develop an efficient algorithm based on the dynamic programming (DP) recursion framework to obtain its optimal solutions. We further propose a low-complexity algorithm based on the principles of block coordinate descent (BCD) and concave-convex procedure (CCCP). Finally, the simulation results show that the proposed low-complexity algorithm can achieve similar performance as that of the optimal solution and outperform the other baseline schemes significantly.
Author	Ma, Shaodan Liang, Ying-Chang Zhang, Lin Chen, Jie
Author_xml	– sequence: 1 givenname: Jie orcidid: 0000-0002-2196-9799 surname: Chen fullname: Chen, Jie email: chenjie.ay@gmail.com organization: National Key Laboratory of Science and Technology on Communications, Center for Intelligent Networking and Communications, University of Electronic Science and Technology of China, Chengdu, China – sequence: 2 givenname: Lin orcidid: 0000-0003-3889-492X surname: Zhang fullname: Zhang, Lin email: linzhang1913@gmail.com organization: National Key Laboratory of Science and Technology on Communications, Center for Intelligent Networking and Communications, University of Electronic Science and Technology of China, Chengdu, China – sequence: 3 givenname: Ying-Chang orcidid: 0000-0003-2671-5090 surname: Liang fullname: Liang, Ying-Chang email: liangyc@ieee.org organization: Center for Intelligent Networking and Communications and the Institute for Artificial Intelligence, University of Electronic Science and Technology of China, Chengdu, China – sequence: 4 givenname: Shaodan orcidid: 0000-0001-5521-3650 surname: Ma fullname: Ma, Shaodan email: shaodanma@um.edu.mo organization: Department of Electrical and Computer Engineering, State Key Laboratory of Internet of Things for Smart City, University of Macau, Macao, China
BookMark	eNp9kEtLAzEURoNUsK3uBTcB11PzmMwky1J8QWuLVrchTTKYOp3UJLPw3zt1igsXri4XvnPvxxmBQeMbC8AlRhOMkbhZv60nBGExIaJADBUnYIgFFZmgTAzAECHMM8FydgZGMW67Nc8FHoLVcp_cTtXw2UbfBm3htK69Vsn5BlY-wEVbJ6dVCM4G-LRcTKFr4Mu7DwmulP6wCc78btc2rmfiOTitVB3txXGOwevd7Xr2kM2X94-z6TzTROCUUcKrjdiUpVbEGMUrYbQVhSEMVcZUihSYcmOJ4RuiGbUYlUyUFpccGaR5Tsfgur-7D_6ztTHJbde_6V5KQllJMGIF7VJFn9LBxxhsJbVLP0VTUK6WGMmDPdnZkwd78mivA9EfcB86T-HrP-SqR5y19jfOBS0oJ_Qbjth8zA
CODEN	ITVTAB
CitedBy_id	crossref_primary_10_1109_JIOT_2023_3246300 crossref_primary_10_3390_s21134404 crossref_primary_10_1016_j_vehcom_2025_100908 crossref_primary_10_1007_s11277_021_08701_y crossref_primary_10_1109_TCOMM_2022_3224388 crossref_primary_10_1109_TWC_2022_3144618 crossref_primary_10_3390_app112311438 crossref_primary_10_1109_ACCESS_2020_3025635 crossref_primary_10_1109_TWC_2020_3045736 crossref_primary_10_1016_j_comcom_2023_05_024 crossref_primary_10_1109_ACCESS_2024_3428928 crossref_primary_10_1109_TWC_2023_3270925 crossref_primary_10_1109_LWC_2023_3313967 crossref_primary_10_1109_TVT_2023_3326972 crossref_primary_10_1016_j_comnet_2025_111313 crossref_primary_10_1109_JIOT_2021_3073239 crossref_primary_10_1007_s11276_023_03619_8 crossref_primary_10_1109_TVT_2024_3370977 crossref_primary_10_1109_TWC_2021_3096818 crossref_primary_10_1049_ell2_70309 crossref_primary_10_1080_0954898X_2025_2461046 crossref_primary_10_1088_1742_6596_2401_1_012071 crossref_primary_10_1109_JSAC_2022_3143244 crossref_primary_10_1007_s11276_023_03326_4 crossref_primary_10_1007_s00521_020_05492_4 crossref_primary_10_1109_TWC_2024_3402550 crossref_primary_10_1109_LSENS_2022_3148330 crossref_primary_10_1109_JSAC_2025_3531568 crossref_primary_10_1109_TGCN_2024_3373911 crossref_primary_10_1109_TCOMM_2024_3375815 crossref_primary_10_1002_ett_4504 crossref_primary_10_1007_s11277_025_11753_z crossref_primary_10_1109_JIOT_2022_3224204 crossref_primary_10_1109_TVT_2025_3538340 crossref_primary_10_1109_TVT_2022_3195696
Cites_doi	10.1109/LWC.2014.2353059 10.1109/TIT.2012.2186786 10.1109/LCOMM.2017.2786252 10.1109/TWC.2013.112513.130760 10.1109/JIOT.2018.2856633 10.1109/TWC.2017.2650987 10.1109/GLOCOM.2016.7842087 10.1109/TWC.2019.2950318 10.1109/TVT.2018.2851619 10.1109/TCOMM.2017.2709301 10.1109/TWC.2016.2616310 10.1109/TWC.2019.2904257 10.1109/TWC.2016.2606100 10.1109/TWC.2014.2324588 10.1109/TWC.2019.2893335 10.1109/JPROC.2016.2537298 10.1109/JIOT.2019.2907993 10.1017/CBO9780511804441 10.1109/TWC.2018.2850302 10.1109/JSAC.2017.2724678 10.1109/LSP.2017.2667620 10.1109/LWC.2017.2779485 10.1109/TVT.2018.2871259 10.1109/TCOMM.2017.2650992 10.1137/120891009 10.1109/JSAC.2017.2725618 10.1109/MCOM.2017.1500657CM 10.1109/TVT.2015.2480766 10.1016/j.sorms.2012.08.001 10.1109/TWC.2018.2827368 10.1109/TIT.2010.2043769 10.1109/JSAC.2018.2874143 10.1109/LWC.2017.2736539 10.1109/TCOMM.2019.2915225 10.1109/MWC.2018.1800259 10.1109/LCOMM.2012.071612.120447 10.1109/PIMRC.2017.8292490 10.1109/TCOMM.2015.2511087 10.1109/ICC.2017.7996416 10.1109/MWC.2017.1700069 10.1109/LCOMM.2015.2441064
ContentType	Journal Article
Copyright	Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
Copyright_xml	– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2020
DBID	97E RIA RIE AAYXX CITATION 7SP 8FD FR3 KR7 L7M
DOI	10.1109/TVT.2019.2960506
DatabaseName	IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Electronics & Communications Abstracts Technology Research Database Engineering Research Database Civil Engineering Abstracts Advanced Technologies Database with Aerospace
DatabaseTitle	CrossRef Civil Engineering Abstracts Engineering Research Database Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts
DatabaseTitleList	Civil Engineering Abstracts
Database_xml	– sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering
EISSN	1939-9359
EndPage	2156
ExternalDocumentID	10_1109_TVT_2019_2960506 8936382
Genre	orig-research
GrantInformation_xml	– fundername: National Natural Science Foundation of China grantid: 61631005; 61801101 funderid: 10.13039/501100001809 – fundername: Science and Technology Development Fund, Macau SAR – fundername: Research Committee of University of Macau grantid: MYRG2018-00156-FST
GroupedDBID	-~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAIKC AAJGR AAMNW AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IAAWW IBMZZ ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P RIA RIE RNS RXW TAE TN5 VH1 AAYXX CITATION 7SP 8FD FR3 KR7 L7M
ID	FETCH-LOGICAL-c291t-328fb9b77ca2dda8f9dce96d250fddfa26138de2d8b2c53e107597e1780d0c843
IEDL.DBID	RIE
ISICitedReferencesCount	38
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000519957800080&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0018-9545
IngestDate	Mon Jun 30 10:20:25 EDT 2025 Tue Nov 18 22:26:33 EST 2025 Sat Nov 29 02:18:38 EST 2025 Wed Aug 27 02:36:25 EDT 2025
IsPeerReviewed	true
IsScholarly	true
Issue	2
Language	English
License	https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037
LinkModel	DirectLink
MergedId	FETCHMERGED-LOGICAL-c291t-328fb9b77ca2dda8f9dce96d250fddfa26138de2d8b2c53e107597e1780d0c843
Notes	ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14
ORCID	0000-0002-2196-9799 0000-0001-5521-3650 0000-0003-3889-492X 0000-0003-2671-5090
PQID	2357210563
PQPubID	85454
PageCount	16
ParticipantIDs	ieee_primary_8936382 crossref_citationtrail_10_1109_TVT_2019_2960506 proquest_journals_2357210563 crossref_primary_10_1109_TVT_2019_2960506
PublicationCentury	2000
PublicationDate	2020-02-01
PublicationDateYYYYMMDD	2020-02-01
PublicationDate_xml	– month: 02 year: 2020 text: 2020-02-01 day: 01
PublicationDecade	2020
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	IEEE transactions on vehicular technology
PublicationTitleAbbrev	TVT
PublicationYear	2020
Publisher	IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml	– name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References	ref35 ref13 ref34 ref12 ref37 ref15 ref36 ref14 ref31 ref30 ref33 ref11 ref32 ref10 ref2 ref1 ref39 ref17 grant (ref40) 0 ref16 ref19 ref18 lanckriet (ref38) 0 ref24 ref23 ref26 ref25 ref20 ref42 ref22 ref44 ref21 ref43 ref28 ref27 nemirovskii (ref41) 2004 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5
References_xml	– ident: ref13 doi: 10.1109/LWC.2014.2353059 – ident: ref3 doi: 10.1109/TIT.2012.2186786 – ident: ref32 doi: 10.1109/LCOMM.2017.2786252 – ident: ref43 doi: 10.1109/TWC.2013.112513.130760 – ident: ref19 doi: 10.1109/JIOT.2018.2856633 – ident: ref33 doi: 10.1109/TWC.2017.2650987 – ident: ref42 doi: 10.1109/GLOCOM.2016.7842087 – ident: ref31 doi: 10.1109/TWC.2019.2950318 – ident: ref16 doi: 10.1109/TVT.2018.2851619 – ident: ref28 doi: 10.1109/TCOMM.2017.2709301 – ident: ref24 doi: 10.1109/TWC.2016.2616310 – ident: ref18 doi: 10.1109/TWC.2019.2904257 – ident: ref26 doi: 10.1109/TWC.2016.2606100 – ident: ref39 doi: 10.1109/TWC.2014.2324588 – start-page: 1759 year: 0 ident: ref38 article-title: On the convergence of the concave-convex procedure publication-title: Proc Adv Neural Inf Process Syst – ident: ref35 doi: 10.1109/TWC.2019.2893335 – ident: ref4 doi: 10.1109/JPROC.2016.2537298 – ident: ref7 doi: 10.1109/JIOT.2019.2907993 – ident: ref44 doi: 10.1017/CBO9780511804441 – ident: ref10 doi: 10.1109/TWC.2018.2850302 – year: 0 ident: ref40 article-title: CVX: Matlab software for disciplined convex programming – ident: ref21 doi: 10.1109/JSAC.2017.2724678 – ident: ref5 doi: 10.1109/LSP.2017.2667620 – ident: ref27 doi: 10.1109/LWC.2017.2779485 – ident: ref11 doi: 10.1109/TVT.2018.2871259 – ident: ref25 doi: 10.1109/TCOMM.2017.2650992 – ident: ref37 doi: 10.1137/120891009 – ident: ref22 doi: 10.1109/JSAC.2017.2725618 – year: 2004 ident: ref41 article-title: Interior point polynomial algorithms in convex programming – ident: ref34 doi: 10.1109/MCOM.2017.1500657CM – ident: ref23 doi: 10.1109/TVT.2015.2480766 – ident: ref36 doi: 10.1016/j.sorms.2012.08.001 – ident: ref29 doi: 10.1109/TWC.2018.2827368 – ident: ref2 doi: 10.1109/TIT.2010.2043769 – ident: ref14 doi: 10.1109/JSAC.2018.2874143 – ident: ref9 doi: 10.1109/LWC.2017.2736539 – ident: ref17 doi: 10.1109/TCOMM.2019.2915225 – ident: ref6 doi: 10.1109/MWC.2018.1800259 – ident: ref8 doi: 10.1109/LCOMM.2012.071612.120447 – ident: ref30 doi: 10.1109/PIMRC.2017.8292490 – ident: ref12 doi: 10.1109/TCOMM.2015.2511087 – ident: ref15 doi: 10.1109/ICC.2017.7996416 – ident: ref1 doi: 10.1109/MWC.2017.1700069 – ident: ref20 doi: 10.1109/LCOMM.2015.2441064
SSID	ssj0014491
Score	2.4683871
SecondaryResourceType	review_article
Snippet	In this paper, we study the resource allocation problem for downlink multicarrier non-orthogonal multiple access systems with short-packet communications...
SourceID	proquest crossref ieee
SourceType	Aggregation Database Enrichment Source Index Database Publisher
StartPage	2141
SubjectTerms	Algorithms Complexity Computer simulation Decoding Downlink Dynamic programming Error analysis Heuristic algorithms Mixed integer multicarrier non-orthogonal multiple access NOMA Nonlinear programming Nonorthogonal multiple access optimal resource allocation Optimization Performance evaluation Resource allocation Resource management Short packet communications Silicon carbide Subcarriers Wireless communications
Title	Optimal Resource Allocation for Multicarrier NOMA in Short Packet Communications
URI	https://ieeexplore.ieee.org/document/8936382 https://www.proquest.com/docview/2357210563
Volume	69
WOSCitedRecordID	wos000519957800080&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1939-9359 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014491 issn: 0018-9545 databaseCode: RIE dateStart: 19670101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA61eNCDrypWq-TgRXDbfTbJsYjFi23BKr0tSSaLhbqVPvz9TtLdpaII3vYwgWUm88o8PkJuBFMy4xB7fhZJL9aRQJ1LjMelxbhSwnBQDmyCDQZ8MhGjGrmrZmGMMa75zLTtp6vlw1yv7VNZB30rXhc0uDuMdTezWlXFII4LdLwAFRjDgrIk6YvO-HVse7hEO8RwPbHYRlsuyGGq_DDEzrv0D__3X0fkoIgiaW8j9mNSM_kJ2d_aLdggoyEag3ckKh_oaW9mHZcVBMVIlbrRWy0XFrKODoZPPTrN6fMbhuN0JFG3V_Tb8MjylLz0H8b3j14Bn-DpUAQrLwp5poRiTMsQQPJMgDaiCxj0ZACZxNwp4mBC4CrUSWQwEcTswgSM--BrHkdnpJ7Pc3NOqBFxEmqIIOEqzroBF9KXSjEAPwCVsSbplBxNdbFb3EJczFKXY_giRRmkVgZpIYMmua1OfGz2avxB27A8r-gKdjdJqxRaWijeMrXbezCLTbrRxe-nLsleaFNm13jdIvXVYm2uyK7-XE2Xi2t3p74ANyfKdA
linkProvider	IEEE
linkToHtml	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5KFdSDb7E-c_AiuO0-u8mxiKWifYBVeluSTBYLWqVd_f1O4rYoiuBtDxNYZjKvzOMDOBOpkjnH2PPzSHqxjgTpXGI8Li3GlRKGo3JgE2mvx0cjMajAxWIWxhjjms9M3X66Wj6-6Df7VNYg30rXhQzukkXOKqe1FjWDOC7x8QJSYQoM5kVJXzSGD0PbxSXqIQXsiUU3-uKEHKrKD1Ps_Et7439_tgnrZRzJWp-C34KKmWzD2pftgjsw6JM5eCai-RM9az1Z12VFwShWZW74VsupBa1jvX63xcYTdvdIATkbSNLugn0bH5ntwn37anjZ8UoABU-HIii8KOS5EipNtQwRJc8FaiOaSGFPjphLyp4ijiZErkKdRIZSQcovTJByH33N42gPqpOXidkHZkSchBojTLiK82bAhfSlUimiH6DK0xo05hzNdLld3IJcPGUuy_BFRjLIrAyyUgY1OF-ceP3crPEH7Y7l-YKuZHcNjuZCy0rVm2V2fw_lsUkzOvj91CmsdIbd2-z2undzCKuhTaBdG_YRVIvpmzmGZf1ejGfTE3e_PgDtpM29
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Optimal+Resource+Allocation+for+Multicarrier+NOMA+in+Short+Packet+Communications&rft.jtitle=IEEE+transactions+on+vehicular+technology&rft.au=Chen%2C+Jie&rft.au=Zhang%2C+Lin&rft.au=Ying-Chang%2C+Liang&rft.au=Ma%2C+Shaodan&rft.date=2020-02-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9545&rft.eissn=1939-9359&rft.volume=69&rft.issue=2&rft.spage=2141&rft_id=info:doi/10.1109%2FTVT.2019.2960506&rft.externalDBID=NO_FULL_TEXT
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9545&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9545&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9545&client=summon