ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Networks
Volume 47, Issue 6, 22 April 2005, Pages 825-845
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (517 K)

 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/j.comnet.2004.09.004    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2004 Elsevier B.V. All rights reserved.

Statistical learning theory for location fingerprinting in wireless LANsstar, open

Mauro BrunatoCorresponding Author Contact Information, E-mail The Corresponding Author and Roberto BattitiE-mail The Corresponding Author

Dipartimento di Informatica e Telecomunicazioni, Università di Trento, via Sommarive 14, I-38050 Trento, Italy

Received 4 February 2003; 
revised 7 May 2004; 
accepted 27 September 2004. 
Responsible Editor: B. Baykal. 
Available online 17 November 2004.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In this paper, techniques and algorithms developed in the framework of Statistical Learning Theory are applied to the problem of determining the location of a wireless device by measuring the signal strength values from a set of access points (location fingerprinting). Statistical Learning Theory provides a rich theoretical basis for the development of models starting from a set of examples. Signal strength measurement is part of the normal operating mode of wireless equipment, in particular Wi–Fi, so that no special-purpose hardware is required.

The proposed techniques, based on the Support Vector Machine paradigm, have been implemented and compared, on the same data set, with other approaches considered in scientific literature. Tests performed in a real-world environment show that results are comparable, with the advantage of a low algorithmic complexity in the normal operating phase. Moreover, the algorithm is particularly suitable for classification, where it outperforms the other techniques.

Keywords: Context-aware computing; Location management; Wi–Fi; Mobile computing; Statistical learning theory

Article Outline

1. Introduction
2. Previous work
3. Motivations
4. Statistical learning theory
5. Support vector machines for location fingerprinting
5.1. Linearly separable problems
5.2. Non-separable problems
5.3. Non-linear hypotheses
5.4. Support vectors for regression
6. Other approaches for location fingerprinting
6.1. Weighted k nearest neighbors (WKNN)
6.1.1. Learning phase complexity
6.1.2. Estimation phase complexity
6.1.3. VC dimension
6.2. Bayesian modeling (BAY)
6.2.1. Learning phase complexity
6.2.2. Estimation phase complexity
6.2.3. VC dimension
6.3. Multi-layer perceptrons (MLP)
6.3.1. Learning phase complexity
6.3.2. Estimation phase complexity
6.3.3. VC dimension
7. Experimental results
7.1. Setup
7.2. Setup and parameter tuning
7.2.1. Support vector machine
7.2.2. Weighted k nearest neighbors
7.2.3. Bayesian approach
7.2.4. Multi-layer perceptron
7.3. The regression problem
7.4. The classification problem
7.5. Benchmarks
8. Conclusions
Acknowledgements
References
Vitae









Computer Networks
Volume 47, Issue 6, 22 April 2005, Pages 825-845
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.