Abstract

In this paper, we consider cross-layer scheduling for the downlink of amplify-and-forward (AF) relay-assisted orthogonal frequency-division multiple-access (OFDMA) networks. The proposed cross-layer design takes into account the effects of imperfect channel-state information (CSI) at the transmitter (CSIT) in slow fading. The rate, power, and subcarrier allocation policies are optimized to maximize the system goodput (in bits per second per hertz successfully received by the users). The optimization problem is solved by using dual decomposition, resulting in a highly scalable distributed iterative resource-allocation algorithm. We also investigate the asymptotic performance of the proposed scheduler with respect to (w.r.t.) the numbers of users and relays. We find that the number of relays should grow faster than the number of users to fully exploit the multiuser diversity (MUD) gain. On the other hand, diversity from multiple relays can be exploited to enhance system performance when the MUD gain is saturated due to noise amplification at the AF relays. Furthermore, we introduce a feedback-reduction scheme to reduce the computational burden and the required amount of CSI feedback from the users to the relays. Simulation results confirm the derived analytical results for the growth of the system goodput and illustrate that the proposed distributed cross-layer scheduler only requires a small number of iterations to achieve practically the same performance as the optimal centralized scheduler, even if the information exchanged between the base station (BS) and the relays in each iteration is quantized, and the proposed CSI feedback reduction scheme is employed.

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.