首页> 外文期刊>IEEE Transactions on Signal Processing >Optimal Network Beamforming in Collaborative Relay Networks With Centralized Energy Harvesting
【24h】

Optimal Network Beamforming in Collaborative Relay Networks With Centralized Energy Harvesting

机译:具有集中式能量收集的协作中继网络中的最佳网络波束成形

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

We consider a network consisting of a transceiver-receiver pair and nr relay nodes. We assume that there is no direct link between the transmitter and the receiver. Assuming an amplify-and-forward relaying protocol, the relays collectively materialize a network beamformer to establish a link between the transmitter and the receiver. The transmitter and the receiver are assumed to have their own sources of power such as power grid, however, the relays are assumed to be connected to a central energy harvesting module with a battery with capacity of Bmax. We consider a communication scheme which consists of k time frames where in each time frame, a specific amount of the harvested energy will be allocated to each relay. Aiming to optimally calculate the relays' beamforming coefficients, we consider two different scenarios. In the first scenario, we consider an offline case where the channel state information for all links over all time frames is available and maximize the throughput of the network subject to two sets of constraints on the total power consumption by the relays over each time frame. The first set of constraints are energy causality constraints which ensure that only the energy which has been harvested up to any given time frame may be consumed. The second set of constraints are to prevent overflow of the battery at any given time frame by optimally using the available energy. We show that this throughput maximization problem is convex, and thus, it is amenable to a computationally efficient solution. In the second scenario, we consider a semi-offline case where only the statistics of the channel coefficients are available. In this scenario, assuming the aforementioned two sets of constraints, we aim to maximize the source-destination throughput averaged over all channel realizations. For this problem, we propose a simple algorithm to optimally calculate the relay beamforming vectors over each time frame. Our simulation results show that the gap between the value of the average throughput of the offline case and semi-offline case remains constant as the energy arrival rate increases. However, for any fixed value of energy arrival rate, this gap increases as the number of time frames increases.
机译:我们考虑一个由收发器对和nr个中继节点组成的网络。我们假设发送器和接收器之间没有直接链接。假设放大转发中继协议,这些中继共同实现网络波束成形器,以在发送器和接收器之间建立链接。假定发送器和接收器具有自己的电源,例如电网,但是,假定继电器与电池容量为Bmax的中央能量收集模块连接。我们考虑一种通信方案,该方案由k个时间帧组成,其中在每个时间帧中,特定数量的所收集能量将分配给每个中继。为了最佳地计算继电器的波束成形系数,我们考虑了两种不同的情况。在第一种情况下,我们考虑一种离线情况,其中在所有时间范围内所有链路的信道状态信息均可用,并使网络的吞吐量最大化,这取决于中继器在每个时间范围内对总功耗的两组约束。第一组约束是能量因果关系约束,它们确保仅消耗到任何给定时间范围内已收集的能量。第二组约束是通过最佳利用可用能量来防止电池在任何给定时间范围内溢出。我们表明,此吞吐量最大化问题是凸的,因此,它适合于计算有效的解决方案。在第二种情况下,我们考虑一种半离线情况,其中仅信道系数的统计信息可用。在这种情况下,假设上述两组约束,我们旨在使在所有通道实现中平均的源目的地吞吐量最大化。针对此问题,我们提出了一种简单的算法,可以在每个时间帧内最优地计算中继波束成形矢量。我们的仿真结果表明,随着能量到达率的提高,离线案例和半离线案例的平均吞吐量之间的差距保持恒定。但是,对于能量到达率的任何固定值,此差距会随着时间范围的增加而增加。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号