Journal
INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS
Volume 10, Issue 4, Pages 778-786Publisher
INST CONTROL ROBOTICS & SYSTEMS, KOREAN INST ELECTRICAL ENGINEERS
DOI: 10.1007/s12555-012-0414-5
Keywords
Fastest mixing reversible markov chain; mobile sensor networks; stochastic adaptive sampling
Categories
Funding
- National Science Foundation through CAREER Award [CMMI-0846547]
- Directorate For Engineering
- Div Of Civil, Mechanical, & Manufact Inn [0846547] Funding Source: National Science Foundation
Ask authors/readers for more resources
In this paper, we provide a stochastic adaptive sampling strategy for mobile sensor networks to estimate scalar fields over surveillance regions using kernel regression, which does not require a priori statistical knowledge of the field. Our approach builds on a Markov Chain Monte Carlo (MCMC) algorithm, viz., the fastest mixing Markov chain under a quantized finite state space, for generating the optimal sampling probability distribution asymptotically. The proposed adaptive sampling algorithm for multiple mobile sensors is numerically evaluated under scalar fields. The comparison simulation study with a random walk benchmark strategy demonstrates the excellent performance of the proposed scheme.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available