Resource allocation for OFDMA relay networks

The paper studies the resource allocation for the OFDMA relay network with multiple source nodes, multiple relay nodes and a single designation node. The optimal source/relay/subcarrier allocation with QoS constraint is formulated as a binary integer programming problem. The problem is then tackled using a graph theoretical approach by transforming it into a linear optimal distribution problem in a directed graph. Upper bound of the solution is discussed. Simulation results are studied to evaluate the algorithm performance. The algorithm approaches the upper bound with low complexity.