In this paper we present indoor localization aspects in IEEE 802.11 wireless networks. We analyze two existing lo- calization algorithms, N-Nearest Neighbor and Smallest Polygon, and we propose two modified versions of these algorithms. Comparisons between the classic versions and our proposals are realized both trough simulations and with a real test-bed,performed at the University of Ferrara. Obtained results show that our modified algorithms lead to improvements concerning both the mean error and the variance related to the localized position.
Improved Indoor Localization Algorithms for IEEE 802.11 Wireless Networks
FERGNANI, Federico;TADDIA, Chiara;MAZZINI, Gianluca
2005
Abstract
In this paper we present indoor localization aspects in IEEE 802.11 wireless networks. We analyze two existing lo- calization algorithms, N-Nearest Neighbor and Smallest Polygon, and we propose two modified versions of these algorithms. Comparisons between the classic versions and our proposals are realized both trough simulations and with a real test-bed,performed at the University of Ferrara. Obtained results show that our modified algorithms lead to improvements concerning both the mean error and the variance related to the localized position.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in SFERA sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.