2018
DOI: 10.1049/iet-com.2017.0515
|View full text |Cite
|
Sign up to set email alerts
|

Optimal weighted K‐nearest neighbour algorithm for wireless sensor network fingerprint localisation in noisy environment

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
28
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 42 publications
(28 citation statements)
references
References 32 publications
0
28
0
Order By: Relevance
“…Since the accuracy of KNN-based algorithm using Euclidean distance is not high enough due to the ignorance of statistical regularities from the training set, an improved method combining the Manhattan distance with the WKNN algorithm was proposed to distinguish the influence of different reference nodes [23]. To obtain the optimized node location estimate, Fang et al [24] proposed an optimal WKNN (OWKNN) algorithm for wireless sensor network (WSN) fingerprint localization in a noisy environment. In order to eliminate incorrect neighboring reference points and to avoid selected reference points located only on one side of the test point, an improved neighboring reference points selection method [25] was proposed based on their physical distances to the test point, instead of the widely used positions of the reference points.…”
Section: Related Workmentioning
confidence: 99%
“…Since the accuracy of KNN-based algorithm using Euclidean distance is not high enough due to the ignorance of statistical regularities from the training set, an improved method combining the Manhattan distance with the WKNN algorithm was proposed to distinguish the influence of different reference nodes [23]. To obtain the optimized node location estimate, Fang et al [24] proposed an optimal WKNN (OWKNN) algorithm for wireless sensor network (WSN) fingerprint localization in a noisy environment. In order to eliminate incorrect neighboring reference points and to avoid selected reference points located only on one side of the test point, an improved neighboring reference points selection method [25] was proposed based on their physical distances to the test point, instead of the widely used positions of the reference points.…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, if there is a large deviation in distance estimation, the positioning error will be large. A fingerprint database positioning algorithm has been constructed to improve the positioning accuracy in the document [23][24][25] by collecting the positioning samples in advance. The positioning algorithm highly relies on the fingerprint database data, if the environment changes, the positioning accuracy will become poor.…”
Section: The Target Node Positioning Algorithmmentioning
confidence: 99%
“…Aiming at the low efficiency of fingerprint matching, an improved algorithm built on the Nearest Neighbor (NN) method is proposed, and a strategy of data classification is proposed based on the weighted K Nearest Neighbor (KNN) method [13], [14]. The improved algorithm effectively improves the matching efficiency of position fingerprint and also improves the indoor positioning accuracy [15]. Radiofrequency fingerprint database is established by partitioning a distinctive indoor space and measuring the wireless signal intensity of each point.…”
Section: Introductionmentioning
confidence: 99%