...
首页> 外文期刊>IEEE Transactions on Vehicular Technology >Energy-Efficient Resource Allocation for D2D Communications in Cellular Networks
【24h】

Energy-Efficient Resource Allocation for D2D Communications in Cellular Networks

机译:蜂窝网络中D2D通信的节能资源分配

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

摘要

In this paper, we study the energy-efficient resource allocation problem for device-to-device (D2D) communication underlaying cellular networks, which aims to maximize the minimum weighted energy efficiency of D2D links while guaranteeing minimum data rates for cellular links. We first characterize the optimal power allocation of the cellular links to transform the original resource allocation problem into the joint subchannel and power allocation problem for D2D links. We then propose three resource allocation algorithms with different complexity levels, namely, dual-based, branch-and-bound (BnB), and relaxation-based rounding (RBR) algorithms. While the dual-based algorithm solves the problem by using the dual decomposition method, the BnB and RBR algorithms tackle the problem by employing the relaxation approach. We establish the strong performance guarantees for the proposed algorithms through theoretical analysis. Extensive numerical studies demonstrate that the proposed algorithms achieve superior performance and significantly outperform a conventional algorithm.
机译:在本文中,我们研究了基于蜂窝网络的设备到设备(D2D)通信的节能资源分配问题,该问题旨在最大化D2D链路的最小加权能效,同时保证蜂窝链路的最小数据速率。我们首先表征蜂窝链路的最佳功率分配,以将原始资源分配问题转换为D2D链路的联合子信道和功率分配问题。然后,我们提出了三种具有不同复杂度级别的资源分配算法,即基于对偶的,分支定界(BnB)和基于松弛的舍入(RBR)算法。虽然基于对偶的算法通过使用对偶分解方法解决了该问题,但BnB和RBR算法通过采用松弛方法解决了该问题。通过理论分析,为所提出的算法建立了有力的性能保证。大量的数值研究表明,所提出的算法具有出色的性能,并且明显优于传统算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号