The large number of antennas in massive MIMO systems allows the base station to communicate with multiple users at the same time and frequency resource with multi-user beamforming. However, highly correlated user channels could drastically impede the spectral efficiency that multi-user beamforming can achieve. As such, it is critical for the base station to schedule a suitable group of users in each time and frequency resource block to achieve maximum spectral efficiency while adhering to fairness constraints among the users. In this paper, we consider the resource scheduling problem for massive MIMO systems with its optimal solution known to be NP-hard. Inspired by recent achievements in deep reinforcement learning (DRL) to solve problems with large action sets, we propose SMART, a dynamic scheduler for massive MIMO based on the state-of-the-art Soft Actor-Critic (SAC) DRL model and the K-Nearest Neighbors (KNN) algorithm. Through comprehensive simulations using realistic massive MIMO channel models as well as real-world datasets from channel measurement experiments, we demonstrate the effectiveness of our proposed model in various channel conditions. Our results show that our proposed model performs very close to the optimal proportionally fair (Opt-PF) scheduler in terms of spectral efficiency and fairness with more than one order of magnitude lower computational complexity in medium network sizes where Opt-PF is computationally feasible. Our results also show the feasibility and high performance of our proposed scheduler in networks with a large number of users and resource blocks.
more »
« less
Spectral Clustering Aided User Grouping and Scheduling in Wideband MU-MIMO Systems
Multiuser MIMO (MU-MIMO) technologies can help provide rapidly growing needs for high data rates in modern wireless networks. Co-channel interference (CCI) among users in the same resource-sharing group (RSG) presents a serious user scheduling challenge to achieve high overall MU-MIMO capacity. Since CCI is closely related to correlation among spatial user channels, it would be natural to schedule co-channel user groups with low inter-user channel correlation. Yet, establishing RSGs with low co-channel correlations for large user populations is an NP-hard problem. More practically, user scheduling for wideband channels exhibiting distinct channel characteristics in each frequency band remains an open question. In this work, we proposed a novel wideband user grouping and scheduling algorithm named SC-MS. The proposed SC-MS algorithm first leverages spectral clustering to obtain a preliminary set of user groups. Next, we apply a post-processing step to identify user cliques from the preliminary groups to further mitigate CCI.
Our last step groups users into RSGs for scheduling such that the sum of user clique sizes across the multiple frequency bands is maximized. Simulation results demonstrate network performance
gain over benchmark methods in terms of sum rate and fairness.
more »
« less
- PAR ID:
- 10442929
- Date Published:
- Journal Name:
- IEEE International Conference on Communications
- ISSN:
- 1938-1883
- Page Range / eLocation ID:
- Published
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The large number of antennas in massive MIMO systems allows the base station to communicate with multiple users at the same time and frequency resource with multi-user beamforming. However, highly correlated user channels could drastically impede the spectral efficiency that multi-user beamforming can achieve. As such, it is critical for the base station to schedule a suitable group of users in each time and frequency resource block to achieve maximum spectral efficiency while adhering to fairness constraints among the users. In this paper, we consider the resource scheduling problem for massive MIMO systems with its optimal solution known to be NP-hard. Inspired by recent achievements in deep reinforcement learning (DRL) to solve problems with large action sets, we propose \name{}, a dynamic scheduler for massive MIMO based on the state-of-the-art Soft Actor-Critic (SAC) DRL model and the K-Nearest Neighbors (KNN) algorithm. Through comprehensive simulations using realistic massive MIMO channel models as well as real-world datasets from channel measurement experiments, we demonstrate the effectiveness of our proposed model in various channel conditions. Our results show that our proposed model performs very close to the optimal proportionally fair (Opt-PF) scheduler in terms of spectral efficiency and fairness with more than one order of magnitude lower computational complexity in medium network sizes where Opt-PF is computationally feasible. Our results also show the feasibility and high performance of our proposed scheduler in networks with a large number of users and resource blocks.more » « less
-
When the users in a MIMO broadcast channel experience different spatial transmit correlation matrices, a class of gains is produced that is denoted transmit correlation diversity. This idea was conceived for channels in which transmit correlation matrices have mutually exclusive eigenspaces, allowing non-interfering training and transmission. This paper broadens the scope of transmit correlation diversity to the case of partially and fully overlapping eigenspaces and introduces techniques to harvest these generalized gains. For the two-user MIMO broadcast channel, we derive achievable degrees of freedom (DoF) and achievable rate regions with/without channel state information at the receiver (CSIR). When CSIR is available, the proposed achievable DoF region is tight in some configurations of the number of receive antennas and the channel correlation ranks. We then extend the DoF results to the K-user case by analyzing the interference graph that characterizes the overlapping structure of the eigenspaces. Our achievability results employ a combination of product superposition in the common part of the eigenspaces, and pre-beamforming (rate splitting) to create multiple data streams in non-overlapping parts of the eigenspaces. Massive MIMO is a natural example in which spatially correlated link gains are likely to occur. We study the achievable downlink sum rate for a frequency-division duplex massive MIMO system under transmit correlation diversity.more » « less
-
more » « less
Abstract User subset selection requires full downlink channel state information to realize effective multi-user beamforming in frequency-division duplexing (FDD) massive multi-input multi-output (MIMO) systems. However, the channel estimation overhead scales with the number of users in FDD systems. In this paper, we propose a novel propagation domain-based user selection scheme, labeled as
zero-measurement selection , for FDD massive MIMO systems with the aim of reducing the channel estimation overhead that scales with the number of users. The key idea is to infer downlink user channel norm and inter-user channel correlation from uplink channel in the propagation domain. In zero-measurement selection, the base-station performs downlink user selection before any downlink channel estimation. As a result, the downlink channel estimation overhead for both user selection and beamforming is independent of the total number of users. Then, we evaluate zero-measurement selection with both measured and simulated channels. The results show that zero-measurement selection achieves up to 92.5% weighted sum rate of genie-aided user selection on the average and scales well with both the number of base-station antennas and the number of users. We also employ simulated channels for further performance validation, and the numerical results yield similar observations as the experimental findings. -
null (Ed.)We propose a joint channel estimation and data detection (JED) algorithm for cell-free massive multi-user (MU) multiple-input multiple-output (MIMO) systems. Our algorithm yields improved reliability and reduced latency while minimizing the pilot overhead of coherent uplink transmission. The proposed JED method builds upon a novel non-convex optimization problem that we solve approximately and efficiently using forward- backward splitting. We use simulation results to demonstrate that our algorithm achieves robust data transmission with more than 3x reduced pilot overhead compared to orthogonal training in a 128 antenna cell-free massive MU-MIMO system in which 128 users transmit data over 128 time slots.more » « less
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- The DOI is not currently available.
