首页> 外文期刊>IEEE Transactions on Vehicular Technology >Joint Multirelay Selection, Power Allocation, and Beamformer Design for Multiuser Decode-and-Forward Relay Networks
【24h】

Joint Multirelay Selection, Power Allocation, and Beamformer Design for Multiuser Decode-and-Forward Relay Networks

机译:多用户解码转发中继网络的联合多中继选择,功率分配和波束形成器设计

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

摘要

Consider a two-hop relay network that consists of multiple pairs of single-antenna users and multiple multiantenna relays. We assume that the relays employ a linear decode-and-forward (DF) strategy to cooperatively forward information from sources to their destinations. To provide fairness among users and alleviate the network backhaul load, we consider a signal-to-interference-plus-noise-ratio (SINR)-based max–min fairness (MMF) problem by jointly optimizing the power allocation at sources, the receive and transmit beamformers at relays, and the size of the cooperating relays. This problem is a nonlinear mixed-integer program, which is challenging to solve. As a compromise, we seek some efficient approximate solutions to it. Specifically, we first approximate the hard backhaul constraint by a group sparse constraint and then employ the uplink–downlink duality transformation, advocated by Luo et al. [IEEE Transactions on Wireless Communications 2015], to eliminate trivial nonsparse solutions. From there, a custom-made distributed algorithm is developed for the approximated problem by fitting it into the alternating direction method of multipliers (ADMM) framework. Each iteration of ADMM can be computed in closed form, thus giving it very low complexity. The effectiveness of the proposed algorithm was validated by extensive numerical simulations.
机译:考虑一个两跳中继网络,该网络由多对单天线用户和多个多天线中继组成。我们假设中继器采用线性解码和转发(DF)策略,以协作方式将信息从源转发到其目的地。为了在用户之间提供公平性并减轻网络回程负载,我们通过共同优化源,接收端的功率分配,考虑了基于信号干扰加噪声比(SINR)的最大-最小公平性(MMF)问题。并在中继站发送波束成形器,以及协作中继站的大小。这个问题是一个非线性的混合整数程序,要解决这个难题。作为一种折衷,我们寻求一些有效的近似解决方案。具体来说,我们首先通过组稀疏约束近似硬回程约束,然后采用罗等人提倡的上行链路-下行链路对偶变换。 [2015年IEEE无线通信事务],以消除琐碎的非稀疏解决方案。在那里,通过将其拟合到乘数的交替方向方法(ADMM)框架中,针对近似问题开发了定制的分布式算法。 ADMM的每次迭代都可以以封闭形式进行计算,因此复杂度非常低。通过大量的数值模拟验证了所提算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号