2011 International Conference on Wireless Communications and Signal Processing (WCSP) 2011
DOI: 10.1109/wcsp.2011.6096852
|View full text |Cite
|
Sign up to set email alerts
|

Energy-efficient resource allocation in multi-user OFDMA systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
15
0

Year Published

2012
2012
2017
2017

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 10 publications
(15 citation statements)
references
References 16 publications
0
15
0
Order By: Relevance
“…where the function   BS P max, 0  confines the range of pk as per (14). Using (3), the SINR of ZF can be written as follows …”
Section: A Energy Efficiency Water Filling Power Allocation Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…where the function   BS P max, 0  confines the range of pk as per (14). Using (3), the SINR of ZF can be written as follows …”
Section: A Energy Efficiency Water Filling Power Allocation Algorithmmentioning
confidence: 99%
“…The work presented in [14] developed a resource allocation of EE to maximize the EE for a multi-user OFDMA. However, an energy consumption is increasing, even though the authors in [15] showed that MIMO techniques are effective in improving capacity and SE of wireless systems.…”
mentioning
confidence: 99%
“…Because of this, we first present a low-complexity channel assignment protocol. Then, we analyze the power allocation problem in (15) and propose a power allocation procedure that has constant complexity. We finish this section by comparing the complexity of our resource allocation protocol with a particular one in the literature that maximizes the EE of OFDMA transmissions from a base station.…”
Section: Analysis and Solutionmentioning
confidence: 99%
“…It should be noted that, of the work that consider both subchannel and power allocation, Xiong et al [14] had the solution with the lowest computational complexity. Reference [15] uses the same algorithm as in [12] for power allocation, but their subchannel assignment algorithm has a complexity that is at least a few orders of magnitude greater than the algorithm of Xiong et al [14].…”
mentioning
confidence: 99%
“…The algorithm stops when it reaches a local optimum, at which none of the neighbouring solutions leads to any improvement. Many other two-stage algorithms have been proposed recently, including sorting-and-assignment algorithms [11,12], subcarrier-and-power allocation algorithms [13] and userand-rate allocation algorithms [14]. The aforementioned heuristic algorithms, however, achieve loose gaps from the optimum, or their complexities are hard to predict as the number of iterations needed is a tuning parameter.…”
Section: Introductionmentioning
confidence: 99%