首页> 外文会议>1st ACM workshop on mobile internet through cellular networks 2009 >Multiuser Subchannel Matching Algorithms for Two-hop OFDM Relay Networks
【24h】

Multiuser Subchannel Matching Algorithms for Two-hop OFDM Relay Networks

机译:两跳OFDM中继网络的多用户子信道匹配算法

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

摘要

The combination of orthogonal frequency division multiplexing (OFDM) modulation and relay technology is a promising way to increase system throughput and coverage area for the next-generation wireless cellular networks. The end-to-end system throughput in these networks relies on an appropriate and effective subchannel matching scheme because of the frequency selective fading on subchannels. In this paper, we consider the subchannel matching problem for a two-hop multiuser OFDM Relay network. Two algorithms are proposed for subchannel matching, aiming at two cases of user service type. The first algorithm can achieve high system throughput and the second one pursues to guarantee the quality of service (QoS) of high priority users. Simulation results show that our proposed algorithms outperform the existing subchannel matching schemes in terms of system throughput or the QoS of the high priority users.
机译:正交频分复用(OFDM)调制和中继技术的结合是增加下一代无线蜂窝网络的系统吞吐量和覆盖范围的有前途的方法。由于子信道上的频率选择性衰落,这些网络中的端到端系统吞吐量依赖于适当且有效的子信道匹配方案。在本文中,我们考虑了两跳多用户OFDM中继网络的子信道匹配问题。针对两种用户服务类型的情况,提出了两种子信道匹配算法。第一种算法可以实现高系统吞吐量,第二种算法可以保证高优先级用户的服务质量(QoS)。仿真结果表明,本文提出的算法在系统吞吐量或高优先级用户的QoS方面优于现有的子信道匹配方案。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号