检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]四川大学数学学院,成都610064
出 处:《四川大学学报(自然科学版)》2018年第1期7-12,共6页Journal of Sichuan University(Natural Science Edition)
基 金:国家自然科学基金(61473197)
摘 要:无线传感器网络通常具有带宽限制和能量约束,这就涉及到传感器的选择问题,即如何在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 p out of n 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 effi- cient since it has lower computation complexity. Simulations also illustrate that the global optimum can be reached in most cases.
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.33