Localization algorithm with on-line path loss estimation and node selection

Research output: Contribution to journalArticleResearchpeer-review

19 Citations (Scopus)

Abstract

RSS-based localization is considered a low-complexity algorithm with respect to other range techniques such as TOA or AOA. The accuracy of RSS methods depends on the suitability of the propagation models used for the actual propagation conditions. In indoor environments, in particular, it is very difficult to obtain a good propagation model. For that reason, we present a cooperative localization algorithm that dynamically estimates the path loss exponent by using RSS measurements. Since the energy consumption is a key point in sensor networks, we propose a node selection mechanism to limit the number of neighbours of a given node that are used for positioning purposes. Moreover, the selection mechanism is also useful to discard bad links that could negatively affect the performance accuracy. As a result, we derive a practical solution tailored to the strict requirements of sensor networks in terms of complexity, size and cost. We present results based on both computer simulations and real experiments with the Crossbow MICA2 motes showing that the proposed scheme offers a good trade-off in terms of position accuracy and energy efficiency.
Original languageEnglish
Pages (from-to)6905-6925
JournalSensors
Volume11
DOIs
Publication statusPublished - 1 Jul 2011

Keywords

  • Cooperative
  • Distributed
  • Localization
  • Received signal strength (RSS)
  • Wireless sensor networks

Fingerprint Dive into the research topics of 'Localization algorithm with on-line path loss estimation and node selection'. Together they form a unique fingerprint.

Cite this