Resource Allocation for OFDMA Relay Networks With Fairness Constraints
Resource Allocation for OFDMA Relay Networks With Fairness Constraints
复制标题
DOI：
10.1109/jsac.2006.881627
复制
发表时间：
2006-11
影响因子：
16.4
通讯作者：
Guoqing Li;Hui Liu
中科院分区：
文献类型：
--
作者：
Guoqing Li;Hui Liu
研究了多源节点、多中继节点和单目的节点的正交频分多址中继网络的资源分配问题。将中继节点具有公平性约束的信源/中继/子载波最优分配问题转化为一个二进制整数规划问题。然后，使用图论方法将其转化为有向图中的线性最优分配问题来解决该问题。讨论了解的上界，并通过仿真实验对算法性能进行了评价
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