An Indoor Positioning Method Based on RSSI Probability Distribution
Shipeng Li, Xinyu Yang, Rui Qi Zhao, Yuqing Liu, Xue Mei Zhou, Libiao Zhang
Abstract
Open-access reader
Shipeng Li, Xinyu Yang, Rui Qi Zhao, Yuqing Liu, Xue Mei Zhou, Libiao Zhang
Abstract
Open-access reader
In view of the influence of the time-variation of RSSI on the positioning accuracy in Wi-Fi indoor positioning, this paper proposes to use the probability distribution of RSSI value as a fingerprint feature over a period of time, and combines the dimension reduction algorithm and the weighted K nearest neighbor algorithm to achieve positioning. The method firstly calculates the probability distribution of the received RSSI value, uses the dimensionality reduction algorithm to reduce the dimension of the statistical probability distribution.The K-reference points with the smallest Euclidean distance were combined with the weighted nearest neighbor algorithm to obtain the positioning results. Through simulation experiments, it is shown that the positioning accuracy is higher than the traditional method, and the positioning time is significantly reduced.
OpenAlex reports 7 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In view of the influence of the time-variation of RSSI on the positioning accuracy in Wi-Fi indoor positioning, this paper proposes to use the probability distribution of RSSI value as a fingerprint feature over a period of time, and combines the dimension reduction algorithm and the weighted K nearest neighbor algorithm to achieve positioning. The method firstly calculates the probability distribution of the received RSSI value, uses the dimensionality reduction algorithm to reduce the dimension of the statistical probability distribution.The K-reference points with the smallest Euclidean distance were combined with the weighted nearest neighbor algorithm to obtain the positioning results. Through simulation experiments, it is shown that the positioning accuracy is higher than the traditional method, and the positioning time is significantly reduced.
Key concepts: Euclidean distance, Dimensionality reduction, k-nearest neighbors algorithm, Computer science, Dimension (graph theory), Fingerprint (computing), Probability distribution, Curse of dimensionality