Skip to main navigation Skip to search Skip to main content

User grouping and power allocation in NOMA-based internet of things

  • Jian He
  • , Shuo Shi*
  • , Zhenyu Xu
  • *Corresponding author for this work
  • School of Electronics and Information Engineering, Harbin Institute of Technology
  • Peng Cheng Laboratory
  • Huizhou Engineering Vocational College

Research output: Contribution to journalArticlepeer-review

Abstract

With the increasing number of terminal devices in the sensor network and the Internet of things, non-orthogonal multiple access (NOMA) will be widely used in the future to improve spectrum resource utilization. In this paper, we considered how to control massive devices in the downlink in of scenario of space-based Internet of Things (S-IoT). In the case of multiple base stations (BSs), user fairness is a difficult problem, which usually requires a traversal algorithm to achieve the optimal solution. However, the time complexity caused by this method is the product of the complexity of user grouping and power allocation, which is unbearable. We split the problem into two sub-problems changing complexity from product form to additive form, and solve them by using low time complexity algorithms respectively. Firstly, we use a threshold-based algorithm to implement user grouping, and then use a bisection iterative algorithm for power allocation. In the simulation, we compared design with several benchmarks and results show that the minimum user rate is significantly improved and closed to optimal value by using proposed algorithm in this paper.

Original languageEnglish
Pages (from-to)5375-5387
Number of pages13
JournalWireless Networks
Volume30
Issue number6
DOIs
StatePublished - Aug 2024
Externally publishedYes

Keywords

  • Internet of things
  • Maximum fairness
  • Non-orthogonal multiple access
  • Power allocation
  • User grouping

Fingerprint

Dive into the research topics of 'User grouping and power allocation in NOMA-based internet of things'. Together they form a unique fingerprint.

Cite this