Please use this identifier to cite or link to this item:
http://hdl.handle.net/123456789/2706
Title: | 5G NOMA user grouping using discrete particle swarm optimization approach | Authors: | Abd Ghani, H. Farah Najwa Roslim Remli, MA Eissa Mohammed Mohsen Al-Shari Nurul Izrin Md Saleh Azizul Azizan |
Keywords: | Discrete;Multiple access;Non-orthogonal;Particle swarm optimization;User grouping | Issue Date: | Dec-2021 | Publisher: | Universitas Ahmad Dahlan | Project: | Discrete Particle Swarm Optimization for User Grouping in 5G NOMA systems | Journal: | TELKOMNIKA Telecommunication, Computing, Electronics and Control | Abstract: | Non-orthogonal multiple access (NOMA) technology meets the increasing demand for high-seed cellular networks such as 5G by offering more users to be accommodated at once in accessing the cellular and wireless network. Moreover, the current demand of cellular networks for enhanced user fairness, greater spectrum efficiency and improved sum capacity further increase the need for NOMA improvement. However, the incurred interference in implementing NOMA user grouping constitutes one of the major barriers in achieving high throughput in NOMA systems. Therefore, this paper presents a computationally lower user grouping approach based on discrete particle swarm intelligence in finding the best user-pairing for 5G NOMA networks and beyond. A discrete particle swarm optimization (DPSO) algorithm is designed and proposed as a promising scheme in performing the user-grouping mechanism. The performance of this proposed approach is measured and demonstrated to have comparable result against the existing state-of-the art approach. |
Description: | Scopus |
URI: | http://hdl.handle.net/123456789/2706 | ISSN: | 1693-6930 | DOI: | 10.12928/TELKOMNIKA.v19i6.18580 |
Appears in Collections: | Faculty of Data Science and Computing - Journal (Scopus/WOS) |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
18580-59258-1-PB.pdf | 526.52 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.