.png){kind=icon}
返回
Consensus-based Page's test in sensor networks
.png){kind=icon}
PRE
AI
DOI：10.1016/j.sigpro.2010.09.011.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Page's test is a well-known statistical technique to approach quickest detection problems, namely the detection of an abrupt change in the statistical distribution of a certain monitored phenomenon. Running consensus is a recently proposed signal processing procedure aimed at reaching agreement among the nodes of a fully flat network, and its peculiar feature is the simultaneity of two stages: that of acquiring new measurements by the sensors, and that of data fusion involving inter-sensor communications. In this paper we study a quickest detector based on the running consensus scheme, and compare it to a bank of independent Page's tests. Exploiting insights from previous studies, we propose closed-form analytical approximations of the performances of these detection schemes and address a comparison in terms of relative efficiencies. The approximated performance figures are then checked by simulation to validate the analysis and to investigate non-asymptotic scenarios. (C) 2010 Elsevier B.V. All rights reserved.
Keyword:
Quickest detection
Page's test
Running consensus
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.9K
被引数:
1.7W
机构
引用论文
Deficiency in the finger schema in relation to arithmetic disability (finger agnosia and acalculia).
PREAI
分享收藏Consensus and cooperation in networked multi-agent systems网络化多智能体系统的共识与合作.png)
PROCEEDINGS OF THE IEEE
PROCEEDINGS OF THE IEEEIF25.9
PREAI
分享收藏分享收藏
查看更多内容