期刊
IEEE TRANSACTIONS ON SIGNAL PROCESSING
卷 57, 期 10, 页码 4042-4051出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TSP.2009.2023374
关键词
Decentralized detection; error exponent; sensor networks; tree network
We study the detection performance of large scale sensor networks, configured as trees with bounded height, in which information is progressively compressed as it moves towards the root of the tree. We show that, under a Bayesian formulation, the error probability decays exponentially fast, and we provide bounds for the error exponent. We then focus on the case where the tree has certain symmetry properties. We derive the form of the optimal exponent within a restricted class of easily implementable strategies, as well as optimal strategies within that class. We also find conditions under which ( suitably defined) majority rules are optimal. Finally, we provide evidence that in designing a network it is preferable to keep the branching factor small for nodes other than the neighbors of the leaves.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据