...
首页> 外文期刊>Vehicular Technology, IEEE Transactions on >On Ergodic Sum Capacity of Fading Channels in OFDMA-Based Cognitive Radio Networks
【24h】

On Ergodic Sum Capacity of Fading Channels in OFDMA-Based Cognitive Radio Networks

机译:基于OFDMA的认知无线电网络中衰落信道的遍历总容量

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

获取外文期刊封面封底 >>

       

摘要

An orthogonal frequency-division multiple access (OFDMA)-based cognitive radio network (CRN) is considered where cognitive radio users (CRUs) can only access the frequency bands not being occupied by primary users (PUs) while keeping the cross-channel interference to each PU under a specified threshold. In this paper, we investigate the ergodic sum capacity of all CRUs in OFDMA-based networks and consider the constraints on the long-term transmit power of all CRUs, the long-term interference thresholds of PUs, and the statistical proportional fairness of all CRUs. In OFDMA-based CRNs, the number of available subchannels is smaller than that of CRUs in some OFDM symbol durations. To deal with this time-varying nature of available spectrum resource and achieve the ergodic sum capacity of all CRUs, we propose an optimal resource-allocation algorithm under the given constraints. Simulation results show that the proposed algorithm can achieve substantial capacity gains for CRUs over the traditional resource-allocation algorithm and maintain the statistical proportional rate constraints of all CRUs.
机译:考虑了基于正交频分多址(OFDMA)的认知无线电网络(CRN),其中认知无线电用户(CRU)只能访问未由主要用户(PU)占用的频段,同时保持对每个PU在指定的阈值以下。在本文中,我们研究了基于OFDMA的网络中所有CRU的遍历总容量,并考虑了所有CRU的长期发射功率,PU的长期干扰阈值以及所有CRU的统计比例公平性的约束。 。在基于OFDMA的CRN中,在某些OFDM符号持续时间内,可用子信道的数量小于CRU的数量。为了应对可用频谱资源的时变性质并实现所有CRU的遍历总容量,我们提出了在给定约束下的最优资源分配算法。仿真结果表明,与传统的资源分配算法相比,所提算法可以实现CRU容量的大幅提升,并保持所有CRU的统计比例速率约束。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号