首页> 外文OA文献 >Low-complexity energy-efficient resource allocation for delay-tolerant two-way orthogonal frequency-division multiplexing relays
【2h】

Low-complexity energy-efficient resource allocation for delay-tolerant two-way orthogonal frequency-division multiplexing relays

机译:耐延迟的双向正交频分复用继电器的低复杂度节能资源分配

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

Energy-efficient wireless communication is important for wireless devices with a limited battery life and cannot be recharged. In this study, a bit allocation algorithm to minimise the total energy consumption for transmitting a bit successfully is proposed for a two-way orthogonal frequency-division multiplexing relay system, whilst considering the constraints of quality-of-service and total transmit power. Unlike existing bit allocation schemes, which maximise the energy efficiency (EE) by measuring ‘bits-per-Joule’ with fixed bidirectional total bit rates constraint and no power limitation, their scheme adapts the bidirectional total bit rates and their allocation on each subcarrier with a total transmit power constraint. To do so, they propose an idea to decompose the optimisation problem. The problem is solved in two general steps. The first step allocates the bit rates on each subcarrier when the total bit rate of each user is fixed. In the second step, the Lagrangian multipliers are used as the optimisation variants, and the dimension of the variant optimisation is reduced from 2N to 2, where N is the number of subcarriers. They also prove that the optimal point is on the bounds of the feasible region, thus the optimal solution could be searched through the bounds.ud
机译:节能无线通信对于电池寿命有限且无法充电的无线设备非常重要。在这项研究中,在考虑服务质量和总发射功率的约束的情况下,针对双向正交频分复用中继系统,提出了一种用于最大程度地减少成功发射位的总能耗的位分配算法。与现有的比特分配方案不同,现有的比特分配方案通过在固定双向总比特率约束且无功率限制的情况下通过测量“每焦耳比特数”来最大化能效(EE),其方案采用了双向总比特率及其在每个子载波上的分配,总发射功率约束。为此,他们提出了分解优化问题的想法。该问题可通过两个常规步骤解决。当每个用户的总比特率固定时,第一步将在每个子载波上分配比特率。在第二步中,将拉格朗日乘数用作优化变量,变量优化的维数从2N减少到2,其中N是子载波的数量。他们还证明了最佳点在可行区域的边界上,因此可以通过边界搜索最佳解。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号