TY - GEN
T1 - A Monte Carlo based energy efficient source localization method for wireless sensor networks
AU - Masazade, Engin
AU - Niu, Ruixin
AU - Varshney, Pramod K.
AU - Keskinoz, Mehmet
PY - 2009
Y1 - 2009
N2 - 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 Cramé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 Cramé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.
AB - 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 Cramé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 Cramé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.
UR - http://www.scopus.com/inward/record.url?scp=77951120726&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951120726&partnerID=8YFLogxK
U2 - 10.1109/CAMSAP.2009.5413257
DO - 10.1109/CAMSAP.2009.5413257
M3 - Conference contribution
AN - SCOPUS:77951120726
SN - 9781424451807
T3 - CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing
SP - 364
EP - 367
BT - CAMSAP 2009 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing
T2 - 2009 3rd IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2009
Y2 - 13 December 2009 through 16 December 2009
ER -