Abstract
This paper studies the resource allocation for orthogonal frequency division multiple access (OFDMA) relay system with a single source node, multiple relay nodes and multiple destination nodes. Joint subcarrier allocation and relay selection problem with different Quality of Service (QoS) requirements on destination nodes is transformed to the maximum weight matching problem in a bipartite graph. The Kuhn-Munkres algorithm can be used to find the optimal solution, but it has high complexity. Therefore, a low complexity suboptimal algorithm is proposed. When adding fairness constraint on relay nodes, we also propose a suboptimal algorithm. Simulation results show the proposed algorithms achieve near the optimal performance with low complexity.
Sign-in/Register to access full text options 
Free) 
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
