首页> 外文会议>2010 IEEE Global Telecommunications Conference >Graph-Based Optimization for Relay-Assisted Bidirectional Cellular Networks
【24h】

Graph-Based Optimization for Relay-Assisted Bidirectional Cellular Networks

机译:中继辅助双向蜂窝网络的基于图的优化

获取原文

摘要

This paper considers a relay-assisted bidirectional cellular network where the base station (BS) communicates with each mobile station (MS) using orthogonal frequency-division multiple-access (OFDMA) for both uplink and downlink. We first introduce a novel three-time-slot time-division duplexing (TDD) transmission protocol. This protocol unifies the direct transmission, one-way relaying and network-coded two-way relaying between the BS and each MS. Using the proposed TDD protocol, we then propose an optimization framework for resource allocation to achieve the following gains: cooperative diversity gain (via relay selection), network coding gain (via bidirectional transmission mode selection), and multiuser diversity gain (via subcarrier assignment). We formulate the problem as an integer programming problem. By establishing its equivalence with a maximum weighted clique problem (MWCP) in graph theory, we show that the problem can be solved using an ant colony optimization (ACO) based metaheuristic algorithm in polynomial time. Simulation results demonstrate that the proposed protocol together with the ACO algorithm significantly enhances the system total throughput compared with conventional schemes.
机译:本文考虑了中继辅助双向蜂窝网络,其中基站(BS)使用正交频分多址(OFDMA)与每个移动台(MS)进行上行链路和下行链路通信。我们首先介绍一种新颖的三时隙时分双工(TDD)传输协议。该协议统一了BS和每个MS之间的直接传输,单向中继和网络编码的双向中继。然后,使用提出的TDD协议,我们为资源分配提出一个优化框架,以实现以下收益:合作分集增益(通过中继选择),网络编码增益(通过双向传输模式选择)和多用户分集增益(通过子载波分配) 。我们将该问题表述为整数编程问题。通过在图论中建立与最大加权集团问题(MWCP)的等价关系,我们表明可以使用基于蚁群优化(ACO)的元启发式算法在多项式时间内解决该问题。仿真结果表明,与传统方案相比,所提出的协议与ACO算法共同显着提高了系统的总吞吐量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号