International Journal of Trend in Scientific Research and Development (IJTSRD)

International Open Access Journal | www.ijtsrd.com

ISSN No: 2456 - 6470 | Volume - 2 | Issue – 6 | Sep – Oct 2018

Performance Analysis of K
K-mean
mean Clustering Map for Different Nodes
Subham Bhawsar, Aastha Hajari
Embedded
edded System and VLSI Design
Design, Department of Electronics and
nd Communication Engineering
Shiv Kumar Singh Institute of Technology & Science (SKSITS), Indore, Madhya Pradesh,
Pradesh India

ABSTRACT
WSNs is a group of inexpensive and autonomous
sensor nodes interconnected and work together to
monitor various environmental conditions such as
humidity, temperature, pressure, and other climate
changes. Wireless sensor nodes are randomly installed
and communicate themselves through the wireless
communication medium. In this paper we compared
the simulation results of the K-mean
mean techniques for
different numbers of nodess like 50, 100 and 150.
Keyword: K-mean, Nodes, Clusters.
I. INTRODUCTION
The Wireless sensor networks (WSN) are highly
distributed networks of small, lightweight nodes and
deployed in large numbers to monitor the
environment parameters or system by the
measurement of physical parameters such as
temperature, pressure, or relativee humidity [2]. Each
node of the network consists of three subsystems: the
sensor subsystem which senses the environment, the
processing subsystem which performs local
computation on the sensed data, and the
communication subsystem which is responsible for
message exchange with neighbour sensor nodes.
While individual sensors have limited sensing region,
processing power, and energy, networking a large
numbers of sensors gives rise to robust, reliable, and
accurate sensor network covering a wider region [2][2].
Wireless Sensor Networks (WSNs) typically consist
of a large number of low-cost, cost, low
low-power and
multifunctional wireless sensor nodes. Nodes are
equipped with sensing, communication and
computation capabilities, where they communicate via
a wireless medium m and work collaboratively to
accomplish a common task.
To get more efficient and effective result of K-mean
K
algorithm there have been a lot of research happened
in previous day. All researchers worked on different
view and with different idea. Krishna and Murty[4]
proposed the genetic K-means(GKA)
means(GKA) algorithm which
integrate a genetic algorithm with K-means
K in order to
achieve a global search and fast convergence.
Components of sensor node
Wireless sensor networks (WSNs) have gained world-world
wide consideration
ation in recent years, particularly with
the proliferation in Micro-Electro
Electro-Mechanical systems
(MEMS) technology which has facilitated the
development of intelligent sensors. Sensor node as
shown in Figure 1 may also have additional
application dependent components such as a location
finding system, power generator and mobilize [1].
The analog signals produced by the sensors based on
the observed phenomenon are transformed to digital
signals by ADC, and then fed into the processing unit.
The processing unit, t, which is generally associated
with a small storage unit, manages the events that
make the sensor node collaborate with other nodes to
carry out the assigned sensing tasks. A transceiver
unit connects the node to the network [1]. The main
job of sensor nodeode in a sensor field is to detect the
events, perform quick local data processing, and
broadcast the data. Energy consumption is a key issue
in wireless sensor networks (WSNs). In a sensor node,
energy is consumed by the power supply, the sensor,
the computation
utation unit and the broadcasting unit. The
wireless sensor node, being a microelectronics device,
can only be equipped with a limited power source
(≤0.5 Ah, 1.2 V) [1].

@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 6 | Sep-Oct

Oct 2018 Page: 1215
 International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
2456

Fig 1: Components of a sensor node [1]

Density based Clustering algorithms: Data oobjects are

categorized into core points, border points and noise
points. All the core points are connected together
based on the densities to form cluster. Arbitrary
shaped clusters are formed by various clustering
algorithms such as DBSCAN, OPTICS, DBCLASDBCLASD,
GDBSCAN, DENCLU and SUBCLU [3].
Fig. 2: K-Means Algorithm [5, 6]
II. K-MEANS CLUSTERING
There are many algorithms for partition clustering A.1 K-mean
mean Algorithm Process
category, such as kmeans clustering (MacQueen 1. Select K points as initial centroid.
1967), k-medoid
medoid clustering, genetic kk-means 2. Repeat.
algorithm (GKA), Self-Organizing
Organizing Map (SOM) and 3. Form k clusters by assigning all points to the
also graph-theoretical
theoretical methods (CLICK, CAST) [6]. closest centroid.
k-means is one of the simplest unsupervised 4. Recomputed the centroid of each cluster Until the
learning algorithms that solve the well known centroid do not change.
clustering problem, in the procedure follows a simple
and easy way to classify a given data set through a III. Result Analysis of K-Means Technique
certain number of clusters (assume k clusters) fixed k-means techniques is one of the simplest
apriority. There are main idea is to define k centre’s, unsupervised learning algorithms that solve the
one for each cluster. These centers should be placed in well known clustering problem. We consider five
a cunning way because of different location causes access points of K-means
means technique for 150, 50 and
different result. So results, the better choice is to place 100 Nodes as shown in Figure 3, Figure 4, and Figure
them as much as possible far away from each other. 5, respectively.
For the next step is to take each point belonging to
a given data set and associate it to the nearest centre.
When no point is pending, the first step is completed
and an early group age is done.

After we have these k new cancroids, a new binding

