Robust Interval-Based Localization Algorithms for Mobile Sensor Networks

Abstract : This paper considers the localization problem in mobile sensor networks. Such a problem is a challenging task, especially when measurements exchanged between sensors may contain outliers, \textit{i.e.}, data not matching the observation model. This paper proposes two algorithms robust to outliers. These algorithms perform a set-membership estimation, where only the maximal number of outliers is required to be known. Using these algorithms, estimates consist of sets of boxes whose union surely contains the correct location of the sensor, provided that the considered hypotheses are satisfied. This paper proposes as well a technique for evaluating the number of outliers to be robust to. In order to corroborate the efficiency of both algorithms, a comparison of their performances is performed in simulations using Matlab.
Complete list of metadatas

Cited literature [23 references]  Display  Hide  Download

https://hal-supelec.archives-ouvertes.fr/hal-00727777
Contributor : Michel Kieffer <>
Submitted on : Tuesday, September 4, 2012 - 1:24:15 PM
Last modification on : Thursday, October 17, 2019 - 12:36:54 PM
Long-term archiving on : Wednesday, December 5, 2012 - 10:13:32 AM

File

Article_1col.pdf
Files produced by the author(s)

Identifiers

Citation

Farah Mourad, Hichem Snoussi, Michel Kieffer, Cédric Richard. Robust Interval-Based Localization Algorithms for Mobile Sensor Networks. International Journal of Distributed Sensor Networks, Hindawi Publishing Corporation, 2012, 2012, Article ID 303895, 7 p. ⟨10.1155/2012/303895⟩. ⟨hal-00727777⟩

Share

Metrics

Record views

666

Files downloads

355