2018 15th International Multi-Conference on Systems, Signals &Amp; Devices (SSD) 2018
DOI: 10.1109/ssd.2018.8570654
|View full text |Cite
|
Sign up to set email alerts
|

An Optimal Clustering Mechanism Based on K-Means 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

2019
2019
2022
2022

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 2 publications
0
1
0
Order By: Relevance
“…This protocol solved the problem of energy hole, coverage hole, and balanced the network energy consumption. In addition to the above methods, there are many other similar intelligent methods [45,46,47,48,49], such as distributed artificial ANT colony algorithm, circular random firefly algorithm, particle swarm optimization algorithm, and so on. However, at present, the intelligent methods in WBAN is limited [50,51,52,53,54], and there is a lot of space for research in the future.…”
Section: Prospects For Wban and Suggestions For Routing Designmentioning
confidence: 99%
“…This protocol solved the problem of energy hole, coverage hole, and balanced the network energy consumption. In addition to the above methods, there are many other similar intelligent methods [45,46,47,48,49], such as distributed artificial ANT colony algorithm, circular random firefly algorithm, particle swarm optimization algorithm, and so on. However, at present, the intelligent methods in WBAN is limited [50,51,52,53,54], and there is a lot of space for research in the future.…”
Section: Prospects For Wban and Suggestions For Routing Designmentioning
confidence: 99%