2021 Twelfth International Conference on Ubiquitous and Future Networks (ICUFN) 2021
DOI: 10.1109/icufn49451.2021.9528659
|View full text |Cite
|
Sign up to set email alerts
|

User Clustering Techniques for Massive MIMO-NOMA Enabled mmWave/THz Communications in 6G

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
6
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(6 citation statements)
references
References 17 publications
0
6
0
Order By: Relevance
“…The work in [21] classified user clustering problems in mmWave-NOMA systems into joint resource aware user clustering techniques such as the ones applying the cosine similarity metric as described above and a second class of algorithms called learning assisted user clustering techniques to bring down the complexity. In [21], the complexity of several user clustering schemes in the mmWave-NOMA literature is analyzed and it is shown that a significant run-time complexity is inherited by all schemes to make clustering decisions on a millisecond granularity, especially as the network size grows. However, the machine learning techniques applying K-means like clustering algorithms bring down the complexity compared to traditional optimization schemes.…”
Section: A Related Workmentioning
confidence: 99%
See 2 more Smart Citations
“…The work in [21] classified user clustering problems in mmWave-NOMA systems into joint resource aware user clustering techniques such as the ones applying the cosine similarity metric as described above and a second class of algorithms called learning assisted user clustering techniques to bring down the complexity. In [21], the complexity of several user clustering schemes in the mmWave-NOMA literature is analyzed and it is shown that a significant run-time complexity is inherited by all schemes to make clustering decisions on a millisecond granularity, especially as the network size grows. However, the machine learning techniques applying K-means like clustering algorithms bring down the complexity compared to traditional optimization schemes.…”
Section: A Related Workmentioning
confidence: 99%
“…In (21), W (t) y ∈ R N ×H represents a weight matrix containing all the weights associated with the output layer. Specifically, each row in W (t) y is associated with each output neuron o = 1, 2, • • • , N .…”
mentioning
confidence: 99%
See 1 more Smart Citation
“…To address the real-time complexity issue with user clustering schemes that need to be run on a millisecond granularity, machine learning has often been proposed an enabler. The work in [138] classified user clustering problems in mmWave-NOMA systems into joint resource aware user clustering techniques such as the ones applying the cosine similarity metric as described in Chapter 3 and a second class of algorithms called learning assisted user clustering techniques to bring down the complexity. In [138], the complexity of several user clustering schemes in the mmWave-NOMA literature is analyzed and it is shown that a significant run-time complexity is inherited by all schemes to make clustering decisions on a millisecond granularity, especially as the network size grows.…”
Section: Related Workmentioning
confidence: 99%
“…The work in [138] classified user clustering problems in mmWave-NOMA systems into joint resource aware user clustering techniques such as the ones applying the cosine similarity metric as described in Chapter 3 and a second class of algorithms called learning assisted user clustering techniques to bring down the complexity. In [138], the complexity of several user clustering schemes in the mmWave-NOMA literature is analyzed and it is shown that a significant run-time complexity is inherited by all schemes to make clustering decisions on a millisecond granularity, especially as the network size grows. However, the machine learning techniques applying K-means like clustering algorithms bring down the complexity compared to traditional optimization schemes.…”
Section: Related Workmentioning
confidence: 99%