Resource allocation for ultra-reliable low latency communications in sparse code multiple access networks
Abstract In this paper, we propose an optimal resource allocation policy for sparse code multiple access (SCMA) networks supporting ultra-reliable low-latency communications (URLLC). The network is assumed to operate with finite blocklength (FBL) codes, which is opposed to the classical information-...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2018-12-01
|
| Series: | EURASIP Journal on Wireless Communications and Networking |
| Subjects: | |
| Online Access: | http://link.springer.com/article/10.1186/s13638-018-1300-5 |
| _version_ | 1818942990711783424 |
|---|---|
| author | Qinwei He Yulin Hu Anke Schmeink |
| author_facet | Qinwei He Yulin Hu Anke Schmeink |
| author_sort | Qinwei He |
| collection | DOAJ |
| description | Abstract In this paper, we propose an optimal resource allocation policy for sparse code multiple access (SCMA) networks supporting ultra-reliable low-latency communications (URLLC). The network is assumed to operate with finite blocklength (FBL) codes, which is opposed to the classical information-theoretic works with infinite blocklength (IBL) codes. In particular, we aim at maximizing the average transmission rate in the FBL regime while guaranteeing the transmission reliability. A joint design is proposed, which combines the power allocation with the codebook assignment. The convexity of the corresponding optimization problem is analyzed and an iterative search algorithm is further provided. We study the impact of reliability and short blocklength constraints on the performance of the proposed optimal resource allocation policy through numerical simulations. In addition, we evaluate the FBL performance of the proposed joint design in comparison to the scenario with an IBL assumption. |
| first_indexed | 2024-12-20T07:20:13Z |
| format | Article |
| id | doaj.art-5df7127f316740348ccac8cd86247dd2 |
| institution | Directory Open Access Journal |
| issn | 1687-1499 |
| language | English |
| last_indexed | 2024-12-20T07:20:13Z |
| publishDate | 2018-12-01 |
| publisher | SpringerOpen |
| record_format | Article |
| series | EURASIP Journal on Wireless Communications and Networking |
| spelling | doaj.art-5df7127f316740348ccac8cd86247dd22022-12-21T19:48:41ZengSpringerOpenEURASIP Journal on Wireless Communications and Networking1687-14992018-12-01201811910.1186/s13638-018-1300-5Resource allocation for ultra-reliable low latency communications in sparse code multiple access networksQinwei He0Yulin Hu1Anke Schmeink2ISEK Research Group, RWTH Aachen UniversityInformationstheorie und Systematischer Entwurf von Kommunikationssystemen, RWTH Aachen UniversityISEK Research Group, RWTH Aachen UniversityAbstract In this paper, we propose an optimal resource allocation policy for sparse code multiple access (SCMA) networks supporting ultra-reliable low-latency communications (URLLC). The network is assumed to operate with finite blocklength (FBL) codes, which is opposed to the classical information-theoretic works with infinite blocklength (IBL) codes. In particular, we aim at maximizing the average transmission rate in the FBL regime while guaranteeing the transmission reliability. A joint design is proposed, which combines the power allocation with the codebook assignment. The convexity of the corresponding optimization problem is analyzed and an iterative search algorithm is further provided. We study the impact of reliability and short blocklength constraints on the performance of the proposed optimal resource allocation policy through numerical simulations. In addition, we evaluate the FBL performance of the proposed joint design in comparison to the scenario with an IBL assumption.http://link.springer.com/article/10.1186/s13638-018-1300-5Finite blocklengthResource allocationSCMAURLLC |
| spellingShingle | Qinwei He Yulin Hu Anke Schmeink Resource allocation for ultra-reliable low latency communications in sparse code multiple access networks EURASIP Journal on Wireless Communications and Networking Finite blocklength Resource allocation SCMA URLLC |
| title | Resource allocation for ultra-reliable low latency communications in sparse code multiple access networks |
| title_full | Resource allocation for ultra-reliable low latency communications in sparse code multiple access networks |
| title_fullStr | Resource allocation for ultra-reliable low latency communications in sparse code multiple access networks |
| title_full_unstemmed | Resource allocation for ultra-reliable low latency communications in sparse code multiple access networks |
| title_short | Resource allocation for ultra-reliable low latency communications in sparse code multiple access networks |
| title_sort | resource allocation for ultra reliable low latency communications in sparse code multiple access networks |
| topic | Finite blocklength Resource allocation SCMA URLLC |
| url | http://link.springer.com/article/10.1186/s13638-018-1300-5 |
| work_keys_str_mv | AT qinweihe resourceallocationforultrareliablelowlatencycommunicationsinsparsecodemultipleaccessnetworks AT yulinhu resourceallocationforultrareliablelowlatencycommunicationsinsparsecodemultipleaccessnetworks AT ankeschmeink resourceallocationforultrareliablelowlatencycommunicationsinsparsecodemultipleaccessnetworks |