Similarity-Based K-Nearest Neighborhood Location Algorithm
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    The positioning system based on WIFI location fingerprint can achieve high precision indoor location. The neighbor selection algorithm based on Received Signal Strength Indicator (RSSI) is easy to introduce singular points when locating indoors, which leads to the decrease of positioning accuracy. To solve this problem, this paper proposes a Similarity-based K-Nearest Neighborhood Location Algorithm (SKNN). Referring to the idea used to solve the problem of similarity of nodes in bipartite networks, this algorithm builds a bipartite network between the location fingerprint and the AP. It proposes a similarity parameter which can be used to modify the K-Nearest Neighborhood localization algorithm. The experimental results show that the SKNN algorithm proposed in this paper can effectively reduce the influence of singular points on the positioning results and improve the positioning accuracy, with 80% of the positioning errors within 2m, and the effect is obvious in the large scene.

    Reference
    Related
    Cited by
Get Citation

马文丽,李世宝,张志刚,杨喜鹏,王升志,张鑫.基于相似度的K阶临近定位算法.计算机系统应用,2017,26(9):165-169

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 29,2016
  • Revised:
  • Adopted:
  • Online: October 31,2017
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063