• DocumentCode
    3321874
  • Title

    A Localization Algorithm for Nonuniform Propagation Environments in Sensor Networks

  • Author

    Kitakoga, Noriaki ; Ohtsuki, Tomoaki

  • Author_Institution
    Dept. of Inf. & Comput. Sci., Keio Univ., Yokohama, Japan
  • fYear
    2009
  • fDate
    3-6 Aug. 2009
  • Firstpage
    1
  • Lastpage
    5
  • 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, the ML 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 the ML and RWGH algorithms by computer simulation.
  • Keywords
    direction-of-arrival estimation; electromagnetic wave propagation; maximum likelihood estimation; reliability; time-of-arrival estimation; wireless sensor networks; computer simulation; estimation error; localization algorithm; maximum likelihood algorithm; nonuniform propagation environment; received signal strength measurement; residual weighting algorithm; sensor nodes; target localization; time difference of arrival estimation; wireless sensor network; Application software; Computer network reliability; Computer science; Computer simulation; Degradation; Estimation error; Maximum likelihood estimation; Radio frequency; Sensor arrays; Voting;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Communications and Networks, 2009. ICCCN 2009. Proceedings of 18th Internatonal Conference on
  • Conference_Location
    San Francisco, CA
  • ISSN
    1095-2055
  • Print_ISBN
    978-1-4244-4581-3
  • Electronic_ISBN
    1095-2055
  • Type

    conf

  • DOI
    10.1109/ICCCN.2009.5235227
  • Filename
    5235227