IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v13y2017i5p1550147717706681.html
   My bibliography  Save this article

Bluetooth positioning based on weighted K-nearest neighbors and adaptive bandwidth mean shift

Author

Listed:
  • Qi Wang
  • Rui Sun
  • Xiangde Zhang
  • Yanrui Sun
  • Xiaojun Lu

Abstract

Bluetooth positioning is an important and challenging topic in indoor positioning. Although a lot of algorithms have been proposed for this problem, it is still not solved perfectly because of the instable signal strengths of Bluetooth. To improve the performance of Bluetooth positioning, this article proposes a coarse-to-fine positioning method based on weighted K-nearest neighbors and adaptive bandwidth mean shift. The method first employs weighted K-nearest neighbors to generate multi-candidate locations. Then, the testing position is obtained by applying adaptive bandwidth mean shift to the multi-candidate locations, which is used to search for the maximum density of the candidate locations. Experimental result indicates that the proposed method improves the performance of Bluetooth positioning.

Suggested Citation

  • Qi Wang & Rui Sun & Xiangde Zhang & Yanrui Sun & Xiaojun Lu, 2017. "Bluetooth positioning based on weighted K-nearest neighbors and adaptive bandwidth mean shift," International Journal of Distributed Sensor Networks, , vol. 13(5), pages 15501477177, May.
    • Handle: RePEc:sae:intdis:v:13:y:2017:i:5:p:1550147717706681
    DOI: 10.1177/1550147717706681
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147717706681
    Download Restriction: no
    File URL: https://libkey.io/10.1177/1550147717706681?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:sae:intdis:v:13:y:2017:i:5:p:1550147717706681. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: SAGE Publications (email available below). General contact details of provider: .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.