A Suboptimal Detection Arithmetic Based on Neyman-Pearson Rule and Wireless Channel in the Distributed Detection
基于聂曼-皮尔逊准则和无线信道的一种次最优分布式检测算法

In the actual detection, the wireless channels from the local detectors to fusion center usually can’t be the ideal channel, so the traditional optimal detection arithmetic based on the ideal channel is rectified accordingly. In this paper, a suboptimal detection arithmetic is studied based on non-ideal channel, using Neyman-Pearson (NP) rule the decision forms of every node are derived, according to the probability theory knowledge, the false alarm probability and the detection probability of every node are obtained, in order to maximize the detection probability restricted a constant of the false alarm probability, the iterative arithmetic is applied to find the detective threshold of every node. Finally the smulation shows that the non-ideal channel affect the detection performance of system surely.