An Improved K-Power Means Technique Using Minkowski Distance Metric and Dimension Weights for Clustering Wireless Multipaths in Indoor Channel Scenarios
Wireless multipath clustering is an important area in channel modeling, and an accurate channel model can lead to a reliable wireless environment. Finding the best technique in clustering wireless multipath is still challenging due to the radio channels’ time-variant characteristics. Several cluster...
Saved in:
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Utara Malaysia Press
2021
|
Subjects: | |
Online Access: | https://repo.uum.edu.my/id/eprint/28761/1/JICT%2020%2004%202021%20541-563.pdf https://doi.org/10.32890/jict2021.20.4.4 https://repo.uum.edu.my/id/eprint/28761/ https://e-journal.uum.edu.my/index.php/jict/article/view/13834 https://doi.org/10.32890/jict2021.20.4.4 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Universiti Utara Malaysia |
Language: | English |
Summary: | Wireless multipath clustering is an important area in channel modeling, and an accurate channel model can lead to a reliable wireless environment. Finding the best technique in clustering wireless multipath is still challenging due to the radio channels’ time-variant characteristics. Several clustering techniques have been developed that offer an improved performance but only consider one or two parameters of the multipath components. This study improved the K-PowerMeans technique by incorporating weights or loads based on the principal component analysis and utilizing the Minkowski distance metric to replace the Euclidean distance. K-PowerMeans is one of the several methods in clustering wireless propagation multipaths and has been widely studied. This improved clustering technique was applied to the indoor datasets generated from the COST 2100 channel Model and considered the multipath components’ angular domains and their delay. The Jaccard index was used to determine the new method’s accuracy performance. The results showed a significant improvement in the clustering of the developed algorithm than the standard K-PowerMeans. |
---|