Fundamental structures and asymptotic performance criteria in decentralized binary hypothesis testing

Abstract

Two fundamental distributed decision network structures are considered: the first system consists of finite number of sensors, each collecting asymptotically many data, while the second one employs asymptotically many sensors, each collecting a single datum. For binary hypothesis testing, the Neyman-Pearson criterion is utilized and justified via information theoretic arguments. An asymptotic relative efficiency performance measure is used to establish tradeoffs between the two structures, by comparing the performance characteristics of the decentralized detection systems to their centralized counterparts.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>