File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Detecting outlier measurements based on graph rigidity for wireless sensor network localization

TitleDetecting outlier measurements based on graph rigidity for wireless sensor network localization
Authors
KeywordsOutlier detection
Verifiability
Wireless sensor networks
Localization
Issue Date2013
Citation
IEEE Transactions on Vehicular Technology, 2013, v. 62, n. 1, p. 374-383 How to Cite?
AbstractA 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. © 2012 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/303410
ISSN
2023 Impact Factor: 6.1
2023 SCImago Journal Rankings: 2.714
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorYang, Zheng-
dc.contributor.authorWu, Chenshu-
dc.contributor.authorChen, Tao-
dc.contributor.authorZhao, Yiyang-
dc.contributor.authorGong, Wei-
dc.contributor.authorLiu, Yunhao-
dc.date.accessioned2021-09-15T08:25:15Z-
dc.date.available2021-09-15T08:25:15Z-
dc.date.issued2013-
dc.identifier.citationIEEE Transactions on Vehicular Technology, 2013, v. 62, n. 1, p. 374-383-
dc.identifier.issn0018-9545-
dc.identifier.urihttp://hdl.handle.net/10722/303410-
dc.description.abstractA 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. © 2012 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE Transactions on Vehicular Technology-
dc.subjectOutlier detection-
dc.subjectVerifiability-
dc.subjectWireless sensor networks-
dc.subjectLocalization-
dc.titleDetecting outlier measurements based on graph rigidity for wireless sensor network localization-
dc.typeArticle-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/TVT.2012.2220790-
dc.identifier.scopuseid_2-s2.0-84884709823-
dc.identifier.volume62-
dc.identifier.issue1-
dc.identifier.spage374-
dc.identifier.epage383-
dc.identifier.isiWOS:000318514000033-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats