Abstract

This paper considers multi-cell decode-and-forward (DF) relay-aided orthogonal frequency division multi-access (OFDMA) downlink systems, in which all sources and relays are coordinated by a central controller for resource allocation (RA). The improved subcarrier pair-based opportunistic DF relaying protocol proposed and studied in the IEEE International Conference on Communications, Beijing, 3795–3800, 2008 and IEEE Trans. Signal Process. 61:2512–2524, 2013 is applied. This protocol has a high spectrum efficiency (HSE) in the sense that all unpaired subcarriers are utilized for data transmission during the second time slot (TS). In particular, the sum (over all cells and all destinations) rate maximized problem with a total power constraint in each cell+ is formulated. To solve this problem, an iterative RA algorithm is proposed to optimize mode selection (decision whether the relay should help or not), subcarrier assignment and pairing (MSSAP) and power allocation (PA) in an alternate way. As for the MSSAP stage of each iteration, the formulated problem is decoupled into subproblems with the tentative PA results. Each subproblem can be easily solved by using the optimal results of a linear assignment problem (LAP), which is then solved by the Hungarian Algorithm in polynomial time. As for the PA stage of each iteration, an algorithm based on single-condensation and geometric programming (SCGP) is proposed to optimize PA in polynomial time with the tentative MSSAP results. The proposed algorithm is coordinate ascent (CA)-based and therefore can reach a local optimum in polynomial time. Finally, the convergence and effectiveness of the proposed algorithm, the impact of relay position and total power on the system performance, and the benefits of using subcarrier pairing (SP) and the HSE protocol are illustrated through numerical experiments.

Highlights

  • High data rate and ubiquitous coverage are strongly required in the next-generation wireless communication networks

  • Thanks to the three conditions fulfilled during the SC stage, our proposed single-condensation and geometric programming (SCGP) algorithm is a general inner approximation algorithm [39], which will converge to a local optimum satisfying the KKT conditions of problem (21) according to the corollary 1 of [39]

  • 4.4 Results averaged over channel distribution In order to illustrate the average performance of our proposed resource allocation (RA) algorithm, 100 random realizations of channels are generated

Read more

Summary

Introduction

High data rate and ubiquitous coverage are strongly required in the next-generation wireless communication networks. This novel protocol is the same as the HSE protocol, except that the source and relay implement transmit beamforming to transmit the symbol at a paired subcarrier during the second TS Note that all these papers consider RA in singlecell situations with the cochannel interference (CCI). Several RA algorithms have been proposed in [31,32,33,34] for multi-cell OFDMA systems without DF relaying These methods cannot be extended directly to solve RA problems jointly optimizing transmission mode selection, subcarrier assignment and pairing (MSSAP) as well as power allocation (PA) in multi-cell OFDMA systems with subcarrier pair-based opportunistic DF relaying. Paper [35] has recently considered and formulated the joint RA and scheduling problem in multicell DF relayed OFDMA systems, taking CCI as well as user data rate requirements into account Both opportunistic relaying and subcarrier pairing (SP) were not considered there.

System model and problem formulation
Algorithm development
PA optimization
Differential condition
System setup
Results for a random realization of channels
Conclusion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.