2014 IEEE Wireless Communications and Networking Conference (WCNC) 2014
DOI: 10.1109/wcnc.2014.6952331
|View full text |Cite
|
Sign up to set email alerts
|

Joint resource optimization for OFDMA cellular networks with user cooperation and QoS provisioning

Abstract: In this paper, a joint resource optimization scheme is designed for orthogonal frequency division multiple access (OFDMA) cellular wireless networks with multi-user cooperation. Joint relay selection, subcarrier allocation and pairing and power allocation algorithms are developed with the objective of maximizing the total capacity of the system considering the quality of service (QoS) requirements of the users. The optimization problem is a mixed integer nonlinear program (MINLP), which is often very difficult… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
15
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 12 publications
(15 citation statements)
references
References 11 publications
0
15
0
Order By: Relevance
“…From (39), (40), and (41), we note that the feasible transmit power region composed of S * and S is larger than the feasible region of S, which leads that the inequality (a) may not hold in (35). However, based on this, it is straightforward to show that inequality (d) still holds in (36).…”
Section: Lemmamentioning
confidence: 98%
See 1 more Smart Citation
“…From (39), (40), and (41), we note that the feasible transmit power region composed of S * and S is larger than the feasible region of S, which leads that the inequality (a) may not hold in (35). However, based on this, it is straightforward to show that inequality (d) still holds in (36).…”
Section: Lemmamentioning
confidence: 98%
“…First, the complexity for obtaining bandwidth and power allocation variables in Algorithm 1 linearly increases with the number of MUs and the number of SUs, i.e., O(K + N). Second, the complexities of the ellipsoid method for updating dual variables [37] and the Dinkelbach method for updating q [13], [35], [40], [41] are both independent of K and N. Finally, the complexity of performing the MU selection linearly increases with K. Therefore, the total complexity of Algorithm 2 is…”
Section: Computational Complexity Analysismentioning
confidence: 99%
“…For a given multiuser OFDMA network, resource and power allocation problem is formulated as a centralized optimization problem [10,11,12]. Centralized 70 inter-cell coordination is therefore required to find the optimal solution, where the necessary information about SINR, power allocation, and resource usage are sent to a centralized coordination entity.…”
Section: State-of-the-art Contributionsmentioning
confidence: 99%
“…The majority of state-of-the-art contributions formulate the resource and 35 power allocation problem for a single cell network [10,11,12], or do not consider the impact of ICI on system performance. For instance, the tradeoff between spectral efficiency and energy efficiency is addressed in [12], and a low-complexity suboptimal algorithm is proposed to allocate RBs for practical applications of the tradeoff.…”
mentioning
confidence: 99%
See 1 more Smart Citation