A localization algorithm for nonuniform propagation environments in sensor networks

Noriaki Kitakoga, Tomoaki Ohtsuki

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

1 Citation (Scopus)

Abstract

Target localization is one of the interesting applications of sensor networks. Localization algorithms that use received signal strength (RSS) measurements at individual sensor nodes have been proposed. The maximum likelihood (ML) algorithm is known as a popular algorithm for target localization. In uniform propagation environments, theML algorithm has high accuracy to estimate a target location. Meanwhile, in nonuniform propagation environments, the ML algorithm has low accuracy, because this algorithm uses RSS from all the sensor nodes equivalently. The residual weighting (RWGH) algorithm has been proposed to reduce the effect of nonuniform propagation environments. This algorithm first sets subsets of sensor nodes. The target location is estimated using the sensor nodes in each subset. The final estimated result is the averaged value of the estimated results of all the subsets weighted by their reliabilities. The reliability of each subset is the residual error of the distances between the target and each sensor node estimated by two ways. In the RWGH algorithm, there may be a case that the reliability of each subset is high although the estimation error of the subset is large. This degrades the final estimated result. In this paper, we propose a localization algorithm to reduce the effect of the subsets that have large errors. The proposed algorithm tries to detect the area where the density of the estimated results of subsets is high and reflect this information to the final estimated result. In this algorithm, the sensor field is split into cells. Each subset votes its reliability for a cell that includes the estimated location with the subset and the reliability of the subset is added to the cumulative reliability of the voted subsets. The cumulative reliabilities of cells are used to calculate the final estimated result. We show that the proposed algorithm has higher localization accuracy than theML and RWGH algorithms by computer simulation.

Original languageEnglish
Title of host publicationProceedings - International Conference on Computer Communications and Networks, ICCCN
DOIs
Publication statusPublished - 2009
Event2009 18th International Conference on Computer Communications and Networks, ICCCN 2009 - San Francisco, CA, United States
Duration: 2009 Aug 32009 Aug 6

Other

Other2009 18th International Conference on Computer Communications and Networks, ICCCN 2009
CountryUnited States
CitySan Francisco, CA
Period09/8/309/8/6

Fingerprint

Sensor networks
Sensor nodes
Set theory
Maximum likelihood
Error analysis

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Kitakoga, N., & Ohtsuki, T. (2009). A localization algorithm for nonuniform propagation environments in sensor networks. In Proceedings - International Conference on Computer Communications and Networks, ICCCN [5235227] https://doi.org/10.1109/ICCCN.2009.5235227

A localization algorithm for nonuniform propagation environments in sensor networks. / Kitakoga, Noriaki; Ohtsuki, Tomoaki.

Proceedings - International Conference on Computer Communications and Networks, ICCCN. 2009. 5235227.

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

Kitakoga, N & Ohtsuki, T 2009, A localization algorithm for nonuniform propagation environments in sensor networks. in Proceedings - International Conference on Computer Communications and Networks, ICCCN., 5235227, 2009 18th International Conference on Computer Communications and Networks, ICCCN 2009, San Francisco, CA, United States, 09/8/3. https://doi.org/10.1109/ICCCN.2009.5235227
Kitakoga N, Ohtsuki T. A localization algorithm for nonuniform propagation environments in sensor networks. In Proceedings - International Conference on Computer Communications and Networks, ICCCN. 2009. 5235227 https://doi.org/10.1109/ICCCN.2009.5235227
Kitakoga, Noriaki ; Ohtsuki, Tomoaki. / A localization algorithm for nonuniform propagation environments in sensor networks. Proceedings - International Conference on Computer Communications and Networks, ICCCN. 2009.
@inproceedings{7ea5225ca15240ea86882c020fcb85fa,
title = "A localization algorithm for nonuniform propagation environments in sensor networks",
abstract = "Target localization is one of the interesting applications of sensor networks. Localization algorithms that use received signal strength (RSS) measurements at individual sensor nodes have been proposed. The maximum likelihood (ML) algorithm is known as a popular algorithm for target localization. In uniform propagation environments, theML algorithm has high accuracy to estimate a target location. Meanwhile, in nonuniform propagation environments, the ML algorithm has low accuracy, because this algorithm uses RSS from all the sensor nodes equivalently. The residual weighting (RWGH) algorithm has been proposed to reduce the effect of nonuniform propagation environments. This algorithm first sets subsets of sensor nodes. The target location is estimated using the sensor nodes in each subset. The final estimated result is the averaged value of the estimated results of all the subsets weighted by their reliabilities. The reliability of each subset is the residual error of the distances between the target and each sensor node estimated by two ways. In the RWGH algorithm, there may be a case that the reliability of each subset is high although the estimation error of the subset is large. This degrades the final estimated result. In this paper, we propose a localization algorithm to reduce the effect of the subsets that have large errors. The proposed algorithm tries to detect the area where the density of the estimated results of subsets is high and reflect this information to the final estimated result. In this algorithm, the sensor field is split into cells. Each subset votes its reliability for a cell that includes the estimated location with the subset and the reliability of the subset is added to the cumulative reliability of the voted subsets. The cumulative reliabilities of cells are used to calculate the final estimated result. We show that the proposed algorithm has higher localization accuracy than theML and RWGH algorithms by computer simulation.",
author = "Noriaki Kitakoga and Tomoaki Ohtsuki",
year = "2009",
doi = "10.1109/ICCCN.2009.5235227",
language = "English",
isbn = "9781424445813",
booktitle = "Proceedings - International Conference on Computer Communications and Networks, ICCCN",

}

