File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1109/ICC.2018.8422358
- Scopus: eid_2-s2.0-85051435549
- Find via
Supplementary
-
Citations:
- Scopus: 0
- Appears in Collections:
Conference Paper: Resource allocation in cache-enabled CRAN with non-orthogonal multiple access
Title | Resource allocation in cache-enabled CRAN with non-orthogonal multiple access |
---|---|
Authors | |
Issue Date | 2018 |
Citation | IEEE International Conference on Communications, 2018, v. 2018-May, article no. 8422358 How to Cite? |
Abstract | This paper studies the application of non-orthogonal multiple access (NOMA) to cache-enabled cloud radio access network (CRAN) with mixed multicast and unicast transmission. Users requesting the same content are grouped together and served with a cluster of remote radio heads (RRHs) using distributed beamforming. In addition, the user with better channel condition in each group is allowed to request an extra unicast content via the NOMA protocol. Each RRH has a local cache which enables it to acquire the requested contents either from the local cache or from the central processor via the fronthaul link. Taking the maximum fronthaul capacity into consideration, we investigate the subchannel (SC) allocation problem to both RRHs and multicast groups to improve the weighted network sum rate. The optimal solution requires exhaustive search, which become prohibitively complicated as the number of RRHs and groups increases. To tackle this problem effectively, we formulate this problem as a three-sided matching problem among SCs, RRHs and multicast groups, and propose a novel low-complexity matching algorithm. We prove mathematically that the proposed algorithm converges to a stable matching within limited number of iterations. Numerical results unveil that the proposed algorithm closely approaches the optimal solution and outperforms the conventional orthogonal multiple access (OMA)-based CRAN. |
Persistent Identifier | http://hdl.handle.net/10722/349272 |
ISSN |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhao, Jingjing | - |
dc.contributor.author | Liu, Yuanwei | - |
dc.contributor.author | Mahmoodi, Toktam | - |
dc.contributor.author | Chai, Kok Keong | - |
dc.contributor.author | Chen, Yue | - |
dc.contributor.author | Han, Zhu | - |
dc.date.accessioned | 2024-10-17T06:57:26Z | - |
dc.date.available | 2024-10-17T06:57:26Z | - |
dc.date.issued | 2018 | - |
dc.identifier.citation | IEEE International Conference on Communications, 2018, v. 2018-May, article no. 8422358 | - |
dc.identifier.issn | 1550-3607 | - |
dc.identifier.uri | http://hdl.handle.net/10722/349272 | - |
dc.description.abstract | This paper studies the application of non-orthogonal multiple access (NOMA) to cache-enabled cloud radio access network (CRAN) with mixed multicast and unicast transmission. Users requesting the same content are grouped together and served with a cluster of remote radio heads (RRHs) using distributed beamforming. In addition, the user with better channel condition in each group is allowed to request an extra unicast content via the NOMA protocol. Each RRH has a local cache which enables it to acquire the requested contents either from the local cache or from the central processor via the fronthaul link. Taking the maximum fronthaul capacity into consideration, we investigate the subchannel (SC) allocation problem to both RRHs and multicast groups to improve the weighted network sum rate. The optimal solution requires exhaustive search, which become prohibitively complicated as the number of RRHs and groups increases. To tackle this problem effectively, we formulate this problem as a three-sided matching problem among SCs, RRHs and multicast groups, and propose a novel low-complexity matching algorithm. We prove mathematically that the proposed algorithm converges to a stable matching within limited number of iterations. Numerical results unveil that the proposed algorithm closely approaches the optimal solution and outperforms the conventional orthogonal multiple access (OMA)-based CRAN. | - |
dc.language | eng | - |
dc.relation.ispartof | IEEE International Conference on Communications | - |
dc.title | Resource allocation in cache-enabled CRAN with non-orthogonal multiple access | - |
dc.type | Conference_Paper | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1109/ICC.2018.8422358 | - |
dc.identifier.scopus | eid_2-s2.0-85051435549 | - |
dc.identifier.volume | 2018-May | - |
dc.identifier.spage | article no. 8422358 | - |
dc.identifier.epage | article no. 8422358 | - |