Reduced-Complexity User Scheduling Algorithms for Coordinated Heterogeneous MIMO Networks

Purmehdi, Hakimeh; Elliott, Robert C.; Krzymien, W.A.

doi:10.1109/tvt.2015.2477309

Cited by 10 publications

(10 citation statements)

References 41 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The user selection within a cluster is performed by using a SAS algorithm similar to what we proposed in [35] and described in Algorithm 3 therein. For ease of reference, the pseudocode of the SAS algorithm is described in Algorithm 1 here.…”

Section: Wsr C(mentioning

confidence: 99%

“…For ease of reference, the pseudocode of the SAS algorithm is described in Algorithm 1 here. The main difference between [35] and here is that the solution values s x and sx are now achievable weighted sum rates as per (6). The ordered user vectors x andx are used for π j c(i) in (6).…”

Section: Wsr C(mentioning

confidence: 99%

“…Since reduced-complexity user scheduling is necessary in practical systems with a large number of users, we use our previously proposed simulated annealing user scheduling (SAS) method [35]. It was shown in [35] that this method achieves performance close to that of an exhaustive search with much lower complexity, making its continued use in this context reasonable. The SAS algorithm in [19] was memoryless, while in [20], we added memory to the algorithm to further improve its performance.…”

Section: Introductionmentioning

confidence: 99%

“…The SAS algorithm in [19] was memoryless, while in [20], we added memory to the algorithm to further improve its performance. We have made additional refinements to the SAS algorithm in [35]; it is that version (adapted for weighted sum rates) that we use in this work. We wish to emphasize, though, that the focus of this work is on the cluster rotation and its performance, not on the scheduling algorithm, nor on the precoding method.…”

Section: Introductionmentioning

confidence: 99%

“…We wish to emphasize, though, that the focus of this work is on the cluster rotation and its performance, not on the scheduling algorithm, nor on the precoding method. The cluster rotation methods employed in this work can be generalized and applied both to different user scheduling algorithms and different precoding methods, including (but not limited to) those discussed in [35]. The outcomes of this work are expected to be independent of the user scheduling and/or precoding approaches.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Rotating cluster mechanism for coordinated heterogeneous MIMO cellular networks

Purmehdi

Elliott

Krzymien

et al. 2018

J Wireless Com Network

Self Cite

View full text Add to dashboard Cite

To increase the average achievable rates per user for cluster-edge users, a rotating clustering scheme for the downlink of a coordinated multicell multiuser multiple-input multiple-output system is proposed in this paper and analyzed in two network layouts. In the multicell heterogeneous cellular network, base stations of a cluster cooperate to transmit data signals to the users within the cluster; rotating cluster patterns enable all users to be nearer the cluster center in at least one of the patterns. Considering cellular layouts with three or six macrocells per site, different rotating patterns of clusters are proposed and the system performance with the proposed sets of clustering patterns is investigated using a simulated annealing algorithm for user scheduling and successive zero-forcing dirty paper coding as the precoding method. The rotating clustering scheme is less complex than fully dynamic clustering, and it is primarily designed to improve the throughput of cluster-edge users. As an extra secondary benefit, it is also capable of slightly improving the average achievable sum rate of the network overall. The effectiveness of the proposed methods with two different scheduling metrics, namely throughput maximization and proportionally fair scheduling, is of interest in this work. Moreover, the speed of rotation affects the performance of the system; the higher the speed of rotation, the more frequently any specific users will be nearer the cluster center. Our simulations demonstrate the effectiveness of the proposed rotational approach and determine the speed of rotation beyond which any additional performance gains become negligible.

show abstract

Section: Wsr C(mentioning

confidence: 99%