...
首页> 外文期刊>Eurasip Journal on Wireless Communications and Networking >Resource allocation for network MIMO systems with HARQ and partial channel knowledge
【24h】

Resource allocation for network MIMO systems with HARQ and partial channel knowledge

机译:具有HARQ和部分信道知识的网络MIMO系统的资源分配

获取原文
           

摘要

In this article, we consider a cellular system, where multiple base stations (BSs) cooperate to decode signals coming from mobile terminals (MTs), using a hybrid automatic repeat request error protection mechanism. We focus on the problem of weighted network sum rate maximization, by addressing the following three resource allocation problems: (a) the scheduling of MT transmissions, (b) the scheduling of cooperating BSs for each MT, and (c) the allocation of resources on the backhaul network. Both a star and a ring architecture for the backhaul network are considered. We propose two approaches, where resource allocation on the backhaul is performed either before or after reception of the packet on the wireless link, with a either partial (statistical) or full knowledge of instantaneous channels. Since both assignments are NP-hard , we also propose greedy algorithms. Based on the numerical results we compare the performance of the various approaches in a typical cellular scenario. The main results, among others, are that (a) the perfect channel knowledge allows a reduction of the backhaul usage by 2.5 to 3 times with respect to the case of partial channel knowledge, and (b) the ring architecture turns out to be more flexible than the star architecture. In particular, the most flexible architecture is given by the RING topology with decoding at the BS, where the backhaul throughput can be allocated to the BSs in any proportion, while at the same time the transfer of information from the serving BS to the RNC is avoided.
机译:在本文中,我们考虑一个蜂窝系统,其中多个基站(BS)配合使用混合自动重复请求错误保护机制来解码来自移动终端(MT)的信号。通过解决以下三个资源分配问题,我们关注加权网络总和速率最大化的问题:(a)MT传输的调度,(b)每个MT的协作BS的调度,以及(c)资源分配在回程网络上。回程网络的星形和环形架构均被考虑。我们提出了两种方法,其中在回程上的资源分配是在无线链路上接收数据包之前或之后执行的,具有部分(统计)或全部的瞬时信道知识。由于这两个分配都是NP-hard的,因此我们还提出了贪婪算法。基于数值结果,我们比较了典型蜂窝方案中各种方法的性能。主要结果包括:(a)完美的信道知识相对于部分信道知识而言,可将回程使用量减少2.5到3倍,并且(b)环形体系结构变得更多比星形架构灵活。尤其是,最灵活的架构是由RING拓扑提供的,并且在BS处进行解码,其中回程吞吐量可以按任意比例分配给BS,同时信息从服务BS到RNC的传输是避免。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号