首页> 外文期刊>IEEE Transactions on Cognitive Communications and Networking >Energy-Efficient Resource Allocation for Energy Harvesting-Based Cognitive Machine-to-Machine Communications
【24h】

Energy-Efficient Resource Allocation for Energy Harvesting-Based Cognitive Machine-to-Machine Communications

机译:基于能量收集的认知机对机通信的节能资源分配

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

摘要

Energy harvesting-based cognitive machine-to-machine (EH-CM2M) communication has been proposed to overcome the problem of spectrum scarcity and limited battery capacity by enabling M2M transmitters (M2M-TXs) to harvest energy from ambient radio frequency signals, as well as to reuse the resource blocks (RBs) allocated to cellular users (CUs) in an opportunistic manner. However, the complex interference scenarios and the stringent quality of service (QoS) requirements pose new challenges on resource allocation optimization. In this paper, we consider how to maximize the energy efficiency of M2M-TXs via the joint optimization of channel selection, peer discovery, power control, and time allocation. We propose a two-stage 3-D matching algorithm. In the first stage, M2M-TXs, M2M receivers (M2M-RXs) and RBs are temporally matched together, and then the joint power control and time allocation problem is solved by combining alternating optimization (AO), nonlinear fractional programming, and linear programming to construct the preference lists. In the second stage, the joint channel selection and peer discovery problem is solved by the proposed pricing-based matching algorithm based on the established preference lists. Simulation results confirm that the proposed algorithm can approach the optimal performance with a low complexity.
机译:已经提出了基于能量收集的认知机器对机器(EH-CM2M)通信,以通过使M2M发射机(M2M-TX)也能够从环境射频信号中收集能量来克服频谱短缺和电池容量有限的问题。以机会的方式重用分配给蜂窝用户(CU)的资源块(RB)。但是,复杂的干扰场景和严格的服务质量(QoS)要求对资源分配优化提出了新的挑战。在本文中,我们考虑如何通过通道选择,对等点发现,功率控制和时间分配的联合优化来最大化M2M-TX的能效。我们提出了两阶段的3-D匹配算法。在第一阶段,将M2M-TX,M2M接收器(M2M-RX)和RB暂时匹配在一起,然后通过组合交替优化(AO),非线性分数规划和线性规划来解决联合功率控制和时间分配问题构造首选项列表。在第二阶段,通过基于已建立的偏好列表的基于定价的匹配算法,解决了联合信道选择和对等点发现问题。仿真结果表明,该算法能够以较低的复杂度实现最优性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号