Robust Interval-Based Localization Algorithms for Mobile Sensor Networks

Farah Mourad, Hichem Snoussi, Michel Kieffer and Cédric Richard

International Journal of Distributed Sensor Networks, 2011, vol. 8, issue 1, 303895

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, that is, 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.

Date: 2011
References: Add references at CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1155/2012/303895 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:8:y:2011:i:1:p:303895

DOI: 10.1155/2012/303895

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().