Back to Search
Start Over
Reduced-Complexity User Scheduling Algorithms for Coordinated Heterogeneous MIMO Networks.
- Source :
- IEEE Transactions on Vehicular Technology; Aug2016, Vol. 65 Issue 8, p6184-6203, 20p
- Publication Year :
- 2016
-
Abstract
- In this paper, the downlink of a clustered coordinated multicell multiuser multiple-input multiple-output (MIMO) system is considered, and various low-complexity user scheduling algorithms to maximize the sum rate are proposed. The users' data signals are transmitted cooperatively via the base stations (BSs) of a cluster within the sectorized multicell heterogeneous cellular network. Exhaustive search as the optimal scheduling method is extremely complex, particularly for large numbers of users requesting service. We therefore propose suboptimal scheduling algorithms based on the lower complexity metaheuristic stochastic optimization techniques of simulated annealing (SA) and particle swarm (PS). Moreover, a hybrid algorithm combining the traits of PS and a greedy scheduler is also proposed. The performance and complexity of these algorithms are evaluated for a heterogeneous system model employing different precoding methods. Assessing the algorithms' performance via computer simulations, the effectiveness of the proposed schemes in terms of sum rate is demonstrated, yielding performance very close to that of the exhaustive search at much lower complexity. For each precoding method used in the employed system model, the best corresponding approach to scheduling from our proposed algorithms is determined. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00189545
- Volume :
- 65
- Issue :
- 8
- Database :
- Complementary Index
- Journal :
- IEEE Transactions on Vehicular Technology
- Publication Type :
- Academic Journal
- Accession number :
- 117445584
- Full Text :
- https://doi.org/10.1109/TVT.2015.2477309