To ensure safety in confined environments such as mines or subway tunnels, a (wireless) sensor network can be deployed to monitor various environmental conditions. One of its most important applications is to track personnel, mobile equipment, and vehicles. However, the state-of-the-art algorithms assume that the positions of the sensors are perfectly known, which is not necessarily true due to imprecise placement and or dropping of sensors. Therefore, we propose an automatic approach for simultaneous refinement of sensors' positions and target tracking. We divide the considered area in a finite number of cells, define dynamic and measurement models, and apply a discrete variant of belief propagation that can efficiently solve this high-dimensional problem and handle all non-Gaussian uncertainties expected in this kind of environment. Finally, we use ray-tracing simulation to generate an artificial mine-like environment and generate synthetic measurement data. According to our extensive simulation study, the proposed approach performs significantly better than standard Bayesian target tracking and localization algorithms and provides robustness against outliers.
@cite_36: A robust and accurate positioning solution is required to increase the safety in GPS-denied environments. Although there is a lot of available research in this area, little has been done for confined environments such as tunnels. Therefore, we organized a measurement campaign in a basement tunnel of Linkoping university, in which we obtained ultra-wideband (UWB) complex impulse responses for line-of-sight (LOS), and three non-LOS (NLOS) scenarios. This paper is focused on time-of-arrival (TOA) ranging since this technique can provide the most accurate range estimates, which are required for range-based positioning. We describe the measurement setup and procedure, select the threshold for TOA estimation, analyze the channel propagation parameters obtained from the power delay profile (PDP), and provide statistical model for ranging. According to our results, the rise-time should be used for NLOS identification, and the maximum excess delay should be used for NLOS error mitigation. However, the NLOS condition cannot be perfectly determined, so the distance likelihood has to be represented in a Gaussian mixture form. We also compared these results with measurements from a mine tunnel, and found a similar behavior.
@cite_41: In this paper, we propose a new inference algorithm, suitable for distributed processing over wireless networks. The algorithm, called uniformly reweighted belief propagation (URW-BP), combines the local nature of belief propagation with the improved performance of tree-reweighted belief propagation (TRW-BP) in graphs with cycles. It reduces the degrees of freedom in the latter algorithm to a single scalar variable, the uniform edge appearance probability ρ. We provide a variational interpretation of URW-BP, give insights into good choices of ρ, develop an extension to higher-order potentials, and complement our work with numerical performance results on three inference problems in wireless communication systems: spectrum sensing in cognitive radio, cooperative positioning, and decoding of a low-density parity-check (LDPC) code.
@cite_31: Accurate and low-cost sensor localization is a critical requirement for the deployment of wireless sensor networks in a wide variety of applications. In cooperative localization, sensors work together in a peer-to-peer manner to make measurements and then forms a map of the network. Various application requirements influence the design of sensor localization systems. In this article, the authors describe the measurement-based statistical models useful to describe time-of-arrival (TOA), angle-of-arrival (AOA), and received-signal-strength (RSS) measurements in wireless sensor networks. Wideband and ultra-wideband (UWB) measurements, and RF and acoustic media are also discussed. Using the models, the authors have shown the calculation of a Cramer-Rao bound (CRB) on the location estimation precision possible for a given set of measurements. The article briefly surveys a large and growing body of sensor localization algorithms. This article is intended to emphasize the basic statistical signal processing background necessary to understand the state-of-the-art and to make progress in the new and largely open areas of sensor network localization research.
Finally, the results of the measurement campaign @cite_36 , carried out in a basement tunnel of Link "oping university and an iron-ore mine in Kiruna, Sweden, indicated that UWB time-of-arrival (TOA) allows very accurate ranging in line-of-sight (LOS) and non-LOS (NLOS) scenarios caused by thin obstacles. However, if the direct path is blocked by a thick tunnel wall, the TOA-based ranging leads to a relatively large bias. Moreover, the analysis showed that NLOS conditions cannot be accurately discriminated from LOS conditions, which means that (Bayesian) soft-decision algorithms are required for accurate ranging and positioning in these environments. The previously described state-of-the-art algorithms assume that the positions of the sensors are perfectly known, which is not necessarily the case due to imprecise placement and or sensor drops caused by vibrations or wall collapses. Although probably not available in confined environments nowadays, we also envision that uncertain sensors' positions can be an outcome of some (cooperative) sensor network localization algorithm @cite_31 @cite_41 . One possible solution to this problem is to manually and periodically verify that the sensors positions are correct. However, this approach may be too costly and even infeasible in some areas due to the on-going activities.