首页> 外文期刊>IEEE transactions on wireless communications >Joint Resource Allocation and Relay Selection in LTE-Advanced Network Using Hybrid Co-Operative Relaying and Network Coding
【24h】

Joint Resource Allocation and Relay Selection in LTE-Advanced Network Using Hybrid Co-Operative Relaying and Network Coding

机译:使用混合合作中继和网络编码的LTE-Advanced网络中的联合资源分配和中继选择

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

摘要

The problem of joint resource allocation and relay selection is studied for bidirectional LTE-advanced relay networks. The bidirectional communication between user equipment (UE) and eNodeB (eNB) is performed via direct transmission, co-operative relaying (CoR), or a combination of network coding (NC) and CoR (NC/CoR). In this paper, an enhanced three-time-slot per cycle time-division duplexing (TDD) scheme is proposed for LTE-Advanced frame architecture to accommodate a hybrid transmission scheme. More specifically, we formulate the problem of joint resource assignment, relay selection, and bidirectional transmission scheme selection as a combinatorial optimization problem with the objective to maximize the total product of backlog and rate (back-pressure principle). Two approaches are considered to solve our combinatorial optimization problem. First, a graph-based framework is proposed in which the problem is transformed into a maximum weighted Clique problem (MWCP). In addition, our problem is also transformed into a three-dimensional assignment problem (3DAP) which is solved using a hybrid ant colony optimization (ACO) algorithm. Using simulations, it is concluded that the hybrid transmission scheme outperforms all conventional nonhybrid schemes. Moreover, the simulation results confirm that while the two proposed solutions provide similar results, the ACO algorithm is faster due to its lower complexity.
机译:研究了双向LTE先进中继网络的联合资源分配和中继选择问题。用户设备(UE)和eNodeB(eNB)之间的双向通信是通过直接传输,协作中继(CoR)或网络编码(NC)和CoR(NC / CoR)的组合来执行的。本文针对LTE-Advanced帧架构提出了一种增强的每周期三时隙时分双工(TDD)方案,以适应混合传输方案。更具体地说,我们将联合资源分配,中继选择和双向传输方案选择的问题公式化为组合优化问题,目的是最大化积压和速率的总积(背压原理)。考虑了两种方法来解决我们的组合优化问题。首先,提出了一种基于图的框架,其中将问题转换为最大加权集团问题(MWCP)。此外,我们的问题也被转换为三维分配问题(3DAP),使用混合蚁群优化(ACO)算法进行求解。使用模拟得出的结论是,混合传输方案的性能优于所有常规非混合方案。此外,仿真结果证实,虽然两个提出的解决方案提供了相似的结果,但是ACO算法由于其较低的复杂度而速度更快。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号