Beyond Triangle Inequality: Sifting Noisy and Outlier Distance Measurements for Localization

Knowing accurate positions of nodes in wireless ad-hoc and sensor networks is essential for a wide range of pervasive and mobile applications. However, errors are inevitable in distance measurements and we observe that a small number of outliers can degrade localization accuracy drastically. To deal with noisy and outlier ranging results, triangle inequality is often employed in existing approaches. Our study shows that triangle inequality has a lot of limitations which make it far from accurate and reliable. In this study, we formally define the outlier detection problem for network localization and build a theoretical foundation to identify outliers based on graph embeddability and rigidity theory. Our analysis shows that the redundancy of distance measurements plays an important role. We then design a bilateration generic cycles based outlier detection algorithm, and examine its effectiveness and efficiency through a network prototype implementation of MicaZ motes as well as extensive simulations. The results shows that our design significantly improves the localization accuracy by wisely rejecting outliers.

[1]  Polly Huang,et al.  Spinning beacons for precise indoor localization , 2008, SenSys '08.

[2]  A. Savvides,et al.  Network localization in partially localizable networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  David C. Moore,et al.  Robust distributed network localization with noisy range measurements , 2004, SenSys '04.

[4]  Ying Zhang,et al.  Robust distributed node localization with error management , 2006, MobiHoc '06.

[5]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[6]  B. Hendrickson,et al.  An Algorithm for Two-Dimensional Rigidity Percolation , 1997 .

[7]  Brian D. O. Anderson,et al.  Rigidity, computation, and randomization in network localization , 2004, IEEE INFOCOM 2004.

[8]  Brian D. O. Anderson,et al.  Localization in sparse networks using sweeps , 2006, MobiCom '06.

[9]  Yunhao Liu,et al.  Beyond Trilateration: On the Localizability of Wireless Ad Hoc Networks , 2009, IEEE/ACM Transactions on Networking.

[10]  Donggang Liu,et al.  Attack-resistant location estimation in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[11]  Yunhao Liu,et al.  Underground coal mine monitoring with wireless sensor networks , 2009, TOSN.

[12]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[13]  Yunhao Liu,et al.  Rendered Path: Range-Free Localization in Anisotropic Sensor Networks With Holes , 2007, IEEE/ACM Transactions on Networking.

[14]  Yunhao Liu,et al.  Sea Depth Measurement with Restricted Floating Sensors , 2007, 28th IEEE International Real-Time Systems Symposium (RTSS 2007).

[15]  Wade Trappe,et al.  Robust statistical methods for securing wireless localization in sensor networks , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[16]  B. Hendrickson,et al.  Regular ArticleAn Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game , 1997 .

[17]  Yunhao Liu,et al.  Sea Depth Measurement with Restricted Floating Sensors , 2007, RTSS 2007.

[18]  H. T. Kung,et al.  Localization with snap-inducing shaped residuals (SISR): coping with errors in measurement , 2009, MobiCom '09.

[19]  Tian He,et al.  Range-free localization schemes in large scale sensor network , 2003, MobiCom 2003.

[20]  Werner A. Stahel,et al.  Robust Statistics: The Approach Based on Influence Functions , 1987 .

[21]  Jie Gao,et al.  Connectivity-Based Localization of Large Scale Sensor Networks with Complex Shape , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[22]  Alex R. Berg,et al.  A proof of Connelly's conjecture on 3-connected generic cycles , 2001 .

[23]  G. Laman On graphs and rigidity of plane skeletal structures , 1970 .

[24]  Tibor Jordán,et al.  A proof of Connelly's conjecture on 3-connected circuits of the rigidity matroid , 2003, J. Comb. Theory, Ser. B.

[25]  Hari Balakrishnan,et al.  6th ACM/IEEE International Conference on on Mobile Computing and Networking (ACM MOBICOM ’00) The Cricket Location-Support System , 2022 .

[26]  S. Seidel,et al.  914 MHz path loss prediction models for indoor wireless communications in multifloored buildings , 1992 .

[27]  Tian He,et al.  Detecting Phantom Nodes in Wireless Sensor Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[28]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[29]  Bruce Hendrickson,et al.  Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..

[30]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[31]  Shaojie Tang,et al.  Canopy closure estimates with GreenOrbs: sustainable sensing in the forest , 2009, SenSys '09.

[32]  Piotr Indyk,et al.  Low-Dimensional Embedding with Extra Information , 2006, Discret. Comput. Geom..

[33]  Piotr Indyk,et al.  Low-Dimensional Embedding with Extra Information , 2004, SCG '04.