首页> 外文期刊>Vehicular Technology, IEEE Transactions on >Quantized Ergodic Radio Resource Allocation in Cognitive Networks With Guaranteed Quality of Service for Primary Network
【24h】

Quantized Ergodic Radio Resource Allocation in Cognitive Networks With Guaranteed Quality of Service for Primary Network

机译:保证主网络服务质量的认知网络中的量化遍历无线电资源分配

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

摘要

In this paper, for cognitive networks, ergodic resource allocation (ERA) in the downlink of an OFDMA-based secondary network is investigated, assuming the availability of quantized channel state information (CSI) between the secondary base station and secondary users. The main objective is to maximize the average sum rate of the secondary network subject to the average total transmission power constraint and the collision probability constraint of the primary users on each subcarrier. In the proposed scheme, there is no need for the instantaneous handshaking between secondary and primary networks to provide CSI between the secondary base station and primary receivers. In fact, the secondary base station only needs the knowledge of channel distribution information. Due to the probabilistic nature of the collision probability constraint in the proposed ERA problem, it cannot be solved by conventional methods such as dual decomposition. Therefore, we propose two novel suboptimal solutions called the iterative and analytical approaches. It is also demonstrated that the solutions obtained based on the proposed approaches are very close to the optimal solution. Numerical experiments are then carried out to demonstrate the performance of the proposed methods. Numerical results show that the performance of the analytical approach is inferior to that of the iterative approach, although it exhibits significantly less computational complexity.
机译:在本文中,对于认知网络,假设辅助基站和辅助用户之间的量化信道状态信息(CSI)可用,研究基于OFDMA的辅助网络的下行链路中的遍历资源分配(ERA)。主要目标是在每个子载波上,根据平均总传输功率约束和主要用户的冲突概率约束,使辅助网络的平均总速率最大化。在提出的方案中,不需要在次要网络和主要网络之间的瞬时握手来在次要基站和主要接收器之间提供CSI。实际上,辅助基站仅需要信道分配信息的知识。由于所提出的ERA问题中碰撞概率约束的概率性质,因此无法通过常规方法(例如双重分解)解决。因此,我们提出了两个新颖的次优解决方案,称为迭代和分析方法。还证明了基于所提出的方法获得的解决方案非常接近最优解决方案。然后进行了数值实验,以证明所提出方法的性能。数值结果表明,尽管分析方法的计算复杂度明显降低,但其性能却不如迭代方法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号