Research on a Fast Matching Method of K Nearest Neighbor for WiFi Fingerprint Location
Aiming at the problem of low speed and positioning fluctuations of indoor WiFi fingerprints. Firstly, we use the method of Gauss fitting and averaging to acquire the average value of the received signal. Secondly, we use a distance to be similarity measure to define a threshold to classify the fingerprint database. Finally, By improving the K nearest neighbor algorithm and on the basis of classification, Implement fast matching of K nearest neighbor. The experimental results show that the time efficiency of the classified location system has been greatly improved, with an average decrease of 62.8%; In the positioning accuracy, WiFi fingerprint positioning of the average error from 4.17 m down to 2.12 m.
KeywordsGaussian fitting Multiple measurements for averaging Database classification Fast matching of K nearest neighbor
- 5.K. Pahlavan, X. Li, J.P. Makela, Indoor geolocation science and technology. IEEE Commun. Mag. (IEEE Press) 40(2), 112–118 (2002)Google Scholar
- 6.A. Kushki, K.N. Plataniotis, A.N. Venetsanopoulos, Kernel-based positioning in wireless local area networks. IEEE Trans. Mobile Comput. 6(6), 689–705 (2007)Google Scholar