...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Communications >Resource Allocation and Fairness in Wireless Powered Cooperative Cognitive Radio Networks
【24h】

Resource Allocation and Fairness in Wireless Powered Cooperative Cognitive Radio Networks

机译：无线供电的合作认知无线电网络中的资源分配和公平性

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We integrate a wireless powered communication network with a cooperative cognitive radio network, where multiple secondary users (SUs) powered wirelessly by a hybrid access point (HAP) help a primary user relay the data. As a reward for the cooperation, the secondary network gains the spectrum access where SUs transmit to HAP using time division multiple access. To maximize the sum throughput of SUs, we present a secondary sum-throughput optimal resource allocation (STORA) scheme. Under the constraint of meeting target primary rate, the STORA scheme chooses the optimal set of relaying SUs and jointly performs the time and energy allocation for SUs. In particular, by exploiting the structure of the optimal solution, we find the order in which SUs are prioritized to relay primary data. Since the STORA scheme focuses on the sum throughput, it becomes inconsiderate toward individual SU throughput, resulting in low fairness. To enhance fairness, we investigate three resource allocation schemes, which are: 1) equal time allocation; 2) minimum throughput maximization; and 3) proportional time allocation. Simulation results reveal the tradeoff between sum throughput and fairness. The minimum throughput maximization scheme is the fairest one as each SU gets the same throughput, but yields the least SU sum throughput.
机译：我们将无线通信网络与协作式认知无线电网络集成在一起，在该网络中，由混合接入点（HAP）无线供电的多个辅助用户（SU）帮助主要用户中继数据。作为合作的奖励，辅助网络获得了频谱访问，其中SU使用时分多址传输到HAP。为了最大程度地提高SU的总吞吐量，我们提出了次级总吞吐量最佳资源分配（STORA）方案。在满足目标基本速率的约束下，STORA方案选择中继SU的最佳集合，并共同执行SU的时间和能量分配。特别是，通过利用最佳解决方案的结构，我们找到了SU优先转发中继数据的顺序。由于STORA方案侧重于总吞吐量，因此对于单个SU吞吐量就变得不加考虑，导致公平性低。为了提高公平性，我们研究了三种资源分配方案，即：1）等时分配； 2）最小吞吐量最大化； 3）按比例分配时间。仿真结果表明总吞吐量与公平性之间的权衡。最小吞吐量最大化方案是最公平的方案，因为每个SU获得相同的吞吐量，但产生的SU总吞吐量最小。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号