Premium
Nash bargaining solution based joint time‐frequency‐code‐power resource management algorithm for TD‐LTE systems
Author(s) -
Zhao Liqiang,
Wang Yuanyuan,
Yang Kun,
Yi Jiangtao,
Zhang Hailin
Publication year - 2014
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.2433
Subject(s) - computer science , bargaining problem , resource allocation , throughput , code (set theory) , resource management (computing) , joint (building) , algorithm , mathematical optimization , code rate , power (physics) , real time computing , distributed computing , telecommunications , computer network , decoding methods , wireless , set (abstract data type) , architectural engineering , mathematics , mathematical economics , engineering , programming language , physics , quantum mechanics
SUMMARY 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. 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.