Research Article
A Self-Optimization Method for Coverage-Capacity Optimization in OFDMA networks with MIMO
@INPROCEEDINGS{10.4108/icst.valuetools.2011.245615, author={Richard Combes and Zwi Altman and Eitan Altman}, title={A Self-Optimization Method for Coverage-Capacity Optimization in OFDMA networks with MIMO}, proceedings={5th International ICST Conference on Performance Evaluation Methodologies and Tools}, publisher={ICST}, proceedings_a={VALUETOOLS}, year={2012}, month={6}, keywords={self-optimizing networks ; ofdma ; mimo ; alpha-fairness ; scheduling gain ;}, doi={10.4108/icst.valuetools.2011.245615} }- Richard Combes
Zwi Altman
Eitan Altman
Year: 2012
A Self-Optimization Method for Coverage-Capacity Optimization in OFDMA networks with MIMO
VALUETOOLS
ICST
DOI: 10.4108/icst.valuetools.2011.245615
Abstract
This paper considers alpha-fair schedulers in an OFDMA network. The convergence of the alpha-fair scheduler is analyzed. Closed-form formulas are given for certain cases to calculate the scheduling gain, as well as a Monte-Carlo method, for a MIMO channel. A capacity-coverage algorithm based on the alpha-fair schedulers using observable KPIs is proposed. The algorithm is implemented in a large scale network simulator. It is shown that notable coverage gains are achieved at the expense of very small capacity losses.
Copyright © 2011–2024 ICST
