Indoor Localization Performance Optimization Using Modified kd-Tree Algorithm

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.

Ghaffarian Hossein; Soleimani Seyfollah; Zadsar Seyede Habibe

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

Journal Paper

Paper Information

Journal: JOURNAL OF COMPUTING AND SECURITY Year:2022 | Volume:9 | Issue:2 Page(s): 55-64

Download Full-Text

View:

Download:

Cites:

Information Journal Paper

Title

Indoor Localization Performance Optimization Using Modified kd-Tree Algorithm

Author(s)

Ghaffarian Hossein | Soleimani Seyfollah | Zadsar Seyede Habibe | Issue Writer Certificate

Keywords

Indoor Localization

Fingerprint

Received Signal Strength

KD-Tree

Abstract

In this paper, we present a new method for improving the efficiency of Indoor Localization algorithms, in terms of running time and error rate, using the KD-Tree data structure. One of the main challenges of Indoor Localization algorithms in large environments is the high processing overhead of these algorithms due to the high volume of input data and lack of processing resources in users' mobile devices. In the proposed method in this paper, we first cluster the Fingerprint database. Then, with the help of a newly proposed method, a modified KD-Tree is implemented according to the conditions of the clusters. This tree is a decision-making structure to select one specific cluster where the user stands there. Finally, when a user entered, using a few simple comparisons in the KD-Tree, the desired cluster is found and only information about that cluster is passed to the localization algorithm, to compare and predict the user’s location. The results of the implementation of this method on the Fingerprint data set of the Faculty of Engineering at Arak University show that the proposed method reduces the running times and errors to less than half the values, compared to the time of not using the proposed method.

Multimedia

No record.

Cites

No record.

References

No record.

Cite

Related Journal Papers

No record.

Related Seminar Papers

No record.

Related Plans