Energy Efficient Dynamic Resource Optimization in NOMA System

Haijun Zhang, Baobao Wang, Chunxiao Jiang, Keping Long, Arumugam Nallanathan, Victor C.M. Leung, H. Vincent Poor

Research output: Contribution to journalArticlepeer-review

109 Scopus citations


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 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.

Original languageEnglish (US)
Article number8390925
Pages (from-to)5671-5683
Number of pages13
JournalIEEE Transactions on Wireless Communications
Issue number9
StatePublished - Sep 2018

All Science Journal Classification (ASJC) codes

  • Computer Science Applications
  • Electrical and Electronic Engineering
  • Applied Mathematics


  • Lyapunov optimization
  • NOMA
  • power allocation
  • subchannel assignment


Dive into the research topics of 'Energy Efficient Dynamic Resource Optimization in NOMA System'. Together they form a unique fingerprint.

Cite this