Nash bargaining solution based joint time-frequency-code-power resource management algorithm for TD-LTE systems

SUMMARYThis paper presents a joint time‐frequency‐code‐power resource management algorithm based on the Nash bargaining solution in time‐division long term evolution systems. First, a joint radio resource allocation scheme at the time, frequency, code and power domain simultaneously is provided for...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International journal of communication systems 2014-10, Vol.27 (10), p.1752-1765
Hauptverfasser: Zhao, Liqiang, Wang, Yuanyuan, Yang, Kun, Yi, Jiangtao, Zhang, Hailin
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:SUMMARYThis paper presents a joint time‐frequency‐code‐power resource management algorithm based on the Nash bargaining solution in time‐division long term evolution systems. First, a joint radio resource allocation scheme at the time, frequency, code and power domain simultaneously is provided for the time‐division long term evolution system. Second, the proposed algorithm is modeled as a cooperative game under the constraints of each user's minimal rate requirement and available resources, for example, the maximal transmitting power. To reduce the computational complexity, the joint resource allocation algorithm is divided into time‐frequency‐code and power domain resource allocation. Also, we could approach the Pareto optimal rate as closely as possible by iterations. Simulation results show that compared with the other resource allocation algorithms, the proposed algorithm has achieved a good tradeoff between the overall system throughput and fairness among different users. Copyright © 2012 John Wiley & Sons, Ltd. This paper presents a joint time‐frequency‐code‐power resource management algorithm based on the Nash bargaining solution in time‐division long term evolution systems. To reduce the computational complexity, the joint resource allocation algorithm is divided into time‐frequency‐code and power domain resource allocation and we can approach the Pareto optimal rate as closely as possible by iterations. Simulation results show that the proposed algorithm has achieved a good tradeoff between the overall system throughput and fairness among different users.
ISSN:1074-5351
1099-1131
DOI:10.1002/dac.2433