Abstract
We propose algorithms for distributed sensor self-localization using beacon nodes. These beacon nodes broadcast some information which describes their positions. The sensor nodes with unknown location information utilize these descriptions along with the characteristics of received signals to obtain estimates of their positions. Sensors with resolved positions, in the successive stages of the algorithm also broadcast their location information to other sensors so that they can resolve their own positions. Conditional upon the availability of probabilistic distributions of noise processes, we propose iterative and Monte Carlo sampling-based methods for obtaining sensor location descriptions. We also provide approximate hybrid Cramér-Rao bounds for distributed sensor self-localization and compare them with the proposed algorithms. We demonstrate the performance of the proposed algorithms through extensive computer simulations.
| Original language | English |
|---|---|
| Pages (from-to) | 1144-1154 |
| Number of pages | 11 |
| Journal | Signal Processing |
| Volume | 89 |
| Issue number | 6 |
| DOIs | |
| State | Published - Jun 2009 |
Keywords
- Cramér-Rao bounds
- Least squares
- Localization
- Monte Carlo methods
Fingerprint
Dive into the research topics of 'Sensor self-localization with beacon position uncertainty'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver