Complexity of coordinated beamforming and scheduling for OFDMA based heterogeneous networks

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

[img]
Preview
Text - Published Version
Available under License Creative Commons Attribution.

Download (2MB) | Preview

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.

Item Type: Article
Uncontrolled Keywords: Coordinated multipoint transmission and reception (CoMP), Heterogeneous networks, Pico cells
Divisions: School of Engineering & Mathematical Sciences > Engineering
URI: http://openaccess.city.ac.uk/id/eprint/19592

Actions (login required)

View Item View Item

Downloads

Downloads per month over past year

View more statistics