Stochastic adaptive sampling for mobile sensor networks using kernel regression

Yunfei Xu, Jongeun Choi

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

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.

Original languageEnglish
Pages (from-to)778-786
Number of pages9
JournalInternational Journal of Control, Automation and Systems
Volume10
Issue number4
DOIs
Publication statusPublished - 2012 Aug 1

Fingerprint

Sensor networks
Wireless networks
Sampling
Markov processes
Probability distributions
Sensors

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Computer Science Applications

Cite this

@article{39ccc7d55c6b4a6c983a651a3e31a697,
title = "Stochastic adaptive sampling for mobile sensor networks using kernel regression",
abstract = "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.",
author = "Yunfei Xu and Jongeun Choi",
year = "2012",
month = "8",
day = "1",
doi = "10.1007/s12555-012-0414-5",
language = "English",
volume = "10",
pages = "778--786",
journal = "International Journal of Control, Automation and Systems",
issn = "1598-6446",
publisher = "Institute of Control, Robotics and Systems",
number = "4",

}

Stochastic adaptive sampling for mobile sensor networks using kernel regression. / Xu, Yunfei; Choi, Jongeun.

In: International Journal of Control, Automation and Systems, Vol. 10, No. 4, 01.08.2012, p. 778-786.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Stochastic adaptive sampling for mobile sensor networks using kernel regression

AU - Xu, Yunfei

AU - Choi, Jongeun

PY - 2012/8/1

Y1 - 2012/8/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84866082900&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866082900&partnerID=8YFLogxK

U2 - 10.1007/s12555-012-0414-5

DO - 10.1007/s12555-012-0414-5

M3 - Article

VL - 10

SP - 778

EP - 786

JO - International Journal of Control, Automation and Systems

JF - International Journal of Control, Automation and Systems

SN - 1598-6446

IS - 4

ER -