TY - GEN

T1 - A localization algorithm for nonuniform propagation environments in sensor networks

AU - Kitakoga, Noriaki

AU - Ohtsuki, Tomoaki

PY - 2009

Y1 - 2009

N2 - Target localization is one of the interesting applications of sensor networks. Localization algorithms that use received signal strength (RSS) measurements at individual sensor nodes have been proposed. The maximum likelihood (ML) algorithm is known as a popular algorithm for target localization. In uniform propagation environments, theML algorithm has high accuracy to estimate a target location. Meanwhile, in nonuniform propagation environments, the ML algorithm has low accuracy, because this algorithm uses RSS from all the sensor nodes equivalently. The residual weighting (RWGH) algorithm has been proposed to reduce the effect of nonuniform propagation environments. This algorithm first sets subsets of sensor nodes. The target location is estimated using the sensor nodes in each subset. The final estimated result is the averaged value of the estimated results of all the subsets weighted by their reliabilities. The reliability of each subset is the residual error of the distances between the target and each sensor node estimated by two ways. In the RWGH algorithm, there may be a case that the reliability of each subset is high although the estimation error of the subset is large. This degrades the final estimated result. In this paper, we propose a localization algorithm to reduce the effect of the subsets that have large errors. The proposed algorithm tries to detect the area where the density of the estimated results of subsets is high and reflect this information to the final estimated result. In this algorithm, the sensor field is split into cells. Each subset votes its reliability for a cell that includes the estimated location with the subset and the reliability of the subset is added to the cumulative reliability of the voted subsets. The cumulative reliabilities of cells are used to calculate the final estimated result. We show that the proposed algorithm has higher localization accuracy than theML and RWGH algorithms by computer simulation.

AB - Target localization is one of the interesting applications of sensor networks. Localization algorithms that use received signal strength (RSS) measurements at individual sensor nodes have been proposed. The maximum likelihood (ML) algorithm is known as a popular algorithm for target localization. In uniform propagation environments, theML algorithm has high accuracy to estimate a target location. Meanwhile, in nonuniform propagation environments, the ML algorithm has low accuracy, because this algorithm uses RSS from all the sensor nodes equivalently. The residual weighting (RWGH) algorithm has been proposed to reduce the effect of nonuniform propagation environments. This algorithm first sets subsets of sensor nodes. The target location is estimated using the sensor nodes in each subset. The final estimated result is the averaged value of the estimated results of all the subsets weighted by their reliabilities. The reliability of each subset is the residual error of the distances between the target and each sensor node estimated by two ways. In the RWGH algorithm, there may be a case that the reliability of each subset is high although the estimation error of the subset is large. This degrades the final estimated result. In this paper, we propose a localization algorithm to reduce the effect of the subsets that have large errors. The proposed algorithm tries to detect the area where the density of the estimated results of subsets is high and reflect this information to the final estimated result. In this algorithm, the sensor field is split into cells. Each subset votes its reliability for a cell that includes the estimated location with the subset and the reliability of the subset is added to the cumulative reliability of the voted subsets. The cumulative reliabilities of cells are used to calculate the final estimated result. We show that the proposed algorithm has higher localization accuracy than theML and RWGH algorithms by computer simulation.

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

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

U2 - 10.1109/ICCCN.2009.5235227

DO - 10.1109/ICCCN.2009.5235227

M3 - Conference contribution

AN - SCOPUS:70449083435

SN - 9781424445813

BT - Proceedings - International Conference on Computer Communications and Networks, ICCCN

ER -