首页> 外文会议>Vehicular Technology Conference >Energy Efficiency Maximization of AF Relaying SWIPT Systems with Energy Recycling
【24h】

Energy Efficiency Maximization of AF Relaying SWIPT Systems with Energy Recycling

机译:能源效率最大限度地利用能量回收利用

获取原文

摘要

This paper studies a wireless-powered amplify-and- forward (AF) relaying system, where the relay harvests energy from the source or itself using an antenna switching protocol. At the first time slot, each antenna of the relay either receives information or harvests energy from the source and, then, a subset of antennas is chosen to forward information while the remaining antennas continue to harvest energy at the second time slot, which enables energy recycling. To maximize the energy efficiency of the relaying system, a mixed- integer non- linear fractional-combinatorial problem is formulated, which is however mathematically intractable. Accordingly, a suboptimal low-complexity iterative algorithm is developed, including joint power allocations at the source and relay and antenna switching at the relay. In particular, the joint power allocations is first performed by the BCD and Dinkelbach algorithms for a given antenna combination in the inner iteration while a low-complexity greedy algorithm is adopted to select the optimal antenna subset in the outer iteration. Simulation results demonstrate that energy recycling benefits higher energy efficiency.
机译:本文研究了一种无线功率的放大和前进(AF)中继系统,其中继电器从源或本身使用天线切换协议收获能量。在第一次时隙中,继电器的每个天线从源接收信息或收集能量,然后,选择天线的子集以转发信息,而剩余的天线在第二次时隙继续收获能量,这使得能量能够回收。为了使中继系统的能量效率最大化,配制了混合整数非线性组合问题,但是在数学上难以解决。因此,开发了一种次优的低复杂性迭代算法,包括在继电器处的源头和继电器和天线切换的接合功率分配。特别地,接合功率分配首先是由BCD和Dinkelbach算法进行用于在内部迭代中的给定天线组合的同时采用低复杂性贪婪算法来选择外迭代中的最佳天线子集。仿真结果表明,能量回收利益较高的能效。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号