Improving the speed and accuracy of indoor localization

作者: Konstantinos Kleisouris , Richard P. Martin

DOI: 10.7282/T3TD9XMB

关键词:

摘要: Advances in technology have enabled a large number of computing devices to communicate wirelessly. In addition, radio waves, which are the primary means transmitting data wireless communication, can be used localize 2D and 3D space. As result there has been an increasing applications that rely on availability device location. Many systems developed provide location estimates indoors, where Global Positioning System (GPS) do not work. However, localization indoors faces many challenges. First, system should use as little extra hardware possible, work any with very or no modification, latency small. Also, signals in-doors suffer from environmental effects like reflection, diffraction scattering, making signal characterization respect difficult. Moreover, algorithms require detailed profiling environment, hard deploy. This thesis addresses some aforementioned issues for properties Received Signal Strength (RSS). The advantage these is they reuse existing communication infrastructure, rather than necessitating deployment specialized hardware. Specifically, we improved particular method relies Bayesian Networks (BNs). This requiring small size training data, simultaneously, versions BNs without knowledge locations strength collected. We proposed Markov Chain Monte Carlo (MCMC) evaluated their performance by introducing metric call relative accuracy. reduced identifying MCMC methods improve accuracy solutions returned statistical packages time possible. parallelized process when localizing whose order hundreds. Finally, since transmission heavily affected physical environment investigated impact using multiple antennas various algorithms. showed deploying low-cost at fixed stability indoors.

参考文章(62)
Yingying Chen, Konstantinos Kleisouris, Xiaoyan Li, Wade Trappe, Richard P. Martin, The Robustness of Localization Algorithms to Signal Strength Attacks: A Comparative Study Distributed Computing in Sensor Systems. pp. 546- 563 ,(2006) , 10.1007/11776178_33
Tommi S Jaakkola, Michael I Jordan, None, Bayesian parameter estimation via variational methods Statistics and Computing. ,vol. 10, pp. 25- 37 ,(2000) , 10.1023/A:1008932416310
Andrea C. Dusseau, Modeling Parallel Sorts with LogP on the CM-5 University of California at Berkeley. ,(1994)
Bruce D'Ambrosio, Tony Fountain, Zhaoyu Li, Parallelizing probabilistic inference: some early explorations uncertainty in artificial intelligence. pp. 59- 66 ,(1992) , 10.1016/B978-1-4832-8287-9.50013-X
David J. Lunn, Andrew Thomas, Nicky Best, David Spiegelhalter, WinBUGS – A Bayesian modelling framework: Concepts, structure, and extensibility Statistics and Computing. ,vol. 10, pp. 325- 337 ,(2000) , 10.1023/A:1008929526011
David M. Pennock, Logarithmic time parallel Bayesian inference uncertainty in artificial intelligence. pp. 431- 438 ,(1998)
V.A.N. Barroso, M.J. Rendas, J.P. Gomes, Impact of array processing techniques on the design of mobile communication systems mediterranean electrotechnical conference. pp. 1291- 1294 ,(1994) , 10.1109/MELCON.1994.380829
Deepak K. Agarwal, Alan E. Gelfand, Slice sampling for simulation based fitting of spatial data models Statistics and Computing. ,vol. 15, pp. 61- 69 ,(2005) , 10.1007/S11222-005-4790-Z
Xizhou Feng, Duncan A. Buell, John R. Rose, Peter J. Waddell, Parallel algorithms for Bayesian phylogenetic inference Journal of Parallel and Distributed Computing. ,vol. 63, pp. 707- 718 ,(2003) , 10.1016/S0743-7315(03)00079-0