Detecting Outlier Measurements Based on Graph Rigidity for Wireless Sensor Network Localization
Authors:
- 28 September 2012
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Vehicular Technology
- Vol. 62 (1) , 374-383
Abstract
A majority of localization approaches for wireless sensor networks rely on the measurements of internode distance. Errors are inevitable in distance measurements, and we observe that a small number of outliers can drastically degrade localization accuracy. To deal with noisy and outlier ranging results, a straightforward method, known as triangle inequality, has often been employed in previous studies. However, triangle inequality has its own limitations that make it far from accurate and reliable. In this paper, we first analyze how much information is needed to identify outlier measurements. Applying the rigidity theory, we propose the concept of verifiable edges and derive the conditions for an edge to be verifiable. On this basis, we design a localization approach with outlier detection, which explicitly eliminates ranges with large errors before location computation. Considering the entire network, we define verifiable graphs in which all edges are verifiable. If a wireless network meets the requirements of graph verifiability, it is not only localizable but outlier resistant as well. Extensive simulations are conducted to examine the effectiveness of the proposed approach. The results show remarkable improvement in location accuracy by sifting outliers.Keywords
This publication has 30 references indexed in Scilit:
- How long to wait?2012
- Understanding Node Localizability of Wireless Ad Hoc and Sensor NetworksIEEE Transactions on Mobile Computing, 2011
- Localization in non-localizable sensor and ad-hoc networks: A Localizability-aided approach2011
- Delay and Capacity Tradeoff Analysis for MotionCastIEEE/ACM Transactions on Networking, 2011
- Opportunity-Based Topology Control in Wireless Sensor NetworksIEEE Transactions on Parallel and Distributed Systems, 2009
- A sufficient connectivity condition for generic rigidity in the planeDiscrete Applied Mathematics, 2009
- Wireless sensor network localization techniquesComputer Networks, 2007
- Rigidity, computation, and randomization in network localization2005
- The Cricket location-support system2000
- On Generic Rigidity in the PlaneSIAM Journal on Algebraic Discrete Methods, 1982