Abstract

In this paper, we study the source localization problem in wireless sensor networks where the location of the source is estimated according to the quantized measurements received from sensors in the field. We propose an energy efficient iterative source localization scheme, where the algorithm begins with a coarse location estimate obtained from a set of anchor sensors. Based on the available data at each iteration, we approximate the posterior probability density function (pdf) of the source location using a Monte Carlo method and we use this information to activate a number of non-anchor sensors that minimize the Conditional Posterior Crame¿r Rao Lower Bound (C-PCRLB). Then we also use the Monte Carlo approximation of the posterior pdf of the source location to compress the quantized data of each activated sensor using distributed data compression techniques. Simulation results show that the proposed iterative method achieves the mean squared error that gets close to the unconditional Posterior Crame¿r Rao Lower Bound (PCRLB) for a Bayesian estimate based on quantized data from all the sensors within a few iterations. By selecting only the most informative sensors, the iterative approach also reduces the communication requirements significantly and resulting in energy savings.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.