首页> 外文期刊>Ad hoc networks >Towards optimal resource allocation in wireless powered communication networks with non-orthogonal multiple access
【24h】

Towards optimal resource allocation in wireless powered communication networks with non-orthogonal multiple access

机译:在非正交多址无线通信网络中实现最佳资源分配

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

摘要

The optimal allocation of time and energy resources is characterized in a Wireless Powered Communication Network (WPCN) with Non-Orthogonal Multiple Access (NOMA). We consider two different formulations; in the first one (max-sum), the sum-throughput of all users is maximized. In the second one (max-min), and targeting fairness among users, we consider maximizing the min-throughput of all users. Under the above two formulations, two NOMA decoding schemes are studied, namely, Low Complexity Decoding (LCD) and Successive Interference Cancellation Decoding (SICD). Due to the non-convexity of three of the studied optimization problems, we consider an approximation approach, in which the non-convex optimization problem is approximated by a convex optimization problem, which satisfies all the constraints of the original problem. The approximate convex optimization problem can then be solved iteratively. The results show a trade-off between maximizing the sum throughout and achieving fairness through maximizing the minimum throughput. (C) 2018 Elsevier B.V. All rights reserved.
机译:具有非正交多路访问(NOMA)的无线通信网络(WPCN)表征了时间和能源的最佳分配。我们考虑两种不同的表述;在第一个(最大和)中,所有用户的总和是最大的。在第二个(最大-最小)中,并针对用户之间的公平性,我们考虑使所有用户的最小吞吐量最大化。在以上两种形式下,研究了两种NOMA解码方案,即低复杂度解码(LCD)和连续干扰消除解码(SICD)。由于所研究的三个优化问题的非凸性,我们考虑了一种近似方法,其中非凸优化问题由凸优化问题近似,该凸优化问题满足了原始问题的所有约束。然后可以迭代地解决近似凸优化问题。结果表明,在最大程度地增加总和与通过最大化最小吞吐量来实现公平性之间进行权衡。 (C)2018 Elsevier B.V.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号