Indoor Path Tracking Using Combination of Viterbi and WKNN

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Ali Asgari Renani Fatemeh; Ghaffarian Hossein; Chegeni Mastaneh

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF COMPUTING AND SECURITY Year:2021 | Volume:8 | Issue:2 Page(s): 19-26

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Indoor Path Tracking Using Combination of Viterbi and WKNN

Author(s)

Ali Asgari Renani Fatemeh | Ghaffarian Hossein | Chegeni Mastaneh | Issue Writer Certificate

Keywords

Indoor Localization

Observation Sequence

Most Probable Path

Viterbi

Abstract

In this paper, we focus to find desired node position in indoor environments using a sequence of observations and user movement records. For this purpose, we first record the user's movements in indoor environments by defining a set of states and several matrices, which are Viterbi inputs. To record the fingerprints of the environment, we move across the entire coordinates of the building to collect and record the fingerprints of different places. In the online phase, we use the Weighted K-Nearest Neighbors (WKNN) algorithm in parallel to check the accuracy of both WKNN and Viterbi algorithms and to correct the WKNN behavior by Viterbi. During this phase, an experimental node is inserted into the environment and moves in the desired direction by determining the destination. The proposed method calculates the current location of the node and its most probable location in the next step. The results of the implementation and testing of the proposed algorithm in the Faculty of Engineering, Arak University, show the optimal performance of the proposed idea for predicting the location and path of the node.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans