无线传感器网络通常具有带宽限制和能量约束，这就涉及到一个很重要的传感器选择问题. 即如何在 n 个传感器中选取 p 个，使得仅由这 p 个传感器的观测进行假设检验时，虚警率达到最小. 这类问题已被证明是 NP 难的. 本文将该问题松弛成一个易处理的新问题，并提出了一个可以达到新问题 KKT点的高效算法. 通过与已有的算法比较复杂度，本文提出的算法效率更高. 同时仿真结果也表明，大多数情况下我们提出的算法均可达到全局最优解.
The well-known sensor selection issue is of great significance in wireless sensor network. We aim at selecting a subset of out of sensors to conduct the corresponding hypothesis test based on their observations such that the false alarm rate attains the minimum, which has been proved to be NP hard. In this paper, we relax the original problem to a tractable one and propose a new algorithm, which can achieve the KKT point. Moreover, compared with the existing algorithm, our algorithm is more efficient since it has lower computation complexity. Simulations also illustrate that the global optimum can be reached in most cases.
引用本文格式： 钱博,马婷,宋恩彬. 无线传感器网络中假设检验的传感器选择问题[J]. 四川大学学报: 自然科学版, 2018, 55: 0007.复制