...
首页> 外文期刊>IEEE transactions on wireless communications >Energy Efficient Resource Allocation for Multiuser Relay Networks
【24h】

Energy Efficient Resource Allocation for Multiuser Relay Networks

机译:多用户中继网络的节能资源分配

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

In this paper, a novel resource allocation algorithm is investigated to maximize the energy efficiency (EE) in multiuser decode-and-forward (DF) relay interference networks. The EE optimization problem is formulated as the ratio of the spectrum efficiency (SE) over the entire power consumption of the network subject to total transmit power, subcarrier pairing, and allocation constraints. The formulated problem is a nonconvex fractional mixed binary integer programming problem, i.e., NP-hard to solve. Furthermore, we resolve the convexity of the problem by a series of convex transformations and propose an iterative EE maximization algorithm to jointly determine the optimal subcarrier pairing at the relay, subcarrier allocation to each user pair and power allocation to all source and the relay nodes. Additionally, we derive an asymptotically optimal solution by using the dual decomposition method. To gain more insights into the obtained solutions, we further analyze the resource allocation algorithm in a two-user case with interference-dominated and noise-dominated regimes. In addition, a suboptimal algorithm is investigated with reduced complexity at the cost of acceptable performance degradation. Simulation results are used to evaluate the performance of the proposed algorithms and demonstrate the impacts of various network parameters on the attainable EE and SE.
机译:本文研究了一种新颖的资源分配算法,以最大程度地提高多用户解码转发(DF)中继干扰网络中的能效(EE)。 EE优化问题公式化为频谱效率(SE)在网络总功耗中受总发射功率,子载波配对和分配约束的比率。所提出的问题是非凸分数混合二进制整数规划问题,即,难于解决的NP。此外,我们通过一系列凸变换解决了问题的凸性,并提出了一种迭代EE最大化算法,共同确定中继站的最佳子载波对,分配给每个用户对的子载波以及分配给所有源和中继节点的功率。此外,我们使用对偶分解方法得出了渐近最优解。为了获得对获得的解决方案的更多见解,我们进一步分析了具有干扰控制和噪声控制的两用户情况下的资源分配算法。另外,以降低的复杂度为代价研究了次优算法,但性能降低了。仿真结果用于评估所提出算法的性能,并证明各种网络参数对可达到的EE和SE的影响。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号