Low complexity localization algorithm based on NLOS node identification using minimum subset for NLOS environments

Takahiro Fujita, Tomoaki Ohtsuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

5 Citations (Scopus)

Abstract

The location estimation in sensor networks is of great current interest. A general approach to location estimation is to gather Time-of-Arrival (TOA) measurements from a number of nodes and to estimate a target location. The two major sources of range measurement errors in geolocation techniques are measurement error and Non-Line-of-Sight (NLOS) error. NLOS errors caused by blocking of direct paths have been considered as one of serious issues in the location estimation. Therefore, Iterative Minimum Residual (IMR) method, which identifies NLOS nodes and removes them from the data set used for localization, has been proposed. IMR improves location estimation precision in comparison with the technique that does not identify and remove NLOS nodes. However, IMR needs a lot of calculation to identify NLOS nodes. In this paper, we propose a low complexity localization algorithm based on NLOS node identification using minimum subset for NLOS environments. We evaluate our proposed algorithm by computer simulation. We show that the proposed method achieves almost the same root mean square error (RMSE) as the conventional method with lower complexity.

Original languageEnglish
Title of host publicationGLOBECOM - IEEE Global Telecommunications Conference
Pages5389-5393
Number of pages5
DOIs
Publication statusPublished - 2008
Event2008 IEEE Global Telecommunications Conference, GLOBECOM 2008 - New Orleans, LA, United States
Duration: 2008 Nov 302008 Dec 4

Other

Other2008 IEEE Global Telecommunications Conference, GLOBECOM 2008
CountryUnited States
CityNew Orleans, LA
Period08/11/3008/12/4

Fingerprint

Set theory
Measurement errors
Mean square error
Sensor networks
Computer simulation

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Low complexity localization algorithm based on NLOS node identification using minimum subset for NLOS environments. / Fujita, Takahiro; Ohtsuki, Tomoaki.

GLOBECOM - IEEE Global Telecommunications Conference. 2008. p. 5389-5393 4698804.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fujita, T & Ohtsuki, T 2008, Low complexity localization algorithm based on NLOS node identification using minimum subset for NLOS environments. in GLOBECOM - IEEE Global Telecommunications Conference., 4698804, pp. 5389-5393, 2008 IEEE Global Telecommunications Conference, GLOBECOM 2008, New Orleans, LA, United States, 08/11/30. https://doi.org/10.1109/GLOCOM.2008.ECP.1029
Fujita, Takahiro ; Ohtsuki, Tomoaki. / Low complexity localization algorithm based on NLOS node identification using minimum subset for NLOS environments. GLOBECOM - IEEE Global Telecommunications Conference. 2008. pp. 5389-5393
@inproceedings{11e8ba2621274ede8f339c0265a311ea,
title = "Low complexity localization algorithm based on NLOS node identification using minimum subset for NLOS environments",
abstract = "The location estimation in sensor networks is of great current interest. A general approach to location estimation is to gather Time-of-Arrival (TOA) measurements from a number of nodes and to estimate a target location. The two major sources of range measurement errors in geolocation techniques are measurement error and Non-Line-of-Sight (NLOS) error. NLOS errors caused by blocking of direct paths have been considered as one of serious issues in the location estimation. Therefore, Iterative Minimum Residual (IMR) method, which identifies NLOS nodes and removes them from the data set used for localization, has been proposed. IMR improves location estimation precision in comparison with the technique that does not identify and remove NLOS nodes. However, IMR needs a lot of calculation to identify NLOS nodes. In this paper, we propose a low complexity localization algorithm based on NLOS node identification using minimum subset for NLOS environments. We evaluate our proposed algorithm by computer simulation. We show that the proposed method achieves almost the same root mean square error (RMSE) as the conventional method with lower complexity.",
author = "Takahiro Fujita and Tomoaki Ohtsuki",
year = "2008",
doi = "10.1109/GLOCOM.2008.ECP.1029",
language = "English",
isbn = "9781424423248",
pages = "5389--5393",
booktitle = "GLOBECOM - IEEE Global Telecommunications Conference",

}

TY - GEN

T1 - Low complexity localization algorithm based on NLOS node identification using minimum subset for NLOS environments

AU - Fujita, Takahiro

AU - Ohtsuki, Tomoaki

PY - 2008

Y1 - 2008

N2 - The location estimation in sensor networks is of great current interest. A general approach to location estimation is to gather Time-of-Arrival (TOA) measurements from a number of nodes and to estimate a target location. The two major sources of range measurement errors in geolocation techniques are measurement error and Non-Line-of-Sight (NLOS) error. NLOS errors caused by blocking of direct paths have been considered as one of serious issues in the location estimation. Therefore, Iterative Minimum Residual (IMR) method, which identifies NLOS nodes and removes them from the data set used for localization, has been proposed. IMR improves location estimation precision in comparison with the technique that does not identify and remove NLOS nodes. However, IMR needs a lot of calculation to identify NLOS nodes. In this paper, we propose a low complexity localization algorithm based on NLOS node identification using minimum subset for NLOS environments. We evaluate our proposed algorithm by computer simulation. We show that the proposed method achieves almost the same root mean square error (RMSE) as the conventional method with lower complexity.

AB - The location estimation in sensor networks is of great current interest. A general approach to location estimation is to gather Time-of-Arrival (TOA) measurements from a number of nodes and to estimate a target location. The two major sources of range measurement errors in geolocation techniques are measurement error and Non-Line-of-Sight (NLOS) error. NLOS errors caused by blocking of direct paths have been considered as one of serious issues in the location estimation. Therefore, Iterative Minimum Residual (IMR) method, which identifies NLOS nodes and removes them from the data set used for localization, has been proposed. IMR improves location estimation precision in comparison with the technique that does not identify and remove NLOS nodes. However, IMR needs a lot of calculation to identify NLOS nodes. In this paper, we propose a low complexity localization algorithm based on NLOS node identification using minimum subset for NLOS environments. We evaluate our proposed algorithm by computer simulation. We show that the proposed method achieves almost the same root mean square error (RMSE) as the conventional method with lower complexity.

UR - http://www.scopus.com/inward/record.url?scp=67249142026&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67249142026&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2008.ECP.1029

DO - 10.1109/GLOCOM.2008.ECP.1029

M3 - Conference contribution

AN - SCOPUS:67249142026

SN - 9781424423248

SP - 5389

EP - 5393

BT - GLOBECOM - IEEE Global Telecommunications Conference

ER -