220 likes | 336 Views
An Algorithmic and Systematic Approach for Improving Robustness of TOA-based Localization Yongcai Wang , Lei Song Institute for Interdisciplinary Information Sciences (IIIS), Tsinghua University, Beijing, China in EUC2013, Nov.13, 2013. Context.
E N D
An Algorithmic and Systematic Approach forImproving Robustness of TOA-based LocalizationYongcai Wang, Lei SongInstitute for Interdisciplinary Information Sciences(IIIS), Tsinghua University, Beijing, Chinain EUC2013, Nov.13, 2013
Context • Positioning by Time of Arrival (TOA) of ultrasound • Advantages: • Accurate: Centi-meter level positioning accuracy • Safe: user-imperceptible • Low cost: US transducers are cheap (around 10 RMBs). RF ultrasound TOA2 RF ultrasound 0 t RF ultrasound TOA1 TOA3 0 t 0 t
Challenges:Sensitive to Environment • Challenge 1: Non-Line-of-Sight Impacts • Non-Line-of-Sight (NLOS) paths, caused by furniture, doors, moving people may lead to large positioning error. NLOS is generally inevitable
Challenges (2): Miss of Synchronization • Background RF signal from WiFi, microwave oven, etc may collide the synchronization RF signal, leading to positioning error. R1 R2 TOA2 TOA1 TOA2 TOA1 T1 T2 Interference from background RF is also inevitable
Our Work • We show NLOS outlier detection problem is NP-hard. • We developed COFFEE, an iterative clustering, voting and filtering algorithm to detect NLOS distances. • First-Falling-Edge robust time synchronization • A prototype of Dragon system which implements COFFEE and First-Falling-Edge time synchronization.
1. NLOS Outlier Detection Problem • N beacons with known coordinates • N beacons take N distance measurements: • m of the distances are NLOS outliers: m<N/2 • NLOS detection Problem: To detect them outliers among the N distances.
Conventional Approach: 1. Geometrical method • Outlier detection by Triangular Inequality [zhao2008]. • Graph embeddability and rigidity. [Jian 2010] • High computation cost. • May fail to detect outlier when normal ranging distances have noises. Coarse-grained, may fail to detect the outlier
Conventional Approaches 2: Least Trimmed Square Method [Pireto2009] Method: is a subset of distance measurements Enumerate Dsto find the set with the minimum positioning residue. Problem: N distances can generate at most O(2N) subsets. Searching all sets needs high computation cost
Our Approach: Clustering and Filtering (COFFEE) Filter outlier distance Density-based clustering Position outlier 1 1 Assign doubting weight 1 Core cluster 2 1 Delete outlier positions Distance measurements Potential positions COFFEE: Conduct clustering and filtering iteratively on the bipartite graph
N=15 m=3
Algorithm Properties • Convergence speed • Detect m distance outliers in m iterations. • Complexity • N4logN
COFFEE performs best in positioning accuracy improvement Coffee provides the best accuracy
COFFEE is Robust to the number of the distance outliers • Positioning error of COFFEE is small until m=8
2. First-Falling-Edge Time Synchronization • A hardware type design • Using a sync-line to connect all the receivers (beacons) All receivers can be synchronized only if one receiver detects the synchronization RF signal.
Robust Synchronization By First-Falling-Edge When probability of missing RF signal is 1% It helps more receivers to provide correct ranging, which improves the positioning accuracy.
Experiment Results Positioning failure probability Without sync-line With sync-line
Reason of Positioning Error in Dragon The ranging error caused by angle
Conclusion • We proposed COFFEE, an efficient clustering and filtering algorithm for NLOS outlier detection. • Accurate • Low complexity • Robust to the number of distance outliers. • First-Falling-Edge time synchronization improves the time synchronization probability effectively. • We developed a prototype of Dragon system, which verified the effectiveness of above designs.
Thanks a lot For your patience Visit my homepage for further information http://iiis.tsinghua.edu.cn/~yongcai