Skip to main navigation Skip to search Skip to main content

Fusion of information for sensor self-localization by a Monte Carlo method

  • Stony Brook University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

We propose a distributed algorithm for sensor localization using beacon nodes. In this algorithm, beacon nodes broadcast distributions which contain information about their location. Nearby sensor nodes with unknown location information use this transmitted information and received beacon signal characteristics to estimate their positions. Sensors that estimate their positions become new beacons. A Monte Carlo method known as Importance Sampling is used for fusing these distributions and for obtaining approximations of the posterior distributions of the sensor locations. We also compute the Bayesian Cramér-Rao bounds for self-localization of sensors and study the impact of the beacons' prior location information and other system parameters. We analyze the performance of the proposed algorithm through computer simulations and compare it with numerically obtained bounds.

Original languageEnglish
Title of host publication2006 9th International Conference on Information Fusion, FUSION
DOIs
StatePublished - 2006
Event2006 9th International Conference on Information Fusion, FUSION - Florence, Italy
Duration: Jul 10 2006Jul 13 2006

Publication series

Name2006 9th International Conference on Information Fusion, FUSION

Conference

Conference2006 9th International Conference on Information Fusion, FUSION
Country/TerritoryItaly
CityFlorence
Period07/10/0607/13/06

Keywords

  • Bayesian Cramér-Rao bound
  • Importance sampling
  • Monte Carlo
  • Self-localization
  • Sensor networks

Fingerprint

Dive into the research topics of 'Fusion of information for sensor self-localization by a Monte Carlo method'. Together they form a unique fingerprint.

Cite this