Quantitative uncertainty-based incremental localization and anchor selection in wireless sensor networks

  • Authors:

  • Zhiheng Xie;Mingyi Hong;Hengchang Liu;Jingyuan Li;Kangyuan Zhu;John Stankovic

  • Affiliations:

  • University of Virginia, Charlottesville, VA, USA;University of Virginia, Charlottesville, VA, USA;University of Virginia, Charlottesville, VA, USA;University of Virginia, Charlottesville, VA, USA;University of Virginia, Charlottesville, VA, USA;University of Virginia, Charlottesville, VA, USA

  • Venue:
  • Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Previous localization solutions in wireless sensor networks mainly focus on using various techniques to estimate node positions. In this paper, we argue that quantifying the uncertainty of these estimates is equally important in practice. By using the quantitative uncertainty of measurements and estimates, we can derive more accurate estimates by better fusing the measurements, provide confidence information for confidence-based applications, and know how to select the best anchor nodes so as to minimize the total mean square errors of the whole network. This paper quantifies the estimation uncertainty as an error covariance matrix, and presents an efficient incremental centralized algorithm---INOVA and a decentralized algorithm---OSE-COV for calculating the error covariance matrix. Furthermore, we present how to use the error covariance matrix to infer the confidence region of each node's estimate, and provide an optimal strategy for the anchor selection problem. Extensive simulation results show that INOVA significantly improves the computation efficiency when the network changes dynamically; the confidence region inference is accurate when the measurement number to node number ratio is more than 2; and the optimal anchor selection strategy reduces the total mean square error by four times as much as the variation-based algorithm in best case.