This paper studies the resource allocation for orthogonal frequency-division multiple-access relay network with multiple source nodes, multiple relay nodes, and a single destination node. The optimal source/relay/subcarrier allocation problem with fairness constraint on relay nodes 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 and simulation results are studied to evaluate the algorithm performance
No takes yet. Share an insight, caveat, or question.
Li et al. (2006) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: