Resource Allocation for OFDMA System with Orthogonal Relay using Rateless Code

Abstract

This paper considers the resource allocation problem in the wireless OFDMA system with a relay node. We consider orthogonal relay in which the relay node cannot transmit and receive simultaneously on the same frequency. As a result, the use of relay node may enhance or degrade the achievable transmission rate depending on the instantaneous channel states between the source and the relay, the relay and the destination as well as the source and the destination. Hence, it is very important to dynamically adjust the resources (subbands) allocated to the relay node so that the relay is used only at the right time according to the instantaneous channel states. Conventional approaches dynamically schedule the usage of the relay node in a centralized manner in which full knowledge of the channel states between any two nodes in the network is required. However, perfect knowledge of the channel states at various nodes is very difficult to obtain. In this paper, we shall propose a resource allocation algorithm, which iteratively allocates resource to the source and relay, and converge to the close-to-optimal allocation. Asymptotic achievable rate of the proposed algorithm is derived. We show that the system achieves significant improvement of the achievable rate compared to the point-to-point baseline system without relay as well as the baseline system with random subband allocation.