The network lifetime is a vital research area of wireless sensor networks (WSNs), K-means are potential solutions that prolongs the network lifetime. However, there are limitations hampering these algorithms, such as the number of clusters is a fixed value and the initial positions of the cluster centroids are predetermined locations. A bad choice of initial centroids leads to a bad clustering and a high energy consumption, thus this paper proposes two phases optimization of initial centroids called X-means; first K-means cluster formed then they are slit into multiple clusters. In general, clusters constructed using tentative CHs selected by K-means algorithm as an initial phase, After that, each cluster gives birth to children, then these children compete to form clusters and the surviving children are the final clusters. The simulation results showed that X-means outperforms the traditional K-means algorithm and it has reduced energy consumption by optimizing clusters initial positions.

1.
Lu
Y.
Industry 4.0: A survey on technologies, applications and open research issues
.
J Ind Inf Integr.
2017
;
6
:
1
10
.
2.
Yick
J
,
Mukherjee
B
,
Ghosal
D.
Wireless sensor network survey
.
Comput Networks.
2008
;
52
(
12
):
2292
330
.
3.
Heinzelman
W.R.
,
Chandrakasan
A
,
Balakrishnan
H.
Energy-efficient communication protocol for wireless microsensor networks
. In:
System sciences, 2000 Proceedings of the 33rd annual Hawaii international conference on. IEEE
;
2000
. p.
10
pp. vol.
2
.
4.
Younis
O
,
Fahmy
S.
HEED: a hybrid, energy-efficient, distributed clustering approach for ad hoc sensor networks
.
IEEE Trans Mob Comput.
2004
;
3
(
4
):
366
79
.
5.
Ye
M
,
Li
C
,
Chen
G
,
Wu
J.
EECS: An energy efficient clustering scheme in wireless sensor networks 10a.2. Conf Proc IEEE Int Performance
,
Comput Commun Conf.
2005
;
535
40
.
6.
Park
GY
,
Kim
H
,
Jeong
H.W.
,
Youn
H.Y.
A novel cluster head selection method based on k-means algorithm for energy efficient wireless sensor network
. In:
Proceedings - 27th International Conference on Advanced Information Networking and Applications Workshops, WAINA 2013
.
2013
. p.
910
5
.
7.
Periyasamy
S
,
Khara
S
,
Thangavelu
S.
Balanced Cluster Head Selection Based on Modified k-Means in a Distributed Wireless Sensor Network
.
Int J Distrib Sens Networks.
2016
;
2016
.
8.
Sasikumar
P
,
Khara
S.
K-Means Clustering in Wireless Sensor Networks
. In:
Proceedings - 4th International Conference on Computational Intelligence and Communication Networks, CICN 2012
.
2012
. p.
140
4
.
9.
Razzaq
M
,
Devi Ningombam
D
,
Shin
S.
Energy efficient K-means clustering-based routing protocol for WSN using optimal packet size
. In:
International Conference on Information Networking
.
2018
. p.
632
5
.
10.
Khan
M.A.
,
Tamim
I
,
Ahmed
E
,
Awal
M.A.
Multiple Parameter Based Clustering (MPC): Prospective Analysis for Effective Clustering in Wireless Sensor Network (WSN) Using K-Means Algorithm
.
Wirel Sens Netw.
2012
;
04
(
01
):
18
24
.
11.
Pelleg
D
,
Moore
A.
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
. In:
InIcml
2000
Jun. p.
727
34
.
12.
Dubey
AK
.
An efficient variable distance measure k-means [VDMKM] algorithm for cluster head selection in WSN
.
Int J Innov Technol Explor Eng.
2019
;
9
(
1
):
87
92
.
13.
Radwan
A
,
Kamarudin
NH
,
Solihin
MI
,
Ang
CK
,
Leong
H
,
Rizon
M.
Implementation of the X-means Clustering Algorithm for Wireless Sensor Networks
. In:
International Conference on Artificial Life and Robotics (ICAROB 2020) [Internet]. ICAROB2020; 2020
. p.
333
7
. Available from: https://alife-robotics.co.jp/LP/2020/OS10-4.htm
14.
Xu
D
,
Tian
Y.
A Comprehensive Survey of Clustering Algorithms
.
Ann Data Sci.
2015
;(May).
15.
Hartigan
JA
,
Wong
MA
.
Algorithm AS 136: A k-means clustering algorithm
.
J R Stat Soc Ser C (Applied Stat.
1979
;
28
(
1
):
100
8
.
This content is only available via PDF.
You do not currently have access to this content.