首页> 外文会议>International Conference on Wireless Communications and Signal Processing >Joint Subcarrier Assignment and Downlink-Uplink Time-Power Allocation for Wireless Powered OFDM-NOMA Systems
【24h】

Joint Subcarrier Assignment and Downlink-Uplink Time-Power Allocation for Wireless Powered OFDM-NOMA Systems

机译:无线供电的OFDM-NOMA系统的联合子载波分配和下行链路-上行链路时间-功率分配

获取原文

摘要

In this paper, a wireless powered orthogonal frequency division multiplexing (OFDM)-non-orthogonal multiple access (NOMA) system is considered. The subcarrier assignment, energy harvesting/information transmission (EH/IT) time allocation, and downlink-uplink power allocation are jointly optimized to maximize the system sum-throughput while taking user fairness into account. Due to the intractability of the considered problem, we first decompose the original problem into two subproblems, namely, subcarrier assignment subproblem with fairness consideration and joint downlink-uplink time-power allocation subproblem. For subcarrier assignment sub-problem, with given joint downlink-uplink time-power allocation, a locally optimal subcarrier assignment algorithm is proposed based on the many-to-many matching theory. Then with given subcarrier assignment, an algorithm based on golden section method, iterative water-filling and projected subgradient method is proposed for achieving the optimal solution to joint downlink-uplink time-power allocation subproblem. An alternate iteration framework is further proposed to jointly optimize two subproblems for maximizing the system sum-throughput. Simulation results validate the effectiveness of the proposed algorithms, i.e., the proposed framework approaches to the joint downlink-uplink time-power allocation optimal solution with less than 5% throughput loss compared to the upper bound and with only about 40% complexity of the interior-point algorithm.
机译:在本文中,考虑了无线正交正交频分复用(OFDM)-非正交多址(NOMA)系统。子载波分配,能量收集/信息传输(EH / IT)时间分配和下行链路-上行链路功率分配共同进行了优化,以在考虑用户公平性的同时最大化系统总吞吐量。由于所考虑问题的难处理性,我们首先将原始问题分解为两个子问题,即考虑公平性的子载波分配子问题和下行链路-上行链路时间-功率分配子问题。对于子载波分配子问题,在给定下行链路-上行链路时间-功率联合分配的基础上,提出了一种基于多对多匹配理论的局部最优子载波分配算法。然后,在给定子载波分配的基础上,提出了一种基于黄金分割法,迭代注水和投影子梯度法的算法,以实现对下行链路-上行链路时功率分配子问题的最优解。进一步提出了一种替代迭代框架,以共同优化两个子问题,以最大程度地提高系统的吞吐量。仿真结果验证了所提出算法的有效性,即所提出的用于联合下行链路-上行链路时间-功率分配最优解决方案的框架方法与上限相比吞吐量损失小于5%,内部复杂度仅为40%点算法。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号