A framework for radio resource allocation and SDMA grouping in massive MIMO systems

Bibliographic Details
Main Author: Mauricio, Weskley Vinicius Fernandes
Publication Date: 2021
Other Authors: Araújo, Daniel Costa, Maciel, Tarcísio Ferreira, Lima, Francisco Rafael Marques
Format: Article
Language: eng
Source: Repositório Institucional da Universidade Federal do Ceará (UFC)
Download full: http://www.repositorio.ufc.br/handle/riufc/67210
Summary: This work proposes a framework for multiuser massive Multiple Input Multiple Output (MIMO) systems which is composed of three parts - clustering , grouping , and scheduling - and aims at maximizing the total system data rate considering Quality of Service (QoS) constraints. We firstly use a clustering algorithm to create clusters of spatially correlated Mobile Stations (MSs). Secondly, in the grouping part, we select a set of Space-Division Multiple Access (SDMA) groups from each cluster. These groups are used as candidate groups to receive Scheduling Unit (SU) in the scheduling part. In order to compose a group, we employ a metric that takes into account the trade-off between the spatial channel correlation and channel gain of MSs. In this context, it is proposed a suboptimal solution to avoid the high complexity required by the optimal solution. Thirdly and finally, we use the candidate SDMA groups from the grouping part to solve the data rate maximization problem considering QoS requirements. The scheduling part can be solved by our proposed optimal solution based on Branch and Bound (BB). However, since it has high computational complexity, we propose a suboptimal scheduling algorithm that presents a reduced complexity. In the simulation results, we evaluate the performance of both optimal and suboptimal solutions, as well as an adaptation of the Joint Satisfaction Maximization (JSM) scheduler to a massive MIMO scenario. Although the suboptimal solution presents a performance loss compared to the optimal one, it is more suitable for practical settings as it is able to obtain a good performance-complexity trade-off. Furthermore, we show that the choice of a suitable trade-off between the spatial channel correlation and channel gain improves the system performance. Finally, for a low number of available SDMA groups, the suboptimal solution presents near optimal outage and a throughput loss of only 10% in comparison to the high-complexity optimal solution while it outperforms the JSM solution in terms of outage and system throughput.
id UFC-7_613f1b92bc9d733f6bcfe50bce5ca291
oai_identifier_str oai:repositorio.ufc.br:riufc/67210
network_acronym_str UFC-7
network_name_str Repositório Institucional da Universidade Federal do Ceará (UFC)
repository_id_str
spelling Mauricio, Weskley Vinicius FernandesAraújo, Daniel CostaMaciel, Tarcísio FerreiraLima, Francisco Rafael Marques2022-07-18T18:54:57Z2022-07-18T18:54:57Z2021MACIEL, T. F. et al. A framework for radio resource allocation and SDMA grouping in massive MIMO systems. IEEE Acess, vol. 9, p. 61680-61696, 20212169-3536http://www.repositorio.ufc.br/handle/riufc/67210This work proposes a framework for multiuser massive Multiple Input Multiple Output (MIMO) systems which is composed of three parts - clustering , grouping , and scheduling - and aims at maximizing the total system data rate considering Quality of Service (QoS) constraints. We firstly use a clustering algorithm to create clusters of spatially correlated Mobile Stations (MSs). Secondly, in the grouping part, we select a set of Space-Division Multiple Access (SDMA) groups from each cluster. These groups are used as candidate groups to receive Scheduling Unit (SU) in the scheduling part. In order to compose a group, we employ a metric that takes into account the trade-off between the spatial channel correlation and channel gain of MSs. In this context, it is proposed a suboptimal solution to avoid the high complexity required by the optimal solution. Thirdly and finally, we use the candidate SDMA groups from the grouping part to solve the data rate maximization problem considering QoS requirements. The scheduling part can be solved by our proposed optimal solution based on Branch and Bound (BB). However, since it has high computational complexity, we propose a suboptimal scheduling algorithm that presents a reduced complexity. In the simulation results, we evaluate the performance of both optimal and suboptimal solutions, as well as an adaptation of the Joint Satisfaction Maximization (JSM) scheduler to a massive MIMO scenario. Although the suboptimal solution presents a performance loss compared to the optimal one, it is more suitable for practical settings as it is able to obtain a good performance-complexity trade-off. Furthermore, we show that the choice of a suitable trade-off between the spatial channel correlation and channel gain improves the system performance. Finally, for a low number of available SDMA groups, the suboptimal solution presents near optimal outage and a throughput loss of only 10% in comparison to the high-complexity optimal solution while it outperforms the JSM solution in terms of outage and system throughput.IEEE AcessMassive MIMOChannel hardeningSDMA groupingRadio resource allocationQuality of serviceA framework for radio resource allocation and SDMA grouping in massive MIMO systemsinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleengreponame:Repositório Institucional da Universidade Federal do Ceará (UFC)instname:Universidade Federal do Ceará (UFC)instacron:UFCinfo:eu-repo/semantics/openAccessORIGINAL2021_art_tfmaciel.pdf2021_art_tfmaciel.pdfapplication/pdf1870549http://repositorio.ufc.br/bitstream/riufc/67210/1/2021_art_tfmaciel.pdf432827e3cfa20b871b7878533ecdfaecMD51LICENSElicense.txtlicense.txttext/plain; charset=utf-82152http://repositorio.ufc.br/bitstream/riufc/67210/2/license.txtfb3ad2d23d9790966439580114baefafMD52riufc/672102022-07-21 09:21:15.701oai:repositorio.ufc.br:riufc/67210TElDRU7Dh0EgREUgQVJNQVpFTkFNRU5UTyBFIERJU1RSSUJVScOHw4NPIE7Dg08tRVhDTFVTSVZBIAoKQW8gY29uY29yZGFyIGNvbSBlc3RhIGxpY2Vuw6dhLCB2b2PDqihzKSBhdXRvcihlcykgb3UgdGl0dWxhcihlcykgZG9zIGRpcmVpdG9zIGF1dG9yYWlzIGRhIG9icmEgYXF1aSBkZXNjcml0YSBjb25jZWRlKG0pIMOgIFVuaXZlcnNpZGFkZSBGZWRlcmFsIGRvIENlYXLDoSwgZ2VzdG9yYSBkbyBSZXBvc2l0w7NyaW8gSW5zdGl0dWNpb25hbCBkYSBVRkMgLSBSSS9VRkMsIG8gZGlyZWl0byBuw6NvLWV4Y2x1c2l2byBkZSByZXByb2R1emlyLCBjb252ZXJ0ZXIgKGNvbW8gZGVmaW5pZG8gYWJhaXhvKSBlL291IGRpc3RyaWJ1aXIgbyBkb2N1bWVudG8gZGVwb3NpdGFkbyBlbSBmb3JtYXRvIGltcHJlc3NvLCBlbGV0csO0bmljbyBvdSBlbSBxdWFscXVlciBvdXRybyBtZWlvLiBWb2PDqiBjb25jb3JkYShtKSBxdWUgYSBVbml2ZXJzaWRhZGUgRmVkZXJhbCBkbyBDZWFyw6EsIGdlc3RvcmEgZG8gUmVwb3NpdMOzcmlvIEluc3RpdHVjaW9uYWwgZGEgVUZDIC0gUkkvVUZDLCBwb2RlLCBzZW0gYWx0ZXJhciBvIGNvbnRlw7pkbywgY29udmVydGVyIG8gYXJxdWl2byBkZXBvc2l0YWRvIGEgcXVhbHF1ZXIgbWVpbyBvdSBmb3JtYXRvIGNvbSBmaW5zIGRlIHByZXNlcnZhw6fDo28uIFZvY8OqKHMpIHRhbWLDqW0gY29uY29yZGEobSkgcXVlIGEgVW5pdmVyc2lkYWRlIEZlZGVyYWwgZG8gQ2VhcsOhLCBnZXN0b3JhIGRvIFJlcG9zaXTDs3JpbyBJbnN0aXR1Y2lvbmFsIGRhIFVGQyAtIFJJL1VGQywgcG9kZSBtYW50ZXIgbWFpcyBkZSB1bWEgY8OzcGlhIGRlc3RlIGRlcMOzc2l0byBwYXJhIGZpbnMgZGUgc2VndXJhbsOnYSwgYmFjay11cCBlL291IHByZXNlcnZhw6fDo28uIFZvY8OqIGRlY2xhcmEgcXVlIGEgYXByZXNlbnRhw6fDo28gZG8gc2V1IHRyYWJhbGhvIMOpIG9yaWdpbmFsIGUgcXVlIHZvY8OqKHMpIHBvZGUobSkgY29uY2VkZXIgb3MgZGlyZWl0b3MgY29udGlkb3MgbmVzdGEgbGljZW7Dp2EuIFZvY8OqIHRhbWLDqW0gZGVjbGFyYShtKSBxdWUgbyBlbnZpbyDDqSBkZSBzZXUgY29uaGVjaW1lbnRvIGUgbsOjbyBpbmZyaW5nZSBvcyBkaXJlaXRvcyBhdXRvcmFpcyBkZSBvdXRyYSBwZXNzb2Egb3UgaW5zdGl0dWnDp8Ojby4gQ2FzbyBvIGRvY3VtZW50byBhIHNlciBkZXBvc2l0YWRvIGNvbnRlbmhhIG1hdGVyaWFsIHBhcmEgbyBxdWFsIHZvY8OqKHMpIG7Do28gZGV0w6ltIGEgdGl0dWxhcmlkYWRlIGRvcyBkaXJlaXRvcyBkZSBhdXRvcmFpcywgdm9jw6oocykgZGVjbGFyYShtKSBxdWUgb2J0ZXZlIGEgcGVybWlzc8OjbyBpcnJlc3RyaXRhIGRvIHRpdHVsYXIgZG9zIGRpcmVpdG9zIGF1dG9yYWlzIGRlIGNvbmNlZGVyIMOgIFVuaXZlcnNpZGFkZSBGZWRlcmFsIGRvIENlYXLDoSwgZ2VzdG9yYSBkbyBSZXBvc2l0w7NyaW8gSW5zdGl0dWNpb25hbCBkYSBVRkMgLSBSSS9VRkMsIG9zIGRpcmVpdG9zIHJlcXVlcmlkb3MgcG9yIGVzdGEgbGljZW7Dp2EgZSBxdWUgb3MgbWF0ZXJpYWlzIGRlIHByb3ByaWVkYWRlIGRlIHRlcmNlaXJvcywgZXN0w6NvIGRldmlkYW1lbnRlIGlkZW50aWZpY2Fkb3MgZSByZWNvbmhlY2lkb3Mgbm8gdGV4dG8gb3UgY29udGXDumRvIGRhIGFwcmVzZW50YcOnw6NvLgogQ0FTTyBPIFRSQUJBTEhPIERFUE9TSVRBRE8gVEVOSEEgU0lETyBGSU5BTkNJQURPIE9VIEFQT0lBRE8gUE9SIFVNIMOTUkfDg08sIFFVRSBOw4NPIEEgSU5TVElUVUnDh8ODTyBERVNURSBSRVBPU0lUw5NSSU86IFZPQ8OKIERFQ0xBUkEgVEVSIENVTVBSSURPIFRPRE9TIE9TIERJUkVJVE9TIERFIFJFVklTw4NPIEUgUVVBSVNRVUVSIE9VVFJBUyBPQlJJR0HDh8OVRVMgUkVRVUVSSURBUyBQRUxPIENPTlRSQVRPIE9VIEFDT1JETy4gCk8gcmVwb3NpdMOzcmlvIGlkZW50aWZpY2Fyw6EgY2xhcmFtZW50ZSBvIHNldShzKSBub21lKHMpIGNvbW8gYXV0b3IoZXMpIG91IHRpdHVsYXIoZXMpIGRvIGRpcmVpdG8gZGUgYXV0b3IoZXMpIGRvIGRvY3VtZW50byBzdWJtZXRpZG8gZSBkZWNsYXJhIHF1ZSBuw6NvIGZhcsOhIHF1YWxxdWVyIGFsdGVyYcOnw6NvIGFsw6ltIGRhcyBwZXJtaXRpZGFzIHBvciBlc3RhIGxpY2Vuw6dhLgpSZXBvc2l0w7NyaW8gSW5zdGl0dWNpb25hbCBkYSBVRkMuCg==Repositório InstitucionalPUBhttp://www.repositorio.ufc.br/ri-oai/requestbu@ufc.br || repositorio@ufc.bropendoar:2022-07-21T12:21:15Repositório Institucional da Universidade Federal do Ceará (UFC) - Universidade Federal do Ceará (UFC)false
dc.title.pt_BR.fl_str_mv A framework for radio resource allocation and SDMA grouping in massive MIMO systems
title A framework for radio resource allocation and SDMA grouping in massive MIMO systems
spellingShingle A framework for radio resource allocation and SDMA grouping in massive MIMO systems
Mauricio, Weskley Vinicius Fernandes
Massive MIMO
Channel hardening
SDMA grouping
Radio resource allocation
Quality of service
title_short A framework for radio resource allocation and SDMA grouping in massive MIMO systems
title_full A framework for radio resource allocation and SDMA grouping in massive MIMO systems
title_fullStr A framework for radio resource allocation and SDMA grouping in massive MIMO systems
title_full_unstemmed A framework for radio resource allocation and SDMA grouping in massive MIMO systems
title_sort A framework for radio resource allocation and SDMA grouping in massive MIMO systems
author Mauricio, Weskley Vinicius Fernandes
author_facet Mauricio, Weskley Vinicius Fernandes
Araújo, Daniel Costa
Maciel, Tarcísio Ferreira
Lima, Francisco Rafael Marques
author_role author
author2 Araújo, Daniel Costa
Maciel, Tarcísio Ferreira
Lima, Francisco Rafael Marques
author2_role author
author
author
dc.contributor.author.fl_str_mv Mauricio, Weskley Vinicius Fernandes
Araújo, Daniel Costa
Maciel, Tarcísio Ferreira
Lima, Francisco Rafael Marques
dc.subject.por.fl_str_mv Massive MIMO
Channel hardening
SDMA grouping
Radio resource allocation
Quality of service
topic Massive MIMO
Channel hardening
SDMA grouping
Radio resource allocation
Quality of service
description This work proposes a framework for multiuser massive Multiple Input Multiple Output (MIMO) systems which is composed of three parts - clustering , grouping , and scheduling - and aims at maximizing the total system data rate considering Quality of Service (QoS) constraints. We firstly use a clustering algorithm to create clusters of spatially correlated Mobile Stations (MSs). Secondly, in the grouping part, we select a set of Space-Division Multiple Access (SDMA) groups from each cluster. These groups are used as candidate groups to receive Scheduling Unit (SU) in the scheduling part. In order to compose a group, we employ a metric that takes into account the trade-off between the spatial channel correlation and channel gain of MSs. In this context, it is proposed a suboptimal solution to avoid the high complexity required by the optimal solution. Thirdly and finally, we use the candidate SDMA groups from the grouping part to solve the data rate maximization problem considering QoS requirements. The scheduling part can be solved by our proposed optimal solution based on Branch and Bound (BB). However, since it has high computational complexity, we propose a suboptimal scheduling algorithm that presents a reduced complexity. In the simulation results, we evaluate the performance of both optimal and suboptimal solutions, as well as an adaptation of the Joint Satisfaction Maximization (JSM) scheduler to a massive MIMO scenario. Although the suboptimal solution presents a performance loss compared to the optimal one, it is more suitable for practical settings as it is able to obtain a good performance-complexity trade-off. Furthermore, we show that the choice of a suitable trade-off between the spatial channel correlation and channel gain improves the system performance. Finally, for a low number of available SDMA groups, the suboptimal solution presents near optimal outage and a throughput loss of only 10% in comparison to the high-complexity optimal solution while it outperforms the JSM solution in terms of outage and system throughput.
publishDate 2021
dc.date.issued.fl_str_mv 2021
dc.date.accessioned.fl_str_mv 2022-07-18T18:54:57Z
dc.date.available.fl_str_mv 2022-07-18T18:54:57Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.citation.fl_str_mv MACIEL, T. F. et al. A framework for radio resource allocation and SDMA grouping in massive MIMO systems. IEEE Acess, vol. 9, p. 61680-61696, 2021
dc.identifier.uri.fl_str_mv http://www.repositorio.ufc.br/handle/riufc/67210
dc.identifier.issn.none.fl_str_mv 2169-3536
identifier_str_mv MACIEL, T. F. et al. A framework for radio resource allocation and SDMA grouping in massive MIMO systems. IEEE Acess, vol. 9, p. 61680-61696, 2021
2169-3536
url http://www.repositorio.ufc.br/handle/riufc/67210
dc.language.iso.fl_str_mv eng
language eng
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.publisher.none.fl_str_mv IEEE Acess
publisher.none.fl_str_mv IEEE Acess
dc.source.none.fl_str_mv reponame:Repositório Institucional da Universidade Federal do Ceará (UFC)
instname:Universidade Federal do Ceará (UFC)
instacron:UFC
instname_str Universidade Federal do Ceará (UFC)
instacron_str UFC
institution UFC
reponame_str Repositório Institucional da Universidade Federal do Ceará (UFC)
collection Repositório Institucional da Universidade Federal do Ceará (UFC)
bitstream.url.fl_str_mv http://repositorio.ufc.br/bitstream/riufc/67210/1/2021_art_tfmaciel.pdf
http://repositorio.ufc.br/bitstream/riufc/67210/2/license.txt
bitstream.checksum.fl_str_mv 432827e3cfa20b871b7878533ecdfaec
fb3ad2d23d9790966439580114baefaf
bitstream.checksumAlgorithm.fl_str_mv MD5
MD5
repository.name.fl_str_mv Repositório Institucional da Universidade Federal do Ceará (UFC) - Universidade Federal do Ceará (UFC)
repository.mail.fl_str_mv bu@ufc.br || repositorio@ufc.br
_version_ 1847792529303404544