Hierarchical user clustering for mmWave-NOMA systems |
|
Author: | Marasinghe, Dileepa1; Jayaweera, Nalin1; Rajatheva, Nandana1; |
Organizations: |
1Centre for Wireless Communications, Univeristy of Oulu, Oulu, Finland |
Format: | article |
Version: | accepted version |
Access: | open |
Online Access: | PDF Full Text (PDF, 0.8 MB) |
Persistent link: | http://urn.fi/urn:nbn:fi-fe2020070646920 |
Language: | English |
Published: |
Institute of Electrical and Electronics Engineers,
2020
|
Publish Date: | 2020-07-06 |
Description: |
AbstractNon-orthogonal multiple access (NOMA) and mmWave are two complementary technologies that can support the capacity demand that arises in 5G and beyond networks. The increasing number of users are served simultaneously while providing a solution for the scarcity of the bandwidth. In this paper we present a method for clustering the users in a mmWave-NOMA system with the objective of maximizing the sum-rate. An unsupervised machine learning technique, namely, hierarchical clustering is utilized which does the automatic identification of the optimal number of clusters. The simulations prove that the proposed method can maximize the sum-rate of the system while satisfying the minimum QoS for all users without the need of the number of clusters as a prerequisite when compared to other clustering methods such as k-means clustering. see all
|
ISBN: | 978-1-7281-6047-4 |
ISBN Print: | 978-1-7281-6048-1 |
Pages: | 1 - 5 |
Article number: | 9083909 |
DOI: | 10.1109/6GSUMMIT49458.2020.9083909 |
OADOI: | https://oadoi.org/10.1109/6GSUMMIT49458.2020.9083909 |
Host publication: |
2020 2nd 6G Wireless Summit (6G SUMMIT) |
Conference: |
6G Wireless Summit |
Type of Publication: |
A4 Article in conference proceedings |
Field of Science: |
213 Electronic, automation and communications engineering, electronics |
Subjects: | |
Copyright information: |
© 2020 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. |