# A Novel GCN based Indoor Localization System with Multiple Access Points

arXiv: https://arxiv.org/abs/2104.10342 · HTML: https://mlsanity.com/paper/2104.10342/

## Key facts

- Cited by 5 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 21 Apr 2021.

## Built on by (most cited first, 5 of 5)

- [AI-driven Wireless Positioning: Fundamentals, Standards, State-of-the-art, and Challenges](https://mlsanity.com/paper/2501.14970/) (2025)
- [MetaGraphLoc: A Graph-based Meta-learning Scheme for Indoor Localization via Sensor Fusion](https://mlsanity.com/paper/2411.17781/) (2024)
- [Attentional Graph Meta-Learning for Indoor Localization Using Extremely Sparse Fingerprints](https://mlsanity.com/paper/2504.04829/) (2025)
- [Mobility-Induced Graph Learning for WiFi Positioning](https://mlsanity.com/paper/2311.08271/) (2023)
- [Lessons from Deploying Learning-based CSI Localization on a Large-Scale ISAC Platform](https://mlsanity.com/paper/2504.17173/) (2025)

## Abstract (arXiv)

With the rapid development of indoor location-based services (LBSs), the demand for accurate localization keeps growing as well. To meet this demand, we propose an indoor localization algorithm based on graph convolutional network (GCN). We first model access points (APs) and the relationships between them as a graph, and utilize received signal strength indication (RSSI) to make up fingerprints. Then the graph and the fingerprint will be put into GCN for feature extraction, and get classification by multilayer perceptron (MLP).In the end, experiments are performed under a 2D scenario and 3D scenario with floor prediction. In the 2D scenario, the mean distance error of GCN-based method is 11m, which improves by 7m and 13m compare with DNN-based and CNN-based schemes respectively. In the 3D scenario, the accuracy of predicting buildings and floors are up to 99.73% and 93.43% respectively. Moreover, in the case of predicting floors and buildings correctly, the mean distance error is 13m, which outperforms DNN-based and CNN-based schemes, whose mean distance errors are 34m and 26m respectively.
