2020
DOI: 10.5954/icarob.2020.os10-4
|View full text |Cite
|
Sign up to set email alerts
|

Implementation of the X-means Clustering Algorithm for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 7 publications
0
1
0
Order By: Relevance
“…A bad choice of initial centroid leads to unbalanced cluster sizes and unbalanced CHs consumption that causes premature CHs death at the early stage of the network lifetime. Therefore, Radwan et al [23]- [25] proposed the X-mean algorithm in three articles. Their concept is to split k-means centroid (parents) into multiple new positions (children), thus expanding the search space for better positioning and the best number of clusters.…”
Section: Introductionmentioning
confidence: 99%
“…A bad choice of initial centroid leads to unbalanced cluster sizes and unbalanced CHs consumption that causes premature CHs death at the early stage of the network lifetime. Therefore, Radwan et al [23]- [25] proposed the X-mean algorithm in three articles. Their concept is to split k-means centroid (parents) into multiple new positions (children), thus expanding the search space for better positioning and the best number of clusters.…”
Section: Introductionmentioning
confidence: 99%