Spectrum Allocation and Power Control for Non-Orthogonal Multiple Access in HetNets
In this paper, a novel resource allocation design is investigated for non-orthogonal multiple access (NOMA) enhanced heterogeneous networks (HetNets), where small cell base stations (SBSs) are capable of communicating with multiple small cell users (SCUs) via the NOMA protocol. With the aim of maxim...
Uložené v:
| Vydané v: | IEEE transactions on wireless communications Ročník 16; číslo 9; s. 5825 - 5837 |
|---|---|
| Hlavní autori: | , , , , , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.09.2017
|
| Predmet: | |
| ISSN: | 1536-1276 |
| 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, a novel resource allocation design is investigated for non-orthogonal multiple access (NOMA) enhanced heterogeneous networks (HetNets), where small cell base stations (SBSs) are capable of communicating with multiple small cell users (SCUs) via the NOMA protocol. With the aim of maximizing the sum rate of SCUs while taking the fairness issue into consideration, a joint problem of spectrum allocation and power control is formulated. In particular, the spectrum allocation problem is modeled as a many-to-one matching game with peer effects. We propose a novel algorithm where the SBSs and resource blocks interact to decide their desired allocation. The proposed algorithm is proved to converge to a two-sided exchange-stable matching. Furthermore, we introduce the concept of `exploration' into the matching game for further improving the SCUs' sum rate. The power control of each SBS is formulated as a non-convex problem, where the sequential convex programming is adopted to iteratively update the power allocation result by solving the approximate convex problem. The obtained solution is proved to satisfy the Karush-Kuhn-Tucker conditions. We unveil that: 1) the proposed algorithm closely approaches the optimal solution within a limited number of iterations; 2) the `exploration' action is capable of further enhancing the performance of the matching algorithm; and 3) the developed NOMA-enhanced HetNets achieve a higher SCUs' sum rate compared with the conventional OMA-based HetNets. |
|---|---|
| AbstractList | In this paper, a novel resource allocation design is investigated for non-orthogonal multiple access (NOMA) enhanced heterogeneous networks (HetNets), where small cell base stations (SBSs) are capable of communicating with multiple small cell users (SCUs) via the NOMA protocol. With the aim of maximizing the sum rate of SCUs while taking the fairness issue into consideration, a joint problem of spectrum allocation and power control is formulated. In particular, the spectrum allocation problem is modeled as a many-to-one matching game with peer effects. We propose a novel algorithm where the SBSs and resource blocks interact to decide their desired allocation. The proposed algorithm is proved to converge to a two-sided exchange-stable matching. Furthermore, we introduce the concept of `exploration' into the matching game for further improving the SCUs' sum rate. The power control of each SBS is formulated as a non-convex problem, where the sequential convex programming is adopted to iteratively update the power allocation result by solving the approximate convex problem. The obtained solution is proved to satisfy the Karush-Kuhn-Tucker conditions. We unveil that: 1) the proposed algorithm closely approaches the optimal solution within a limited number of iterations; 2) the `exploration' action is capable of further enhancing the performance of the matching algorithm; and 3) the developed NOMA-enhanced HetNets achieve a higher SCUs' sum rate compared with the conventional OMA-based HetNets. |
| Author | Jingjing Zhao Yuanwei Liu Kok Keong Chai Yue Chen Zhu Han Nallanathan, Arumugam |
| Author_xml | – sequence: 1 surname: Jingjing Zhao fullname: Jingjing Zhao email: j.zhao@qmul.ac.uk organization: Queen Mary, Univ. of London, London, UK – sequence: 2 surname: Yuanwei Liu fullname: Yuanwei Liu email: yuanwei.liu@qmul.ac.uk organization: Queen Mary, Univ. of London, London, UK – sequence: 3 surname: Kok Keong Chai fullname: Kok Keong Chai email: michael.chai@qmul.ac.uk organization: Queen Mary, Univ. of London, London, UK – sequence: 4 givenname: Arumugam surname: Nallanathan fullname: Nallanathan, Arumugam email: nallanathan@ieee.org organization: Queen Mary, Univ. of London, London, UK – sequence: 5 surname: Yue Chen fullname: Yue Chen email: yue.chen@qmul.ac.uk organization: Queen Mary, Univ. of London, London, UK – sequence: 6 surname: Zhu Han fullname: Zhu Han email: zhan2@uh.edu organization: Univ. of Houston, Houston, TX, USA |
| BookMark | eNp9kMFKAzEQhnOoYFu9C17yAluT7G6yOZZFrVBboRWPSzY7q5E0KUmK-PZutXjw4Glghm_mn2-CRs47QOiKkhmlRN5sX-oZI1TMmKBcMjpCY1rmPKNM8HM0ifGdDFNelmO02exBp3DY4bm1XqtkvMPKdfjJf0DAtXcpeIt7H_DKu2wd0pt_9U5Z_Hiwyewt4LnWECM2Di8grSDFC3TWKxvh8lSn6PnudlsvsuX6_qGeLzOdM5myvlN9BbyXBMSQhilSFpXkDFqpdUEklC1RrOKtyquW56QQlRhaLZeEdazj-RSRn706-BgD9M0-mJ0Knw0lzVFEM4hojiKak4gB4X8QbdL30ykoY_8Dr39AAwC_d4QsiyFZ_gVEQG8K |
| CODEN | ITWCAX |
| CitedBy_id | crossref_primary_10_1016_j_phycom_2018_09_006 crossref_primary_10_1109_ACCESS_2019_2900225 crossref_primary_10_1109_TVT_2020_3003062 crossref_primary_10_1109_TCOMM_2019_2944142 crossref_primary_10_1109_TVT_2021_3055769 crossref_primary_10_1007_s11235_023_01098_y crossref_primary_10_3390_electronics8111355 crossref_primary_10_1109_TVT_2020_3040645 crossref_primary_10_1109_TVT_2023_3267452 crossref_primary_10_1109_JSTSP_2019_2899238 crossref_primary_10_1109_TCCN_2019_2945802 crossref_primary_10_1109_TWC_2022_3221469 crossref_primary_10_1109_TSMC_2019_2897166 crossref_primary_10_1109_TVT_2020_2972363 crossref_primary_10_1016_j_jksuci_2022_11_004 crossref_primary_10_1109_TCOMM_2018_2831206 crossref_primary_10_1109_TWC_2021_3057232 crossref_primary_10_1109_TGCN_2023_3334495 crossref_primary_10_1016_j_phycom_2020_101043 crossref_primary_10_1109_ACCESS_2019_2916921 crossref_primary_10_1016_j_comnet_2019_106904 crossref_primary_10_3390_s25092733 crossref_primary_10_1109_TCOMM_2018_2879508 crossref_primary_10_1109_TVT_2020_2991466 crossref_primary_10_1109_TVT_2021_3109883 crossref_primary_10_1007_s12083_021_01176_5 crossref_primary_10_1109_TWC_2024_3387551 crossref_primary_10_3390_computers12080158 crossref_primary_10_1016_j_phycom_2022_101837 crossref_primary_10_32604_cmc_2021_018351 crossref_primary_10_1007_s00034_023_02517_w crossref_primary_10_1016_j_comcom_2021_03_025 crossref_primary_10_1109_LCOMM_2021_3075064 crossref_primary_10_1109_JSYST_2022_3141522 crossref_primary_10_1016_j_aeue_2021_153626 crossref_primary_10_3390_s19235307 crossref_primary_10_1016_j_comnet_2022_109250 crossref_primary_10_1109_ACCESS_2021_3116706 crossref_primary_10_1109_JSYST_2019_2927718 crossref_primary_10_1177_1550147719866140 crossref_primary_10_1002_ett_4465 crossref_primary_10_1109_JSYST_2020_3043436 crossref_primary_10_1109_TVT_2021_3074189 crossref_primary_10_1109_JSTSP_2019_2908652 crossref_primary_10_1109_ACCESS_2019_2929185 crossref_primary_10_1109_JSYST_2019_2940985 crossref_primary_10_1109_TVT_2023_3266188 crossref_primary_10_1109_ACCESS_2022_3180982 crossref_primary_10_1109_TVT_2020_2993729 crossref_primary_10_1002_ett_4630 crossref_primary_10_1016_j_comcom_2022_04_025 crossref_primary_10_1016_j_comnet_2021_107950 crossref_primary_10_1109_TCOMM_2024_3439443 crossref_primary_10_1109_TWC_2018_2844359 crossref_primary_10_1109_TVT_2021_3095955 crossref_primary_10_1109_TCOMM_2024_3511952 crossref_primary_10_1109_TCOMM_2023_3241355 crossref_primary_10_1109_COMST_2021_3059896 crossref_primary_10_1109_TCOMM_2019_2919547 crossref_primary_10_1177_15485129211000139 crossref_primary_10_1109_TWC_2022_3209667 crossref_primary_10_1002_dac_4784 crossref_primary_10_1109_TVT_2024_3353339 crossref_primary_10_1109_TWC_2020_2968426 crossref_primary_10_1109_TVT_2018_2881314 crossref_primary_10_3390_electronics11111700 crossref_primary_10_1109_TWC_2022_3207918 crossref_primary_10_1109_JSAC_2020_3018809 crossref_primary_10_3233_JIFS_213444 crossref_primary_10_1109_TNSE_2018_2879674 crossref_primary_10_1186_s13638_019_1528_8 crossref_primary_10_1109_JIOT_2021_3050013 crossref_primary_10_1109_ACCESS_2020_2973501 crossref_primary_10_1109_TWC_2023_3244968 crossref_primary_10_1109_ACCESS_2018_2808473 crossref_primary_10_1016_j_comnet_2024_110169 crossref_primary_10_1109_ACCESS_2020_3013835 crossref_primary_10_1109_TITS_2024_3371096 crossref_primary_10_1016_j_phycom_2024_102297 crossref_primary_10_1109_ACCESS_2021_3078641 crossref_primary_10_1109_TCOMM_2018_2851593 crossref_primary_10_1109_TNSE_2022_3197888 crossref_primary_10_1109_JSEN_2021_3135449 crossref_primary_10_1049_iet_com_2018_5251 crossref_primary_10_1109_ACCESS_2018_2799959 crossref_primary_10_1088_1742_6596_2637_1_012046 crossref_primary_10_1109_TVT_2018_2877619 crossref_primary_10_1016_j_comnet_2019_05_002 crossref_primary_10_1109_TVT_2019_2956921 crossref_primary_10_1177_15501329221132496 crossref_primary_10_1109_TVT_2017_2777540 crossref_primary_10_1016_j_comnet_2022_108977 crossref_primary_10_1109_JSAC_2021_3087225 crossref_primary_10_1109_JSAC_2022_3143237 crossref_primary_10_1109_ACCESS_2019_2926438 crossref_primary_10_1109_TWC_2021_3120325 crossref_primary_10_1109_COMST_2018_2835558 crossref_primary_10_1109_ACCESS_2020_2992648 crossref_primary_10_1109_TCOMM_2020_3016742 crossref_primary_10_1016_j_comnet_2018_04_010 crossref_primary_10_1109_LCOMM_2017_2789282 crossref_primary_10_1109_ACCESS_2019_2959434 crossref_primary_10_1109_TVT_2024_3523524 crossref_primary_10_1109_ACCESS_2019_2906780 crossref_primary_10_1109_TWC_2020_2978843 crossref_primary_10_1109_JSTSP_2019_2898643 crossref_primary_10_1109_TCOMM_2023_3242352 crossref_primary_10_1016_j_adhoc_2024_103742 crossref_primary_10_1109_ACCESS_2018_2835568 crossref_primary_10_1109_TVT_2024_3376524 crossref_primary_10_1109_TVT_2019_2918336 crossref_primary_10_1109_TVT_2021_3068855 crossref_primary_10_1109_TCCN_2021_3074944 crossref_primary_10_1109_TII_2022_3141435 crossref_primary_10_1109_TCOMM_2021_3067700 crossref_primary_10_1109_TMC_2018_2845364 crossref_primary_10_1109_JSAC_2022_3143244 crossref_primary_10_1002_itl2_76 crossref_primary_10_1109_ACCESS_2021_3071190 crossref_primary_10_1109_TCOMM_2018_2874239 crossref_primary_10_1109_TMC_2023_3235394 crossref_primary_10_1016_j_aeue_2020_153195 crossref_primary_10_1016_j_aeue_2022_154477 crossref_primary_10_1109_TVT_2021_3062065 crossref_primary_10_1109_TWC_2022_3181214 crossref_primary_10_1109_ACCESS_2018_2877181 crossref_primary_10_1016_j_vehcom_2023_100657 crossref_primary_10_3390_s22031129 crossref_primary_10_1109_ACCESS_2020_2991780 crossref_primary_10_1109_ACCESS_2023_3307407 crossref_primary_10_1109_JSAC_2024_3460049 |
| Cites_doi | 10.1007/s00182-008-0122-9 10.1109/JSAC.2012.120405 10.1007/978-3-642-24829-0_12 10.1109/ICC.2015.7248775 10.1109/LSP.2015.2417119 10.1109/TCOMM.2016.2594759 10.1109/GLOCOM.2016.7842161 10.1109/90.879343 10.1109/ICC.2006.255311 10.1109/LSP.2014.2343971 10.1109/TWC.2012.121112.120018 10.1109/LSP.2016.2591561 10.1109/MCOM.2015.7105641 10.1142/8591 10.1109/TWC.2016.2544922 10.1109/35.606032 10.1109/LCOMM.2016.2559459 10.1109/JSAC.2015.2417014 10.1016/S0167-2681(02)00015-X 10.1109/TWC.2014.2330831 10.1109/TWC.2016.2606100 10.1109/TWC.2013.040413.120676 10.1109/MCOM.2017.1500657CM 10.1109/TCOMM.2014.2339313 10.1109/GLOCOM.2014.7036917 10.1109/ISIT.2017.8006983 10.1109/JSAC.2016.2549378 10.1109/JSAC.2015.2435361 10.1017/CBO9780511804441 10.1006/jeth.1997.2291 10.1109/TCOMM.2017.2650992 |
| ContentType | Journal Article |
| DBID | 97E ESBDL RIA RIE AAYXX CITATION |
| DOI | 10.1109/TWC.2017.2716921 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005–Present IEEE Xplore Open Access Journals IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library (IEL) (UW System Shared) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EndPage | 5837 |
| ExternalDocumentID | 10_1109_TWC_2017_2716921 7954630 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: U.S. NSF grantid: CNS-1702850; CNS-1646607; ECCS-1547201; CCF-1456921; CMMI-1434789; CNS-1443917; ECCS-1405121 funderid: 10.13039/100000001 – fundername: ESRC U.K. grantid: ES/M008509/1 – fundername: joint programme between the Queen Mary University of London and the Beijing University of Posts and Telecommunications funderid: 10.13039/501100000851 |
| GroupedDBID | -~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFO ACGFS ACIWK AENEX AETIX AGQYO AGSQL AHBIQ AIBXA AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD ESBDL HZ~ H~9 IES IFIPE IPLJI JAVBF LAI M43 O9- OCL P2P RIA RIE RNS AAYXX CITATION |
| ID | FETCH-LOGICAL-c329t-fdaf8e6f90e71762a0548962eb9cc409e5b0a286ba38b63047875b0b6902d2d63 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 166 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000409982900018&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1536-1276 |
| IngestDate | Sat Nov 29 06:23:43 EST 2025 Tue Nov 18 21:09:04 EST 2025 Wed Aug 27 02:52:45 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 9 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/OAPA.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c329t-fdaf8e6f90e71762a0548962eb9cc409e5b0a286ba38b63047875b0b6902d2d63 |
| ORCID | 0000-0002-6389-8941 |
| OpenAccessLink | https://ieeexplore.ieee.org/document/7954630 |
| PageCount | 13 |
| ParticipantIDs | ieee_primary_7954630 crossref_citationtrail_10_1109_TWC_2017_2716921 crossref_primary_10_1109_TWC_2017_2716921 |
| PublicationCentury | 2000 |
| PublicationDate | 2017-Sept. 2017-9-00 |
| PublicationDateYYYYMMDD | 2017-09-01 |
| PublicationDate_xml | – month: 09 year: 2017 text: 2017-Sept. |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE transactions on wireless communications |
| PublicationTitleAbbrev | TWC |
| PublicationYear | 2017 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref13 ref34 ref12 ref15 ref14 ref31 ref30 ref11 lei (ref23) 2015 ref32 ref10 roth (ref20) 1992 ref2 ref1 ref17 ref16 ref19 ref18 manlove (ref22) 2013; 2 ref24 ref26 ref25 jain (ref33) 1984; 38 ref21 ref28 ref27 ref29 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – ident: ref29 doi: 10.1007/s00182-008-0122-9 – ident: ref1 doi: 10.1109/JSAC.2012.120405 – ident: ref30 doi: 10.1007/978-3-642-24829-0_12 – volume: 38 year: 1984 ident: ref33 article-title: A quantitative measure of fairness and discrimination for resource allocation in shared computer system – ident: ref6 doi: 10.1109/ICC.2015.7248775 – ident: ref9 doi: 10.1109/LSP.2015.2417119 – ident: ref15 doi: 10.1109/TCOMM.2016.2594759 – ident: ref16 doi: 10.1109/GLOCOM.2016.7842161 – ident: ref24 doi: 10.1109/90.879343 – start-page: 1 year: 2015 ident: ref23 article-title: Joint optimization of power and channel allocation with non-orthogonal multiple access for 5G cellular systems publication-title: Proc IEEE Global Commun Conf (GLOBECOM) – ident: ref25 doi: 10.1109/ICC.2006.255311 – ident: ref8 doi: 10.1109/LSP.2014.2343971 – ident: ref4 doi: 10.1109/TWC.2012.121112.120018 – year: 1992 ident: ref20 publication-title: Two-sided Matching A Study in Game-theoretic Modeling and Analysis – ident: ref11 doi: 10.1109/LSP.2016.2591561 – ident: ref21 doi: 10.1109/MCOM.2015.7105641 – volume: 2 year: 2013 ident: ref22 publication-title: Algorithmics of Matching under Preferences doi: 10.1142/8591 – ident: ref10 doi: 10.1109/TWC.2016.2544922 – ident: ref2 doi: 10.1109/35.606032 – ident: ref17 doi: 10.1109/LCOMM.2016.2559459 – ident: ref19 doi: 10.1109/JSAC.2015.2417014 – ident: ref32 doi: 10.1016/S0167-2681(02)00015-X – ident: ref27 doi: 10.1109/TWC.2014.2330831 – ident: ref14 doi: 10.1109/TWC.2016.2606100 – ident: ref3 doi: 10.1109/TWC.2013.040413.120676 – ident: ref7 doi: 10.1109/MCOM.2017.1500657CM – ident: ref5 doi: 10.1109/TCOMM.2014.2339313 – ident: ref31 doi: 10.1109/GLOCOM.2014.7036917 – ident: ref18 doi: 10.1109/ISIT.2017.8006983 – ident: ref12 doi: 10.1109/JSAC.2016.2549378 – ident: ref26 doi: 10.1109/JSAC.2015.2435361 – ident: ref34 doi: 10.1017/CBO9780511804441 – ident: ref28 doi: 10.1006/jeth.1997.2291 – ident: ref13 doi: 10.1109/TCOMM.2017.2650992 |
| SSID | ssj0017655 |
| Score | 2.6122396 |
| Snippet | In this paper, a novel resource allocation design is investigated for non-orthogonal multiple access (NOMA) enhanced heterogeneous networks (HetNets), where... |
| SourceID | crossref ieee |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 5825 |
| SubjectTerms | Fairness heterogeneous networks (HetNets) Interference matching game NOMA non-orthogonal multiple access (NOMA) Power control Protocols Resource management sequential convex programming Silicon carbide sum rate Wireless communication |
| Title | Spectrum Allocation and Power Control for Non-Orthogonal Multiple Access in HetNets |
| URI | https://ieeexplore.ieee.org/document/7954630 |
| Volume | 16 |
| WOSCitedRecordID | wos000409982900018&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/IET Electronic Library (IEL) (UW System Shared) issn: 1536-1276 databaseCode: RIE dateStart: 20020101 customDbUrl: isFulltext: true dateEnd: 99991231 titleUrlDefault: https://ieeexplore.ieee.org/ omitProxy: false ssIdentifier: ssj0017655 providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dS8MwFA1z-KAPfk1xfpEHXwS7tWmbj8cxHHvQOnDi3kqa3upgtrJ1_n6TtJYJIvhWQgLlpOHe09x7DkLXPMgYF1QfJDdxnSAgnsMl9RyW8RC8UKVE2kbhexZFfDYTkxa6bXphAMAWn0HPPNq7_LRQa_OrrM-EEW_XBH2LMVb1ajU3Boxah1N9gI2vDGuuJF3Rn74MTQ0X6xEjDUO8HyFow1PFhpTR_v9e5gDt1akjHlR7fYhakB-h3Q1BwQ56Mnby5XL9jgcLE6UM6ljmKZ4YMzQ8rOrSsU5UcVTkzuOyfCteTS6OH-rCQjywDop4nuMxlBGUq2P0PLqbDsdObZvgKJ-I0slSmXGgmXBBczVKpM7K9HYQSIRSms5BmLiScJpInyfUt_I8eijRPJmkJKX-CWrnRQ6nCPtuQqjO8MIQZACBJlNKpRBmQoCXycDrov43krGqNcWNtcUittzCFbHGPjbYxzX2XXTTrPio9DT-mNsxsDfzasTPfh8-RztmcVX_dYHaGmy4RNvqs5yvllf2Y_kCyUq7dg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fS8MwEA5jCuqDv6Y4f-bBF8FubdqmyeMYjolbHThxbyVNrzqYnWydf79JWssEEXwrIQ3lS8Ld9e6-D6Fr5qUB41RdJDu2Lc8jjsUEdawgZT44vkyIMI3CgyAM2WTCRzV0W_XCAIApPoOWfjS5_GQuV_pXWTvgmrxdBegbvl616NaqcgYBNRqn6gprZZmgSkravD1-6eoqrqBFNDkMcX4YoTVVFWNUenv_-5x9tFs6j7hT7PYBqkF2iHbWKAUb6EkLyueL1TvuzLSd0rhjkSV4pOXQcLeoTMfKVcXhPLMeF_nb_FV743hYlhbijtFQxNMM9yEPIV8eoefe3bjbt0rhBEu6hOdWmoiUAU25DSpao0Qov0xtCIGYS6kCOvBjWxBGY-GymLqGoEcNxSpSJglJqHuM6tk8gxOEXTsmVPl4vg_CA0-FU1Im4Kecg5MKz2mi9jeSkSxZxbW4xSwy0YXNI4V9pLGPSuyb6KZ646Ng1PhjbkPDXs0rET_9ffgKbfXHw0E0uA8fztC2XqioBjtHdQU8XKBN-ZlPl4tLc3C-ALazvr0 |
| 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=Spectrum+Allocation+and+Power+Control+for+Non-Orthogonal+Multiple+Access+in+HetNets&rft.jtitle=IEEE+transactions+on+wireless+communications&rft.au=Jingjing+Zhao&rft.au=Yuanwei+Liu&rft.au=Kok+Keong+Chai&rft.au=Nallanathan%2C+Arumugam&rft.date=2017-09-01&rft.pub=IEEE&rft.issn=1536-1276&rft.volume=16&rft.issue=9&rft.spage=5825&rft.epage=5837&rft_id=info:doi/10.1109%2FTWC.2017.2716921&rft.externalDocID=7954630 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1536-1276&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1536-1276&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1536-1276&client=summon |