Fairness-Driven Fast Resource Allocation for Interference-Free Heterogeneous Networks

Resource allocation in heterogeneous wireless networks is a complex problem. This letter addresses this problem maximizing the sum of logarithms of received rates. From this function, and using the Karush-Kuhn-Tucker (KKT) conditions, this paper proposes an iterative algorithm for allocating resourc...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE communications letters 2012-07, Vol.16 (7), p.1092-1095
Hauptverfasser:	Calabuig, D., Monserrat, J. F., Cardona, N.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Clustering algorithms Detection, estimation, filtering, equalization, prediction Exact sciences and technology fairness Femtocell networks Heterogeneous networks Information, signal and communications theory Interference Iterative algorithms Logarithms Networks Optimization Resource allocation Resource management scheduling Signal and communications theory Signal, noise Telecommunications and information theory Throughput Vectors
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	Resource allocation in heterogeneous wireless networks is a complex problem. This letter addresses this problem maximizing the sum of logarithms of received rates. From this function, and using the Karush-Kuhn-Tucker (KKT) conditions, this paper proposes an iterative algorithm for allocating resources, which is much faster than conventional techniques. This fast response can be used to optimize larger regions, getting closer to the performance of global and centralized algorithms.
ISSN:	1089-7798 1558-2558
DOI:	10.1109/LCOMM.2012.051512.120720