Efficient Ambiguity Resolution in Wireless Localization Systems
Efficient Ambiguity Resolution in Wireless Localization Systems
复制标题
DOI：
10.1109/tii.2017.2649561
复制
发表时间：
2017-04-01
影响因子：
12.3
通讯作者：
Sauter, Thilo
中科院分区：
文献类型：
--
作者：
Elwischger, Bernard Philipp Bernhard;Sauter, Thilo
无线通信被广泛应用于各种自动化领域的节点定位。基于到达时间差(TDOA)的方案是可实现的精度和实现工作量的良好折衷。由于工业环境中可能的参考传感器位置的限制，参考节点和移动节点位置之间的几何条件通常是困难的。因此，迭代算法可能会失败或导致较高的计算工作量。精确直接法不会引入额外的误差，但可以产生有效的解对。因此，现有的直接方法要么依赖先验信息来整理这两个解中的一个，要么恢复到基本双曲型方程的非精确线性化方法。在这项工作中，我们提出了一种直接方法，应用精确直接方法，在没有先验信息的情况下解决了不明确的解对。它的分而治之的结构和现有精确直接法的高计算效率使其成为分布式传感器网络中快速并行计算的一个很好的候选者。与Cramer-Rao下界、迭代Gausston方法和另一种直接方法的性能进行了比较。新方法是针对TDOA方案提出的，但也可以应用于到达时间方案或任何其他基于距离的方案。
Wireless communication is widely used for node localization in various automation domains. Schemes based on time difference of arrival (TDOA) are a good compromise of achievable accuracy and implementation effort. Due to restrictions on possible reference sensor positions in industrial environments, the geometric conditions between reference and mobile nodes locations are often difficult. Consequently, iterative algorithms can fail or result in high computational effort. Exact direct methods introduce no additional errors, but can result in a valid pair of solutions. Existing direct methods thus either rely on a priori information to sort out one of those two solutions, or revert to nonexact linearization approaches of the underlying hyperbolic equations. In this work, we present a direct approach that applies exact direct methods, and resolves the ambiguous pairs of solutions without a priori information. Its divide and conquer structure and the high computational efficiency of the available exact direct methods makes it a very good candidate for fast parallel computing in distributed sensor networks. The performance is compared to the Cramer-Rao lower bound, to the iterative GaussNewton method and to another direct method. The new method is presented for the TDOA scheme, but can also be applied to time of arrival, or any other range-based scheme.