A WiFi Indoor Location Tracking Algorithm Based On Improved Weighted K Nearest Neighbors and Kalman Filter
A WiFi Indoor Location Tracking Algorithm Based On Improved Weighted K Nearest Neighbors and Kalman Filter
Received 9 March 2023, accepted 28 March 2023, date of publication 31 March 2023, date of current version 5 April 2023.
Digital Object Identifier 10.1109/ACCESS.2023.3263583
ABSTRACT The weighted K -nearest neighbors (WKNN) algorithm is a widely adopted lightweight
methodology for indoor WiFi positioning based on location fingerprinting. Nonetheless, it suffers from the
disadvantage of a fixed K value and susceptibility to incorrect reference point matching. To address this issue,
we present a novel algorithm in this paper, referred to as static continuous statistical characteristics-soft range
limited-self-adaptive WKNN (SCSC-SRL-SAWKNN). Our algorithm not only takes into account location
tracking in the motion state but also exploits the continuous statistical features of extended periods of inac-
tivity to enhance localization. In the motion state, we initially employ the self-adaptive WKNN (SAWKNN)
algorithm to determine the optimal K value, followed by the employment of the soft range limited KNN
(SRL-KNN) algorithm to identify the correct reference point and ultimately estimate the position. When a
prolonged stationary state is detected, we first utilize the moving window method to obtain a more stable
position fingerprint, and then proceed with the positioning process in the same motion state. Ultimately,
we use Kalman filter to generate the location trajectory. Our experimental findings demonstrate that the
proposed SCSC-SRL-SAWKNN algorithm outperforms traditional WKNN, SAWKNN, and SRL-KNN
techniques in terms of localization accuracy and location trajectory. Specifically, the localization accuracy
of our algorithm is 56.7% and 36.6% higher than that of traditional WKNN in the static state and overall
situation, respectively.
Terminal equipment can be located using indoor wire- A. THE LONG-TERM STATIC CASE IS NOT SPECIFICALLY
less network signals. As an illustration, the location CONSIDERED
fingerprint-based method can be considered. Indoor wireless In practical situations, the existence of multipath effects and
networks typically consist of several access points (APs), channel fading leads to variations in RSSIs collected by
each emitting a wireless signal covering a particular area. The terminal devices, even during successive time intervals while
transmission power of an access point (AP) is theoretically situated in the same location. Regrettably, the long-term static
fixed, so the signal strength in a particular area is theoreti- state that is vital for fingerprint stability is often ignored in
cally consistent. The mobile device can determine its loca- the present-day WiFi-based indoor positioning methodology.
tion by evaluating the signal strength received from the AP. Therefore, improving the stability of the fingerprint in the
This fingerprint-based localization method exhibits great static state is often overlooked.
potential [6]. Euclidean distance [7], [8] and Manhattan
distance [9], [10] are commonly employed in localization B. SETTING OF K VALUE: DIFFERENT K VALUE MEANS
methods based on location fingerprints. Time of arrival- MATCHING DIFFERENT NUMBERS OF PRS
based methods [11] and angle of arrival-based methods [12] This will result in different positioning accuracy. Further-
are also available for WiFi indoor positioning, but these more, the optimal value of K for achieving the highest degree
require additional hardware, which is absent in most mobile of accuracy varies according to differences in the indoor and
terminals, and as a result, have not gained significant network environmental conditions.
attention.
Enhancing the accuracy of WiFi positioning, which C. PHYSICAL DISTANCE DOES NOT MATCH FINGERPRINT
remains relatively low, poses the greatest challenge. The SIMILARITY
location-based fingerprint method in WiFi positioning is Some location fingerprints that are physically distant may
categorized into three groups: deterministic methods [13], bear resemblance to those which are physically closer. The
probabilistic methods [14], and deep learning methods [15]. WKNN algorithm may therefore be misled, leading to a
Despite their unparalleled accuracy, deep learning methods relatively significant error.
are inherently complex, requiring significant computational The challenge of setting the K value has been addressed
resources. Conversely, deterministic methods are comparable by the proposed self-adaptive weight K -nearest neighbors
to probabilistic methods in terms of performance but offer (SAWKNN) algorithm [17]. The issue of physical dis-
the added benefit of reduced complexity, rendering them a tance not matching fingerprint similarity is tackled by
favored choice among researchers. the soft range limited K -nearest neighbors (SRL-KNN)
Deterministic methods achieve localization by calculating algorithm [18]. To overcome these challenges, this paper
the similarity of fingerprints between the online and offline proposes a localization algorithm based on the static
phases. In the offline phase, the task involves constructing a continuous statistical characteristics of fingerprint signals.
fingerprint database comprising the received signal strength The proposed algorithm, named static continuous statisti-
index (RSSI) gathered by the mobile terminal at each ref- cal characteristics-soft range limited-self-adaptive WKNN
erence points (RPs). During the online phase, the collected (SCSC-SRL-SAWKNN), retains the recent location infor-
location fingerprints are matched with those in the offline mation of the user and combines SAWKNN and SRL-KNN
phase. The positioning algorithm is then utilized to determine algorithms to achieve the best positioning accuracy in differ-
the positioning. However, in the actual environment, RSSI ent localization states. This algorithm sets itself apart from
is influenced by various factors, such as object movement, its counterparts through its distinctive approach. It discerns
changes in electromagnetic waves, variations in antenna between the stationary and moving states in the user position-
directivity, and radio frequency interference. Therefore, it is ing process, and handles them separately. In the static state,
highly probable that the offline database may not contain the algorithm employs the concept of a moving window to
the location fingerprint corresponding to the online stage. first process the fingerprint signal. Then, the cumulative mean
In this scenario, the RPs with the highest location fingerprint of the signal is used to enhance the stability of RSSI. Finally,
similarity between the online phase and the offline database in conjunction with SAWKNN, the positioning is completed.
is used as a candidate point. The mobile terminal is subse- On the other hand, in the moving state, the soft range limit
quently positioned at the center of the K candidate points. is used to resolve the issue of physical distance not matching
This approach is known as the K -nearest neighbors (KNN) fingerprint similarity. The SAWKNN algorithm is combined
positioning method. On this basis, weights corresponding with the soft range limit to complete the positioning. The pro-
to the candidate points are added, which further improves posed SCSC-SRL-SAWKNN algorithm in this paper retains
the positioning accuracy [16]. This is a prevalent algorithm the qualities of different localization states, and processes
known as the weighted K -nearest neighbors (WKNN). them separately based on their respective characteristics. The
The WKNN algorithm has been the subject of numerous algorithm is capable of achieving optimal positioning accu-
discussions in the academic literature. However, it continues racy in different positioning states, and it doesn’t require
to confront a series of daunting challenges, including the prior knowledge. As a result, there is no need to deploy any
following: additional hardware. Numerous experimental results attest
that the accuracy of the proposed algorithm surpasses that physical distance and fingerprint similarity is ignored, which
of traditional WKNN and the optimized SAWKNN and can result in large positioning errors if the wrong candidate
SRL-KNN algorithms under both static and dynamic con- RPs is chosen.
ditions. As compared to the traditional WKNN, the overall Additionally, a method exists [30] that records the user’s
positioning accuracy has been improved by 36.6%. Moreover, latest location information to determine their speed and direc-
being a lightweight algorithm, it can enable real-time posi- tion, enabling prediction of their next location. However,
tioning while consuming minimal system resources. if the user is moving slowly or in an irregular pattern, the pre-
The remainder of this paper shall be arranged in the fol- diction error may be significant. Studies have also explored
lowing manner: Section II will introduce related research. the mismatch between distance and fingerprint similarity,
Section III shall expound upon the indoor positioning sys- wherein a location fingerprint at a greater physical distance
tem and discuss pertinent optimization issues. In Section IV, may exhibit significant similarity to the fingerprint of the
the SCSC-SRL-SAWKNN algorithm shall be presented. current location, leading to a large positioning error for that
Section V will furnish a comprehensive assessment via an location. The SRL-KNN method proposed in [18] centers the
ample array of real-world experiments. Finally, in Section VI, circle on the user’s previous position and sets the radius as a
we will conclude the paper and outline potential areas of range factor based on the actual movement situation to limit
future research. the range. This solution addresses the issue of physical dis-
tance not matching fingerprint similarity during positioning,
II. RELATE WORK although it does not consider the static positioning scenario.
Over the past decade, there has been a staggering surge in Additionally, the signal trend index (STI) has been used in
the proliferation of mobile terminals. Consequently, various some studies to compare the vector shape of the RSSI of the
indoor positioning systems have been extensively studied. mobile terminal device during the online phase with that of
These systems can broadly be classified into two categories the offline database. The signal trend exponential weighted
based on hardware deployment. The first category includes K -nearest neighbor (STI-WKNN) algorithm [31] has been
infrared [19], ultrasonic [20], Bluetooth [2], Ultra Wide Band proposed as a solution with better performance targeting
(UWB) [21], Radio Frequency Identification (RFID) [22], heterogeneous devices.
which can provide high positioning accuracy but require In recent years, the field of deep learning has made
additional specialized hardware deployment. The second cat- remarkable progress, leading to the emergence of a plethora
egory includes positioning technologies such as WiFi [23] of indoor localization techniques employing deep learning
and geomagnetic field [24], where users can rely on existing methods [15], [32], [33], [34]. Indoor localization can be
wireless networks to enable location functionality with the accomplished by means of probability estimation, which
added advantage of lower costs. The research presented in sets it apart from deterministic techniques such as WKNN.
this paper pertains to the second category of methods. Among Recent breakthroughs [35], [36], [37] have yielded compara-
these, fingerprint-based localization methods are the most ble localization accuracy as deterministic methods but at the
common. expense of higher computational complexity. Deep learning
In the realm of WiFi positioning, distance-based methods technology, while undoubtedly possessing exceptional accu-
have also been utilized [25], [26]. However, deploying addi- racy, is unfortunately accompanied by the highest degree of
tional hardware and prior knowledge of the location of each complexity, leading to a significant requirement for hardware
AP are required for these methods. As such, their practical resources that pose a challenge to its widespread adoption for
application is limited and they are often not prioritized in most real-time positioning.
situations.
The method most commonly used for location-based fin- III. INDOOR POSITIONING SYSTEM
gerprinting is the KNN algorithm proposed by RANDA [27]. In this section, we shall undertake a systematic analysis of the
An optimization algorithm based on KNN was proposed three primary issues with the WKNN algorithm. These issues
in [28]. In addition, the weighted KNN (WKNN) algorithm include a lack of specific considerations for static situations,
was proposed in [29], which slightly improves the position- problems with setting the K value, and a mismatch between
ing accuracy compared to the KNN algorithm through the physical distance and fingerprint similarity. Firstly, we shall
addition of weights. However, determining the optimal K provide an overview of the system configuration, followed
value has always been a challenging problem, and a fixed by an explanation of how each of these three problems can
experience value is typically used. The optimal K value significantly affect the accuracy of indoor positioning.
changes with the environment, and thus cannot be obtained
using traditional WKNN. To address this issue and ensure the A. SYSTEM CONFIGURATION
best K value is obtained for each positioning, the SAWKNN Fig. 1 depicts the comprehensive block diagram of the WiFi
algorithm was proposed in [17]. It enables adaptive adjust- indoor positioning system. The system is comprised of two
ment of the K value through the fingerprint similarity thresh- stages: the offline stage and the online stage. The prime objec-
old, resulting in improved localization accuracy compared tive of the offline stage is to accomplish the establishment of
to WKNN. However, the problem of mismatch between the offline location fingerprint database. The online stage is
B. OBSERVATION
We carry out three sets of experiments using the collected
fingerprint data with the aim of demonstrating three issues
concerning the conventional WKNN positioning algorithm.
FIGURE 3. The RSS values over time using same devices from the diverse
AP and at the fixed location.
vector where only one element is 1 and all other elements As illustrated in Fig. 6, the signal processing method based
are set to 0. This indicates that only one corresponding AP on moving window in static state is divided into two steps.
is chosen in pi . Due to the variability in the number of APs In the first step, during the k + L − 1th signal acquisition
that can be detected at different RPs, it is advisable to set the in the online stage, the position fingerprint of the ith AP
K value to be lower than the total number of available APs. collected between the kth time and the k + L − 1th time is
After computing the difr,j for the rth TP and all RPs using used as the old window. The earliest received test signal in
formula (3), WKNN selects the K RPs with the smallest this window r⃗ssi,k is discarded. In the second step, during the
difference in fingerprint similarity for position estimation: k + L th signal acquisition in the online phase, we process the
PK newly obtained r⃗ssi,k+L signal through equation (7) to obtain
ωl LOC(xl , yl ) ⃗ i,k+L . Then add it to the excessive state and get the new
Rss
LOC ′ (xr , yr ) = l=1 PK (5)
l=1 ωl window. The Rss⃗ i,k+L is the average of the sum of r⃗ss of the
ith AP from r⃗ssi,k to r⃗ssi,k+L :
In the formula, LOC ′ (xr , yr ) represents the estimated posi- Pk+L
tion after performing the positioning algorithm. The position rss
⃗ i,k+L = P n=k+1 i,n
Rss (7)
of the lth RP among the K candidate points is denoted by k+L
n=k+1 Num(n)i
LOC(xl , yl ). The weight of the lth position is represented by
ωth , which is determined by 1/difr,j . A weighted strategy Next, we proceed with a further update of Rss ⃗ i,k+L using
was suggested in [29], which yielded a slight improvement formula (8) to obtain a more refined and smoother signal. The
in accuracy compared to the KNN algorithm. formula is defined as follows:
( k+L ⃗
P
⃗ i,k+L = n=k+1 rssi,n ) + Rssi,k+L
B. STATIC SITUATION OF ONLINE POSITIONING RSS (8)
L
In this section, we present a method to enhance the stabil-
ity of WiFi location fingerprints in stationary states during ⃗ i,k+L is the RSSI information of ith access point
The RSS
the online localization phase. First, we distinguish between after the k + L th signal acquisition is refined using the mov-
stationary and moving states in the positioning process and ing window. This refined information is then used to replace
process them separately. Then, we apply specific techniques the original signal r⃗ssi,k+L , signifying the completion of the
to handle the RSSI values in the stationary state. signal processing task. To further solidify the stability of
In the second section, we analyzed the fluctuations in RSSI, the cumulative average method is employed based on
signal strength when the device is in a stationary state. the moving window signal processing approach. The steps
To improve the stability of the RSSI in static conditions, involved in this method can be summarized as follows:
( ns=1 r⃗ssi,s )
P
we first determine the state of static based on the condition 1
⃗ i,k+L
RSS = (9)
that the number of consecutive single-point acquisitions is cnt
greater than L. Then we analyze the statistical properties of The r⃗ssi,s represents the location fingerprint of the ith AP’s
the RSSI in the static state to improve positioning accuracy RSSI that has undergone static processing and was collected
by addressing the issue of signal fluctuation and obtaining a at the sth online stage. The variable cnt represents the number
stable fingerprint signal. To achieve this, we preprocess the of signal acquisitions in the current static state. In this par-
RSSI using a moving window approach when the condition ticular scenario, we focus on the AP corresponding to Fig. 3.
in equation (6) is met. To obtain the RSSI data, 100 static signal acquisitions were
Pk+L−1
Num(n)i performed, and the parameter L was set to 10. The resulting
n=k
>σ (6) RSSI data after undergoing SCSC processing is depicted
L
in Fig. 7.
In this case, Num(n)i denotes the validity of the ith AP
signal when the nth signal is collected. Any signal that is
recorded as -100 dB during the signal collection process is
considered invalid. We define σ be the threshold for signal
validity, where signals exceeding the threshold are considered
valid.
the implementation of SCSC processing. As the number of The similarity between two pairs of dif is represented by γ .
acquisitions increases, the stability of the location fingerprint The threshold of fingerprint similarity, γt h, can be determined
will also improve. Thus, by strategically utilizing the static through experimentation. Using this threshold, we can filter
conditions in the positioning process, we can obtain more sta- out the number of RPs that meet the required conditions,
bility location fingerprints, leading to enhanced positioning thus establishing the value of K . The positioning can then be
accuracy. achieved using formula (5). In Algorithm 1, the maximum K
value that can be obtained through experimentation is denoted
C. K VALUE SETTING AND PHYSICAL DISTANCE DO NOT by Kmax .
CORRESPOND TO FINGERPRINT SIMILARITY
In this subsection, we will briefly discuss the solutions to Algorithm 1 The Pseudo-Code for Obtaining the K
two problems: setting the K value and addressing the mis- Value
match between physical distance and location fingerprint 1 for j = 2 : Kmax + 1 do
similarity. The setting of the K value is described in detail 2 if difr,other difr,j1 − 1 > γth then
in SAWKNN [17]. Interested readers can refer to the original 3 break;
source for more information. Here is a brief overview of how 4 end
the K value is dynamically obtained. Firstly, the classical path 5 end
loss model for radio signals is used: 6 K = j − 1;
d 7 return K ;
P(d)[dBm] = P(d0 )[dBm] − 10n log[ ]+ω (10)
d0
The path loss coefficient is denoted by n, and the RSSI Clearly, the K value is subject to dynamic changes based
measured at distances d and d0 from the AP are represented on the fingerprint similarity between the online and offline
by P(d) and P(d0 ), respectively. Here, d0 serves as the refer- stages. Therefore, the K value can be adjusted adaptively and
ence distance and is based on 1 m. In addition, ω represents utilized flexibly within the WKNN algorithm. This leads to
the ambient noise. Typically, the value of P(d) in the same the automatic determination of the optimal K value.
area is largely dependent on the distance d. The location Aiming to address the issue of discrepancy between phys-
fingerprint similarity difference dif(r,j) between the RP and ical distance and fingerprint similarity in the positioning
the TP in formula (3) is likely to be consistent with dr,j to a process, we have referenced the soft range limiting concept
large extent. of SRL-KNN [18]. Here, we provide a brief overview. The
1) IF difA,O < difD,O THEN dAO < dDO , fundamental concept is that there is a limit to the velocity at
2) IF difA,O ≈ difD,O THEN dAO ≈ dDO , which a person or object can move during localization. It is
3) IF difA1 ,O ≈ difA2 ,O ≈ difA3 ,O · · · < difD,O THEN implausible for objects to suddenly emerge beyond a particu-
dA1 O ≈ dA2 O ≈ dA3 O · · · < dDO . lar range in the ongoing online positioning process. A circle
According to the three properties mentioned above, the is drawn with the location of the previous moment as the
RPs with the smallest difr,j between the location fingerprint center and d⃗ as the radius. The positioning space is restricted
of the offline stage and the location fingerprint of the online within this circle. d⃗ is determined by the individual’s or
stage is more likely to be close to the TP. Therefore, the object’s movement velocity and positioning frequency during
positioning problem can be transformed into finding the RPs localization. With soft range restriction, the position near the
fingerprints that are most similar to the TP fingerprints. previous moment is more likely to be chosen as the candidate
WKNN selects K RPs with the highest similarity to the TP position for localization results. However, unlike [18], where
fingerprints as candidate points. However, the number of the Euclidean distance expression is transformed, we trans-
RPs with high similarity location fingerprints varies under form the expression for the Manhattan distance.
different TPs, especially in cases where K is 1 or 2, which j
Wr + Dr
j
are more easily ignored. Hence, the approach of dynami- ⃗ jr = P
D (12)
s j
cally acquiring the optimal K value can be implemented to i=1 Wr
enhance the accuracy of the positioning system. The issue of (xr − xpre )2 + (yr − ypre )2
Wrj = exp (13)
setting the K value can be transformed into determining the 4d⃗ 2
number of RPS fingerprints that exhibit high similarity to TP j
fingerprints. Suppose that difr,j1 represents the smallest dif , The function Wr represents the penalty imposed on posi-
then the correlation between difr,j1 and the dissimilarity in tion r. The variable s denotes the number of RPs in the offline
fingerprint similarity values of other locations is established database, and (xpre , ypre ) represents the user’s previous posi-
as follows: tion. The maximum distance the user can move between two
consecutive positioning events is defined as d. ⃗ Typically, the
γ = difr,other difr,j1 − 1
walking speed of a person is within 2 m/s, and the maximum
difr,j1 < difr,other , γ > γth (11) movement speed can be set according to the actual situation.
difr,j1 ≈ difr,other , γ ⩽ γth
It is unnecessary to know the specific movement speed and
direction of the user. With this approach, the problem of mis- algorithms in different states. Finally, we will delve into the
match between physical distance and fingerprint similarity application development of location tracking. For the tradi-
can be effectively addressed. tional WKNN and SRL-KNN algorithms, we have set K to
an empirical value of 3. The computer utilized to provide
D. PROPOSED SCSC-SRL-SAWKNN METHOD location services was equipped with an Intel(R) Core(TM)
In this subsection, we shall consolidate the information from i5-4200H CPU and 12 GB of RAM.
sections IV-A, IV-B, and IV-C to provide a comprehensive
overview of the SCSC-SRL-SAWKNN algorithm. A. THE EFFECT OF MOVING WINDOW SIGNAL
PROCESSING
Firstly, we will analyze the impact of key parameters under
static conditions on the performance of the moving window
processing method. As discussed in section IV, the crucial
parameters of this method are denoted by L and σ . Our aim
is to identify the optimal parameter values that would result
in the highest positioning accuracy. Subsequently, we will
evaluate the impact of the moving window signal processing
method on the localization accuracy in the real environment
using these values.
Fig. 2 depicts the real experimental environment that has
been constructed, wherein the blue pentagrams denote RPs
with a total of 155 RPs. The trajectory and direction of
motion in the online phase are represented by the green lines,
FIGURE 8. Outline of the SCSC-SRL-SAWKNN method. with a movement speed of approximately 0.5 m/s. The signal
acquisition frequency has been set to 1 Hz. At each static
Fig. 8 illustrates the flow of the SCSC-SRL-SAWKNN continuous collection point represented by the red pentagram,
algorithm. The localization problem is to find offline fin- we collected 100 fingerprint signals continuously, with an
gerprints that closely match the fingerprints collected during acquisition frequency of 1 Hz. The entire experiment was
the online phase. When a user requests their location, the conducted during a bustling time period with many teachers
mobile terminal collects location fingerprints and processes and students present in the experimental environment. Addi-
different motion states separately. In the case of a static state, tionally, the state of indoor doors and windows opening and
a moving window signal processing method is applied to closing was continuously changing. In order to maintain the
improve the stability of the location fingerprint in the online authenticity of the experiment, all algorithms have utilized
phase, followed by the method of mean accumulation to the real-time collected RSSI as the original fingerprint.
obtain robust online fingerprints. The calculation of the loca-
tion fingerprint similarity difference between the online and 1) SETTING OF L
offline stages is then completed, and an adaptive algorithm Fig. 9 depicts the error pattern of static continuous statistical
is used to calculate the K value and estimate the position. characteristics weight K -nearest neighbor (SCSC-WKNN)
If the user is in a moving state, the signal processing steps are algorithm in a static state when employing different values of
omitted, and the fingerprint similarity difference is directly parameter L. It is discernible that the error curve of the posi-
computed to obtain the K value through Algorithm 1. The tioning accuracy fluctuates considerably when L is within
Manhattan distance in the fingerprint similarity expression the range of [2, 30]. Nonetheless, it is evident that the best
is then transformed using the penalty function of the range positioning accuracy is attained when L is equal to 4. As such,
factor, and the final modified K RPs is used for position the value of L is set to 4.
estimation.
V. EXPERIMENTS
In this section, we will assess the performance of the
proposed SCSC-SRL-SAWKNN algorithm through actual
experiments. Firstly, we will analyze the influence of several
crucial parameters, including L, σ , γrh and Kmax , under vari-
ous scenarios. Secondly, we will compare the performance of
the WKNN algorithm before and after applying the moving
window signal processing method to stabilize the position
fingerprints during the online positioning process in static
states. Then, we will compare the localization accuracies of
WKNN, SAWKNN, SRL-KNN, and SCSC-SRL-SAWKNN FIGURE 9. Position results of SCSC-WKNN under different L.
[2] L. Bai, F. Ciravegna, R. Bond, and M. Mulvenna, ‘‘A low cost indoor [24] M. Sun, Y. Wang, S. Xu, H. Yang, and K. Zhang, ‘‘Indoor geomagnetic
positioning system using Bluetooth low energy,’’ IEEE Access, vol. 8, positioning using the enhanced genetic algorithm-based extreme learning
pp. 136858–136871, 2020. machine,’’ IEEE Trans. Instrum. Meas., vol. 70, pp. 1–11, 2021.
[3] A. Poulose, J. Kim, and D. S. Han, ‘‘A sensor fusion framework for indoor [25] J. Koo and H. Cha, ‘‘Localizing WiFi access points using signal strength,’’
localization using smartphone sensors and Wi-Fi RSSI measurements,’’ IEEE Commun. Lett., vol. 15, no. 2, pp. 187–189, Feb. 2011.
Appl. Sci., vol. 9, no. 20, p. 4379, Oct. 2019. [26] C. Feng, S. Arshad, S. Zhou, D. Cao, and Y. Liu, ‘‘Wi-multi: A three-phase
[4] X. Hou and J. Bergmann, ‘‘Pedestrian dead reckoning with wearable sen- system for multiple human activity recognition with commercial WiFi
sors: A systematic review,’’ IEEE Sensors J., vol. 21, no. 1, pp. 143–152, devices,’’ IEEE Internet Things J., vol. 6, no. 4, pp. 7293–7304, Aug. 2019.
Jan. 2021. [27] P. Bahl and V. N. Padmanabhan, ‘‘Radar: An in-building RF-based user
[5] Y. Yu, R. Chen, L. Chen, S. Xu, W. Li, Y. Wu, and H. Zhou, ‘‘Precise 3- location and tracking system,’’ in Proc. IEEE INFOCOM Conf. Comput.
D indoor localization based on Wi-Fi FTM and built-in sensors,’’ IEEE Commun., 19th Annu. Joint Conf. IEEE Comput. Commun. Societies,
Internet Things J., vol. 7, no. 12, pp. 11753–11765, Dec. 2020. vol. 2, Mar. 2000, pp. 775–784.
[6] J. Xue, J. Liu, M. Sheng, Y. Shi, and J. Li, ‘‘A WiFi fingerprint based high- [28] S. Zhang, X. Li, M. Zong, X. Zhu, and R. Wang, ‘‘Efficient kNN classifi-
adaptability indoor localization via machine learning,’’ China Commun., cation with different numbers of nearest neighbors,’’ IEEE Trans. Neural
vol. 17, no. 7, pp. 247–259, Jul. 2020. Netw. Learn. Syst., vol. 29, no. 5, pp. 1774–1785, May 2018.
[7] B. Huang, R. Yang, B. Jia, W. Li, and G. Mao, ‘‘A theoretical analysis on [29] M. Brunato and R. Battiti, ‘‘Statistical learning theory for location finger-
sampling size in WiFi fingerprint-based localization,’’ IEEE Trans. Veh. printing in wireless LANs,’’ Comput. Netw., vol. 47, no. 6, pp. 825–845,
Technol., vol. 70, no. 4, pp. 3599–3608, Apr. 2021. Apr. 2005.
[30] M. Sun, Y. Wang, S. Xu, H. Qi, and X. Hu, ‘‘Indoor positioning tightly
[8] W. Xue, K. Yu, X. Hua, Q. Li, W. Qiu, and B. Zhou, ‘‘APs’ virtual positions-
coupled Wi-Fi FTM ranging and PDR based on the extended Kalman filter
based reference point clustering and physical distance-based weighting
for smartphones,’’ IEEE Access, vol. 8, pp. 49671–49684, 2020.
for indoor Wi-Fi positioning,’’ IEEE Internet Things J., vol. 5, no. 4,
[31] H. Zou, M. Jin, H. Jiang, L. Xie, and C. J. Spanos, ‘‘WinIPS: WiFi-based
pp. 3031–3042, Aug. 2018.
non-intrusive indoor positioning system with online radio map construc-
[9] B. Wang, X. Gan, X. Liu, B. Yu, R. Jia, L. Huang, and H. Jia, ‘‘A novel tion and adaptation,’’ IEEE Trans. Wireless Commun., vol. 16, no. 12,
weighted KNN algorithm based on RSS similarity and position distance pp. 8118–8130, Dec. 2017.
for Wi-Fi fingerprint positioning,’’ IEEE Access, vol. 8, pp. 30591–30602,
[32] T. Koike-Akino, P. Wang, M. Pajovic, H. Sun, and P. V. Orlik,
2020.
‘‘Fingerprinting-based indoor localization with commercial mmWave
[10] J. Niu, B. Wang, L. Shu, T. Q. Duong, and Y. Chen, ‘‘ZIL: An energy- WiFi: A deep learning approach,’’ IEEE Access vol. 8, pp. 84879–84892,
efficient indoor localization system using ZigBee radio to detect WiFi 2020.
fingerprints,’’ IEEE J. Sel. Areas Commun., vol. 33, no. 7, pp. 1431–1442, [33] X. Song, X. Fan, C. Xiang, Q. Ye, L. Liu, Z. Wang, X. He, N. Yang,
Jul. 2015. and G. Fang, ‘‘A novel convolutional neural network based indoor
[11] S. Li, M. Hedley, K. Bengston, D. Humphrey, M. Johnson, and W. Ni, localization framework with WiFi fingerprinting,’’ IEEE Access, vol. 7,
‘‘Passive localization of standard WiFi devices,’’ IEEE Syst. J., vol. 13, pp. 110698–110709, 2019.
no. 4, pp. 3929–3932, Dec. 2019. [34] C. Liu, C. Wang, and J. Luo, ‘‘Large-scale deep learning framework on
[12] Y. Zheng, M. Sheng, J. Liu, and J. Li, ‘‘Exploiting AoA estimation accu- FPGA for fingerprint-based indoor localization,’’ IEEE Access, vol. 8,
racy for indoor localization: A weighted AoA-based approach,’’ IEEE pp. 65609–65617, 2020.
Wireless Commun. Lett., vol. 8, no. 1, pp. 65–68, Feb. 2019. [35] X. Guo, L. Li, F. Xu, and N. Ansari, ‘‘Expectation maximization indoor
[13] M. R. Nowicki and P. Skrzypczynski, ‘‘Leveraging visual place recognition localization utilizing supporting set for Internet of Things,’’ IEEE Internet
to improve indoor positioning with limited availability of WiFi scans,’’ Things J., vol. 6, no. 2, pp. 2573–2582, Apr. 2019.
Sensors, vol. 19, no. 17, p. 3657, Aug. 2019. [36] Y. Li, S. Williams, B. Moran, and A. Kealy, ‘‘A probabilistic indoor
[14] M. T. Hoang, B. Yuen, X. Dong, T. Lu, R. Westendorp, and K. R. Tarimala, localization system for heterogeneous devices,’’ IEEE Sensors J., vol. 19,
‘‘Semi-sequential probabilistic model for indoor localization enhance- no. 16, pp. 6822–6832, Aug. 2019.
ment,’’ IEEE Sensors J., vol. 20, no. 11, pp. 6160–6169, Jun. 2020. [37] M. Zhou, X. Li, Y. Wang, S. Li, Y. Ding, and W. Nie, ‘‘6G multisource-
[15] Z. Chen, H. Zou, J. Yang, H. Jiang, and L. Xie, ‘‘WiFi fingerprinting indoor information-fusion-based indoor positioning via Gaussian kernel density
localization using local feature-based deep LSTM,’’ IEEE Syst. J., vol. 14, estimation,’’ IEEE Internet Things J., vol. 8, no. 20, pp. 15117–15125,
no. 2, pp. 3001–3010, Jun. 2020. Oct. 2021.
[16] A. Poulose and D. S. Han, ‘‘Performance analysis of fingerprint matching [38] Z. Chen, H. Zou, H. Jiang, Q. Zhu, Y. C. Soh, and L. Xie, ‘‘Fusion of
algorithms for indoor localization,’’ in Proc. Int. Conf. Artif. Intell. Inf. WiFi, smartphone sensors and landmarks using the Kalman filter for indoor
Commun. (ICAIIC), Feb. 2020, pp. 661–665. localization,’’ Sensors, vol. 15, no. 1, pp. 715–732, Jan. 2015.
[17] J. Hu, D. Liu, Z. Yan, and H. Liu, ‘‘Experimental analysis on weight
K-nearest neighbor indoor fingerprint positioning,’’ IEEE Internet Things
J., vol. 6, no. 1, pp. 891–897, Feb. 2019. JIUSONG HU received the M.Sc. and Ph.D.
[18] M. T. Hoang, Y. Zhu, B. Yuen, T. Reese, X. Dong, T. Lu, R. Westendorp, degrees from Hunan University, Changsha, China,
and M. Xie, ‘‘A soft range limited K-nearest neighbors algorithm for in 2014 and 2019, respectively. He is currently
indoor localization enhancement,’’ IEEE Sensors J., vol. 18, no. 24, a Lecturer with the Department of Information
pp. 10208–10216, Dec. 2018. Engineering, Hunan University of Technology,
[19] T. Raharijaona, R. Mawonou, T. Nguyen, F. Colonnier, M. Boyron, Zhuzhou, China. His research interests include
J. Diperi, and S. Viollet, ‘‘Local positioning system using flickering intelligent perception, information processing, and
infrared LEDs,’’ Sensors, vol. 17, no. 11, p. 2518, Nov. 2017. indoor positioning.
[20] M. O. Khyam, M. N.-A. Rahim, X. Li, A. Jayasuriya, M. A. Mahmud,
A. M. T. Oo, and S. S. Ge, ‘‘Simultaneous excitation systems for ultrasonic
indoor positioning,’’ IEEE Sensors J., vol. 20, no. 22, pp. 13716–13725,
Nov. 2020.
[21] X. Zhu, J. Yi, J. Cheng, and L. He, ‘‘Adapted error map based mobile robot CONGWEI HU received the B.S. degree in elec-
UWB indoor positioning,’’ IEEE Trans. Instrum. Meas., vol. 69, no. 9, tronic information engineering from the Hunan
pp. 6336–6350, Sep. 2020. University of Technology, in 2020, where he is
[22] A. A. N. Shirehjini and S. Shirmohammadi, ‘‘Improving accuracy and currently pursuing the master’s degree in elec-
robustness in HF-RFID-based indoor positioning with Kalman filtering tronic information. His current research interests
and Tukey smoothing,’’ IEEE Trans. Instrum. Meas., vol. 69, no. 11, include WSN, intelligent information processing,
pp. 9190–9202, Nov. 2020. fault detection, and indoor location.
[23] W. Zhang, K. Yu, W. Wang, and X. Li, ‘‘A self-adaptive AP selection algo-
rithm based on multiobjective optimization for indoor WiFi positioning,’’
IEEE Internet Things J., vol. 8, no. 3, pp. 1406–1416, Feb. 2021.