By Topic

A Fast Database Correlation Algorithm for Localization of Wireless Network Mobile Nodes using Coverage Prediction and Round Trip Delay

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Rafael Saraiva Campos ; Fac. de Eng., Univ. do Estado do Rio de Janeiro, Rio de Janeiro ; Lisandro Lovisolo

In this work a fast database correlation algorithm is proposed for the localization of mobile stations in wireless metropolitan area networks. The algorithm is entirely based on built-in functionalities of mobile nodes. The set of measured parameters used for localization is called radio-frequency fingerprint. To provide a position estimate, it is correlated with a database built from field measurements or propagation modeling. The latter alternative was selected, as it allows a less expensive and faster database update. A novel use of the round trip delay to reduce the correlation space and improve positioning accuracy is presented. Vehicular field tests and Monte Carlo simulations were conducted to evaluate the algorithm's accuracy in GSM and WCDMA cellular networks, respectively.

Published in:

Vehicular Technology Conference, 2009. VTC Spring 2009. IEEE 69th

Date of Conference:

26-29 April 2009