City Research Online

Complexity of coordinated beamforming and scheduling for OFDMA based heterogeneous networks

Belschner, J., Rakocevic, V. ORCID: 0000-0002-3081-0448 and Habermann, J. (2018). Complexity of coordinated beamforming and scheduling for OFDMA based heterogeneous networks. Wireless Networks, doi: 10.1007/s11276-017-1645-4

Abstract

Coordination is foreseen to be an important component of future mobile radio networks. It is especially relevant in heterogeneous networks, where high power base stations produce strong interference to an underlying layer of low power base stations. This work investigates in detail the achievable performance gains for one coordination technique—coordinated beamforming. It reveals the main factors that influence the throughput of the mobile stations. These findings are combined with an analysis of the computational complexity. As a result, a heuristic algorithm is presented that achieves results close to an exhaustive search with significantly less calculations. Detailed simulation analysis is presented on a realistic network layout.

Publication Type: Article
Publisher Keywords: Coordinated multipoint transmission and reception (CoMP), Heterogeneous networks, Pico cells
Departments: School of Mathematics, Computer Science & Engineering > Engineering
School of Mathematics, Computer Science & Engineering > Engineering > Electrical & Electronic Engineering
URI: http://openaccess.city.ac.uk/id/eprint/19592
[img]
Preview
Text - Published Version
Available under License Creative Commons Attribution.

Download (2MB) | Preview

Export

Downloads

Downloads per month over past year

View more statistics

Actions (login required)

Admin Login Admin Login