Sequential Hypothesis Test with Online Usage-Constrained Sensor Selection

Shang Li, Xiaoou Li, Xiaodong Wang, Jingchen Liu

Research output: Contribution to journalArticle

Abstract

This paper investigates the sequential hypothesis testing problem with online sensor selection and sensor usage constraints. That is, in a sensor network, the fusion center sequentially acquires samples by selecting one 'most informative' sensor at each time until a reliable decision can be made. In particular, the sensor selection is carried out in the online fashion since it depends on all the previous samples at each time. Our goal is to develop the sequential test (i.e., stopping rule and decision function) and sensor selection strategy that minimize the expected sample size subject to the constraints on the error probabilities and sensor usages. To this end, we first recast the usage-constrained formulation into a Bayesian optimal stopping problem with different sampling costs for the usage-contrained sensors. The Bayesian problem is then studied under both finite- and infinite-horizon setups, based on which, the optimal solution to the original usage-constrained problem can be readily established. Moreover, by capitalizing on the structures of the optimal solution, a lower bound is obtained for the optimal expected sample size. In addition, we also propose algorithms to approximately evaluate the parameters in the optimal sequential test so that the sensor usage and error probability constraints are satisfied. Finally, numerical experiments are provided to illustrate the theoretical findings, and compare with the existing methods.

Original languageEnglish (US)
Article number8688570
Pages (from-to)4392-4410
Number of pages19
JournalIEEE Transactions on Information Theory
Volume65
Issue number7
DOIs
StatePublished - Jul 1 2019

Fingerprint

Sensors
hypothesis testing
experiment
costs
Sensor networks
Fusion reactions
Sampling
Testing
Costs
Experiments
Error probability

Keywords

  • Sequential hypothesis test
  • dynamic programming
  • online sensor selection
  • reliability
  • sensor usages

Cite this

Sequential Hypothesis Test with Online Usage-Constrained Sensor Selection. / Li, Shang; Li, Xiaoou; Wang, Xiaodong; Liu, Jingchen.

In: IEEE Transactions on Information Theory, Vol. 65, No. 7, 8688570, 01.07.2019, p. 4392-4410.

Research output: Contribution to journalArticle

Li, Shang ; Li, Xiaoou ; Wang, Xiaodong ; Liu, Jingchen. / Sequential Hypothesis Test with Online Usage-Constrained Sensor Selection. In: IEEE Transactions on Information Theory. 2019 ; Vol. 65, No. 7. pp. 4392-4410.
@article{c34f10b2d6874e6cb50f04a450bebb8e,
title = "Sequential Hypothesis Test with Online Usage-Constrained Sensor Selection",
abstract = "This paper investigates the sequential hypothesis testing problem with online sensor selection and sensor usage constraints. That is, in a sensor network, the fusion center sequentially acquires samples by selecting one 'most informative' sensor at each time until a reliable decision can be made. In particular, the sensor selection is carried out in the online fashion since it depends on all the previous samples at each time. Our goal is to develop the sequential test (i.e., stopping rule and decision function) and sensor selection strategy that minimize the expected sample size subject to the constraints on the error probabilities and sensor usages. To this end, we first recast the usage-constrained formulation into a Bayesian optimal stopping problem with different sampling costs for the usage-contrained sensors. The Bayesian problem is then studied under both finite- and infinite-horizon setups, based on which, the optimal solution to the original usage-constrained problem can be readily established. Moreover, by capitalizing on the structures of the optimal solution, a lower bound is obtained for the optimal expected sample size. In addition, we also propose algorithms to approximately evaluate the parameters in the optimal sequential test so that the sensor usage and error probability constraints are satisfied. Finally, numerical experiments are provided to illustrate the theoretical findings, and compare with the existing methods.",
keywords = "Sequential hypothesis test, dynamic programming, online sensor selection, reliability, sensor usages",
author = "Shang Li and Xiaoou Li and Xiaodong Wang and Jingchen Liu",
year = "2019",
month = "7",
day = "1",
doi = "10.1109/TIT.2019.2910730",
language = "English (US)",
volume = "65",
pages = "4392--4410",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "IEEE",
number = "7",

}

TY - JOUR

T1 - Sequential Hypothesis Test with Online Usage-Constrained Sensor Selection

AU - Li, Shang

AU - Li, Xiaoou

AU - Wang, Xiaodong

AU - Liu, Jingchen

PY - 2019/7/1

Y1 - 2019/7/1

N2 - This paper investigates the sequential hypothesis testing problem with online sensor selection and sensor usage constraints. That is, in a sensor network, the fusion center sequentially acquires samples by selecting one 'most informative' sensor at each time until a reliable decision can be made. In particular, the sensor selection is carried out in the online fashion since it depends on all the previous samples at each time. Our goal is to develop the sequential test (i.e., stopping rule and decision function) and sensor selection strategy that minimize the expected sample size subject to the constraints on the error probabilities and sensor usages. To this end, we first recast the usage-constrained formulation into a Bayesian optimal stopping problem with different sampling costs for the usage-contrained sensors. The Bayesian problem is then studied under both finite- and infinite-horizon setups, based on which, the optimal solution to the original usage-constrained problem can be readily established. Moreover, by capitalizing on the structures of the optimal solution, a lower bound is obtained for the optimal expected sample size. In addition, we also propose algorithms to approximately evaluate the parameters in the optimal sequential test so that the sensor usage and error probability constraints are satisfied. Finally, numerical experiments are provided to illustrate the theoretical findings, and compare with the existing methods.

AB - This paper investigates the sequential hypothesis testing problem with online sensor selection and sensor usage constraints. That is, in a sensor network, the fusion center sequentially acquires samples by selecting one 'most informative' sensor at each time until a reliable decision can be made. In particular, the sensor selection is carried out in the online fashion since it depends on all the previous samples at each time. Our goal is to develop the sequential test (i.e., stopping rule and decision function) and sensor selection strategy that minimize the expected sample size subject to the constraints on the error probabilities and sensor usages. To this end, we first recast the usage-constrained formulation into a Bayesian optimal stopping problem with different sampling costs for the usage-contrained sensors. The Bayesian problem is then studied under both finite- and infinite-horizon setups, based on which, the optimal solution to the original usage-constrained problem can be readily established. Moreover, by capitalizing on the structures of the optimal solution, a lower bound is obtained for the optimal expected sample size. In addition, we also propose algorithms to approximately evaluate the parameters in the optimal sequential test so that the sensor usage and error probability constraints are satisfied. Finally, numerical experiments are provided to illustrate the theoretical findings, and compare with the existing methods.

KW - Sequential hypothesis test

KW - dynamic programming

KW - online sensor selection

KW - reliability

KW - sensor usages

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

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

U2 - 10.1109/TIT.2019.2910730

DO - 10.1109/TIT.2019.2910730

M3 - Article

AN - SCOPUS:85067615807

VL - 65

SP - 4392

EP - 4410

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 7

M1 - 8688570

ER -