Skip to main content

Energy Efficient Dynamic Resource Optimization in NOMA System

Author(s): Zhang, Haijun; Wang, Baobao; Jiang, Chunxiao; Long, Keping; Nallanathan, Arumugam; et al

Download
To refer to this page use: http://arks.princeton.edu/ark:/88435/pr1901zg12
Abstract: Non-orthogonal multiple access (NOMA) with successive interference cancellation (SIC) is a promising technique for next generation wireless communications. Using NOMA, more than one user can access the same frequency-time resource simultaneously and multi-user signals can be separated successfully using SIC. In this paper, resource allocation algorithms for subchannel assignment and power allocation for a downlink NOMA network are investigated. Different from the existing works, here, energy efficient dynamic power allocation in NOMA networks is investigated. This problem is explored using the Lyapunov optimization method by considering the constraints on minimum user quality of service and the maximum transmit power limit. Based on the framework of Lyapunov optimization, the problem of energy efficient optimization can be broken down into three subproblems, two of which are linear and the rest can be solved by introducing a Lagrangian function. The mathematical analysis and simulation results confirm that the proposed scheme can achieve a significant utility performance gain and the energy efficiency and delay tradeoff is derived as [O(1/V), O(V)] with V as a control parameter under maintaining the queue stability.
Publication Date: 20-Jun-2018
Citation: Zhang, Haijun, Wang, Baobao, Jiang, Chunxiao, Long, Keping, Nallanathan, Arumugam, Leung, Victor CM, Poor, H Vincent. (2018). Energy Efficient Dynamic Resource Optimization in NOMA System. IEEE Transactions on Wireless Communications, 17 (9), 5671 - 5683. doi:10.1109/twc.2018.2844359
DOI: doi:10.1109/twc.2018.2844359
ISSN: 1536-1276
EISSN: 1558-2248
Pages: 5671 - 5683
Type of Material: Journal Article
Journal/Proceeding Title: IEEE Transactions on Wireless Communications
Version: Author's manuscript



Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.