has to be done between the same data set
points and the nearest new centre. A loop has been
generated. As a result of this loop we may notice
that the k canters change their location step by step
until no more changes are done or in other words
canters do not move any more.

A. The process of k-means

means algorithm:
This part briefly describes the standard kk-means
algorithm. K-means
means is a typical clustering algorithm
in data mining and which is widely used for clustering
large set of data’s. Fig. 3: K-means
means clustering map for 150 Nodes

@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 6 | Sep-Oct

Oct 2018 Page: 1216
 International Journal of Trend in Scientific Research and Development (IJTSRD) ISSN: 2456-6470
2456
1000 50 Consumption in Wireless Sensor Network using
32
Different Clustering Techniques” IJSHRE, Vol.
900 43 12 34
8 39
9
23
2(1), 2014.
15 13
800 31 3. T. Mohana Priya, Dr. A.Saradh “An Improved K- K
36 40
700
21
26 29 6
means Cluster algorithm using Map Reduce
2
30
16 46 14 Techniques to mining of inter and intra cluster
600 10
24
27
datain Big Data analytics” International Journal of
4 20
500
33
11 Pure and Applied Mathematics, Volume 119 No.
48
28 7 2018, pp. 679-690.
400
25
19
7
17
4. Nidhi Singh, Divakar Singh “Performance
300 22 3 45 Evaluation of K-Means
Means and Heirarichal Clustering
47 37 18
38
200 44
in Terms of Accuracy and Running Time”
1
35
41 5 International
onal Journal of Computer Science and
100 Information Technologies, Vol. 3 (3) , 2012, pp.
49
0 42 4119-4121
0 100 200 300 400 500 600 700 800 900 1000
5. Dibya Jyoti Bora, Dr. Anil Kumar Gupta “Effect
Fig. 4: K-means
means clustering map for 50 Nodes of Different Distance Measures on the
Performance of K-Means Means Algorithm: An
1000 50 95 67 148 137 Experimental Study in Matlab” Dibya Jyoti Jy Bora
149
106 61 117 et al, / (IJCSIT) International Journal of Computer
900 112 74 6440 89 34
69 60
107 47
37 82126
Science and Information Technologies, Vol. 5 (2)
146 13872 84
800 39
133 105 , 2014, pp. 2501-2506.
104 6. Shaeela Ayesha, Tasleem Mustafa, Ahsan Raza
700 131 122 75 19
27 13633
139
28 110 100
76 20
93
26
142 68
94
7 147
119 125 45 Sattar & M.Inayat Khan, “Data Mining Model for
66
99 121
10 109 11 114 18
Higher Education System “,European
“,Europe Journal of
600 15 129 56
145 30 130 116 96 113
Scientific Research, ISSN 1450-216X
1450 Vol.43
500 132
85 29 83 140134 No.1 ,2010, pp.27.
51 87 22 32 23 59 1 86
103 128
81 73 7. Amrinder Kaur, “Simulation of Low Energy
400 124120 55 8897
6 123
24 54 101 108 143 17 127 Adaptive Clustering Hierarchy Protocol for
118 77 52
53 4
300 91
35 62
Wireless Sensor Network”, Volume 3, Issue 7,
42 115 38 6541 July 2013.
200 111 98
49 4878 46 80 14
135
63 8. Amitabh Basu , Jie Gao, Joseph S. B. Mitchell,
Mit
25 144 7971
31 57 141
100 8 21
44 36
Girishkumar Sabhnani , “Distributed localization
92 16 150 43
2
70 3
9 58 using noisy distance and angle information” 7th
0 102 90 12 5 13
0 100 200 300 400 500 600 700 800 900 1000 AC Minternational symposium on Mobile ad hoc
networking and computing, 2006,pp. 262 – 273.
Fig. 5: K-means
means clustering map for 150 Nodes 9. Rui Zhang, Myung J. Lee, Seong-Soon Joo,
“Mobile sink update local information through
IV. CONCLUSION these Aps”, 2008.
The K-means
means algorithm is a popular clustering 10. Shiv Prasad Kori, “Performance
Performance Comparison in
algorithm. Distance measure plays a important rule on Terms of Communication Overhead for Wireless
the performance of this algorithm. Also, we will try to Sensor Network Based on Clustering Technique”,
extend future this work for another partition clustering Volume 4, Issue 3, ISSN (Online): 2249–071X,
2249
algorithms like K-Medoids,
Medoids, CLARA and CLARANS. ISSN (Print): 2278–4209.
11. Labisha R. V, Baburaj E, “Energy Efficient
REFERENCES Clustering Algorithms in Wireless Sensor
1. Vibhav Kumar Sachan, Syed Akht Akhtar Imam Networks-An An Analytical View”, Volume9,
“Energy-efficient
efficient Communication Methods in Number3, May 2014.
Wireless Sensor Networks: A Critical Review” 12. E. Ekici , S. Vural, J. McNair, D. Al-Abri
Al “Secure
International Journal of Computer Applications probabilistic location verification in randomly
(0975 – 8887) Volume 39– No.17, February 2012. deployed wireless ss sensor networks “ Elsevier
2. Shweta Bhatele and Lalita Bargadiya “Evaluation Science Publishers B. V, 2006 ,pp.,195-209
,pp.,195
of Communication Overhead and Energy

@ IJTSRD | Available Online @ www.ijtsrd.com | Volume – 2 | Issue – 6 | Sep-Oct

Oct 2018 Page: 1217