OFDMA Based Two-Hop Cooperative Relay Network Resources Allocation

In this paper, we focus on the resources allocation for the OFDMA based two-hop relay network which consists of a single base station, dedicated fixed relay stations and subscriber stations. Subscriber stations are allocated the subcarriers and relay stations that are required to satisfy their minimum rate requirements in either non-cooperative mode (i.e., direct communication with the base station) or in cooperative mode with one of the available relay stations. The cooperation is limited to one relay station to reduce the complexity incurred by the need for synchronization with multiple relays and with the base station at the PHY layer. The subcarriers and relay stations allocation problem is formulated as a Binary Integer Programming (BIP) problem with QoS constraints (minimum rate) and a practical synchronization constraint (cooperation with a single relay). Since the formulated problem is NP-complete, a simple sub-optimal algorithm is proposed to manage the multi-service network resources. Simulations and complexity analysis show that the presented algorithm achieves a network near optimal resources allocation with low computational complexity.