Decentralized Chernoff Test in Sensor Networks

Decentralized Chernoff Test in Sensor Networks
复制标题

DOI:
10.1109/isit.2018.8437755
复制
发表时间:
2018-06
期刊:
2018 IEEE International Symposium on Information Theory (ISIT)
影响因子:
--
通讯作者:
A. Rangi;M. Franceschetti;S. Maranò
A. Rangi;M. Franceschetti;S. Maranò
中科院分区:
其他
文献类型:
--
作者:
A. Rangi;M. Franceschetti;S. Maranò

文献摘要

相似文献

提出了传感器网络中分散的、序贯的、自适应的假设检验,将Chernoff的假设检验推广到分散的环境。我们证明了当单位时间的观测成本趋于零时,所提出的检验达到了与原检验相同的渐近最优性,最小化了做出决策所需的预期成本加上做出错误决策的预期成本。我们还表明,拟议的测试在通信方面是节俭的。也就是说,在每单位时间的观测成本为零的情况下,每个传感器完成测试所需的预期信道使用次数收敛到四个。
We propose a decentralized, sequential and adaptive hypothesis test in sensor networks, which extends Chernoff's test to a decentralized setting. We show that the proposed test achieves the same asymptotic optimality of the original one, minimizing the expected cost required to reach a decision plus the expected cost of making a wrong decision, when the observation cost per unit time tends to zero. We also show that the proposed test is parsimonious in terms of communications. Namely, in the regime of vanishing observation cost per unit time, the expected number of channel uses required by each sensor to complete the test converges to four.