2020
DOI: 10.1016/j.cosrev.2020.100284
|View full text |Cite
|
Sign up to set email alerts
|

Improved node localization using K-means clustering for Wireless Sensor Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
28
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
9

Relationship

0
9

Authors

Journals

citations
Cited by 69 publications
(28 citation statements)
references
References 8 publications
0
28
0
Order By: Relevance
“…Thus, here in this process the complete network consumes energy and for multiple rounds of simulation the nodes gradually start dying because of not enough energy to transmit the data packet. Comparing the obtained performance with existing techniques such as LEACH (Lowenergy adaptive clustering hierarchy), O-LEAC H(Optimization Low Energy Adaptive Clustering Hierarchy), Bee Cluster, and OK-Means (Optimal Kmeans) as mentioned in [37].…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Thus, here in this process the complete network consumes energy and for multiple rounds of simulation the nodes gradually start dying because of not enough energy to transmit the data packet. Comparing the obtained performance with existing techniques such as LEACH (Lowenergy adaptive clustering hierarchy), O-LEAC H(Optimization Low Energy Adaptive Clustering Hierarchy), Bee Cluster, and OK-Means (Optimal Kmeans) as mentioned in [37].…”
Section: Resultsmentioning
confidence: 99%
“…Salim El Khediri et al [37] presented K-means algorithm to deal with energy consumption related issues in WSN and improving the network lifetime. This is achieved by incorporating a sample space partition in k-means.…”
Section: Clustering and Cluster Head Selectionmentioning
confidence: 99%
“…To tackle localization difficulties because of pairwise distance measurements, several centralized techniques have been developed. Author [13] used convex optimization and semi-definite programming to solve the localization problem. The network's interconnection is represented in the optimization problem by using convex localization constraints.…”
Section: Literature Reviewmentioning
confidence: 99%
“…In CDAS (Devi et al, 2020), latency and packet loss reduction lessen the overhead and end-to-end delay while improving energy utilization and network lifetime. In (Khediri et al, 2020), intra-cluster communication employs single hop; in contrast, inter-cluster communication manages multi-hop communication mode and achieves energy utilization. Although the network lifetime is the most significant concern (Han et al, 2020), offline parameter optimization has a high-level complexity, creates computational overhead, and does not concern multi-hop communication.…”
Section: Related Workmentioning
confidence: 99%