User Scheduling at Base Station Cluster Boundary for Massive MIMO Downlink Transmission

Masahito YATA; Yukitoshi SANADA

doi:10.1587/transcom.2022EBP3157

IEICE TRANSACTIONS on Communications

User Scheduling at Base Station Cluster Boundary for Massive MIMO Downlink Transmission

Masahito YATA, Yukitoshi SANADA

Full Text Views

0

Cite this

Summary :

One of the key technologies for the fifth-generation (5G) mobile communication system is massive multiple-input multiple-output (MIMO) that applies beamforming in order to effectively compensate for large propagation losses in high frequency bands and enable the spatial multiplexing of a large number of signal streams over multiple users. To further improve a system throughput, a coordinated cluster system in which a large number of massive MIMO base stations are deployed in high density has been investigated. The dense deployment greatly improves the system capacity by controlling base stations from a centralized base band unit. However, when clusters are closely located in order to serve densely populated areas, inter-beam interference between adjacent clusters becomes more severe. To suppress the interference to adjacent clusters, only a simple beam switch control scheme at a cluster boundary has been investigated as a conventional scheme. In this paper, the scheduling algorithm for massive MIMO downlink transmission near cluster boundaries, which combines two scheduling algorithms, has been proposed. In the proposed scheme, each base station divides its own cell to multiple areas, switches supporting areas sequentially, and serves users in those areas. The numerical results show that the throughputs improve with a little reduction in a fairness index (FI) when the number of users per resource block is one. The FI reaches the highest when the number of users per cell is equal to the number of divided areas. The proposed scheme reduces computational complexity as compared with those of conventional two schemes.

Publication: IEICE TRANSACTIONS on Communications Vol.E106-B No.9 pp.837-843

Publication Date: 2023/09/01

Publicized: 2023/03/08

Online ISSN: 1745-1345

DOI: 10.1587/transcom.2022EBP3157

Type of Manuscript: PAPER

Category: Wireless Communication Technologies

Authors

Masahito YATA
Keio University
Yukitoshi SANADA
Keio University

Keyword

5G, round-robin scheduling

Cite this

Copy

Masahito YATA, Yukitoshi SANADA, "User Scheduling at Base Station Cluster Boundary for Massive MIMO Downlink Transmission" in IEICE TRANSACTIONS on Communications, vol. E106-B, no. 9, pp. 837-843, September 2023, doi: 10.1587/transcom.2022EBP3157.
Abstract: One of the key technologies for the fifth-generation (5G) mobile communication system is massive multiple-input multiple-output (MIMO) that applies beamforming in order to effectively compensate for large propagation losses in high frequency bands and enable the spatial multiplexing of a large number of signal streams over multiple users. To further improve a system throughput, a coordinated cluster system in which a large number of massive MIMO base stations are deployed in high density has been investigated. The dense deployment greatly improves the system capacity by controlling base stations from a centralized base band unit. However, when clusters are closely located in order to serve densely populated areas, inter-beam interference between adjacent clusters becomes more severe. To suppress the interference to adjacent clusters, only a simple beam switch control scheme at a cluster boundary has been investigated as a conventional scheme. In this paper, the scheduling algorithm for massive MIMO downlink transmission near cluster boundaries, which combines two scheduling algorithms, has been proposed. In the proposed scheme, each base station divides its own cell to multiple areas, switches supporting areas sequentially, and serves users in those areas. The numerical results show that the throughputs improve with a little reduction in a fairness index (FI) when the number of users per resource block is one. The FI reaches the highest when the number of users per cell is equal to the number of divided areas. The proposed scheme reduces computational complexity as compared with those of conventional two schemes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2022EBP3157/_p

Copy

@ARTICLE{e106-b_9_837,
author={Masahito YATA, Yukitoshi SANADA, },
journal={IEICE TRANSACTIONS on Communications},
title={User Scheduling at Base Station Cluster Boundary for Massive MIMO Downlink Transmission},
year={2023},
volume={E106-B},
number={9},
pages={837-843},
abstract={One of the key technologies for the fifth-generation (5G) mobile communication system is massive multiple-input multiple-output (MIMO) that applies beamforming in order to effectively compensate for large propagation losses in high frequency bands and enable the spatial multiplexing of a large number of signal streams over multiple users. To further improve a system throughput, a coordinated cluster system in which a large number of massive MIMO base stations are deployed in high density has been investigated. The dense deployment greatly improves the system capacity by controlling base stations from a centralized base band unit. However, when clusters are closely located in order to serve densely populated areas, inter-beam interference between adjacent clusters becomes more severe. To suppress the interference to adjacent clusters, only a simple beam switch control scheme at a cluster boundary has been investigated as a conventional scheme. In this paper, the scheduling algorithm for massive MIMO downlink transmission near cluster boundaries, which combines two scheduling algorithms, has been proposed. In the proposed scheme, each base station divides its own cell to multiple areas, switches supporting areas sequentially, and serves users in those areas. The numerical results show that the throughputs improve with a little reduction in a fairness index (FI) when the number of users per resource block is one. The FI reaches the highest when the number of users per cell is equal to the number of divided areas. The proposed scheme reduces computational complexity as compared with those of conventional two schemes.},
keywords={},
doi={10.1587/transcom.2022EBP3157},
ISSN={1745-1345},
month={September},}

Copy

TY - JOUR
TI - User Scheduling at Base Station Cluster Boundary for Massive MIMO Downlink Transmission
T2 - IEICE TRANSACTIONS on Communications
SP - 837
EP - 843
AU - Masahito YATA
AU - Yukitoshi SANADA
PY - 2023
DO - 10.1587/transcom.2022EBP3157
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E106-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2023
AB - One of the key technologies for the fifth-generation (5G) mobile communication system is massive multiple-input multiple-output (MIMO) that applies beamforming in order to effectively compensate for large propagation losses in high frequency bands and enable the spatial multiplexing of a large number of signal streams over multiple users. To further improve a system throughput, a coordinated cluster system in which a large number of massive MIMO base stations are deployed in high density has been investigated. The dense deployment greatly improves the system capacity by controlling base stations from a centralized base band unit. However, when clusters are closely located in order to serve densely populated areas, inter-beam interference between adjacent clusters becomes more severe. To suppress the interference to adjacent clusters, only a simple beam switch control scheme at a cluster boundary has been investigated as a conventional scheme. In this paper, the scheduling algorithm for massive MIMO downlink transmission near cluster boundaries, which combines two scheduling algorithms, has been proposed. In the proposed scheme, each base station divides its own cell to multiple areas, switches supporting areas sequentially, and serves users in those areas. The numerical results show that the throughputs improve with a little reduction in a fairness index (FI) when the number of users per resource block is one. The FI reaches the highest when the number of users per cell is equal to the number of divided areas. The proposed scheme reduces computational complexity as compared with those of conventional two schemes.
ER -

IEICE TRANSACTIONS on Communications