2012 Fourth International Conference on Computational Intelligence and Communication Networks 2012
DOI: 10.1109/cicn.2012.136
|View full text |Cite
|
Sign up to set email alerts
|

K-Means Clustering in Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
94
0
4

Year Published

2014
2014
2022
2022

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 153 publications
(98 citation statements)
references
References 11 publications
0
94
0
4
Order By: Relevance
“…A Turing pattern is formed through reaction-diffusion equations (Eqs. (12) and (13)). Each node in the network contains two factors, activator a and inhibitor h, and these values change over time according to the following differential equations:…”
Section: Bio-inspired Methods Based On Reaction-diffusion Equationsmentioning
confidence: 99%
“…A Turing pattern is formed through reaction-diffusion equations (Eqs. (12) and (13)). Each node in the network contains two factors, activator a and inhibitor h, and these values change over time according to the following differential equations:…”
Section: Bio-inspired Methods Based On Reaction-diffusion Equationsmentioning
confidence: 99%
“…Depending on the number of members present in every cluster, every member will get a TDMA slot at regular interval as shown in Figure 2. In [7] authors have proposed …”
Section: Related Workmentioning
confidence: 99%
“…Many clustering algorithms have also been proposed in the past in various contexts. In kmean clustering algorithm [7], authors proposed two types of clustering: Centralized k-mean clustering and Distributed k-mean clustering. These algorithms use Euclidian distances and energies for choosing cluster head.…”
Section: Related Workmentioning
confidence: 99%