TY - GEN
T1 - Quantitative uncertainty-based incremental localization and anchor selection in wireless sensor networks
AU - Xie, Zhiheng
AU - Hong, Mingyi
AU - Liu, Hengchang
AU - Li, Jingyuan
AU - Zhu, Kangyuan
AU - A.stankovic, John
PY - 2011
Y1 - 2011
N2 - 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.
AB - 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.
KW - Localization
KW - Uncertainty
KW - Wireless sensor network
UR - http://www.scopus.com/inward/record.url?scp=83055178666&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=83055178666&partnerID=8YFLogxK
U2 - 10.1145/2068897.2068968
DO - 10.1145/2068897.2068968
M3 - Conference contribution
AN - SCOPUS:83055178666
SN - 9781450308984
T3 - MSWiM'11 - Proceedings of the 14th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems
SP - 417
EP - 426
BT - MSWiM'11 - Proceedings of the 14th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems
T2 - 14th ACM International Conference on Modeling, Analysis, and Simulation of Wireless and Mobile Systems, MSWiM'11
Y2 - 31 October 2011 through 4 November 2011
ER -