JOURNAL ARTICLE

Resource allocation for OFDMA amplify-forward relay system

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.

Keywords:
Relay Computer science Subcarrier Orthogonal frequency-division multiple access Resource allocation Quality of service Computer network Bipartite graph Frequency-division multiple access Hungarian algorithm Computational complexity theory Node (physics) Mathematical optimization Orthogonal frequency-division multiplexing Distributed computing Assignment problem Graph Algorithm Mathematics Theoretical computer science Engineering

Metrics

0
Cited By
0.00
FWCI (Field Weighted Citation Impact)
9
Refs
0.12
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Topics

Cooperative Communication and Network Coding
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced Wireless Network Optimization
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Caching and Content Delivery
Physical Sciences →  Computer Science →  Computer Networks and Communications
© 2026 ScienceGate Book Chapters — All rights reserved.