首页> 外文期刊>International Journal of Distributed Sensor Networks >A Self-Adaptive Particle Swarm Optimization Based Multiple Source Localization Algorithm in Binary Sensor Networks
【24h】

A Self-Adaptive Particle Swarm Optimization Based Multiple Source Localization Algorithm in Binary Sensor Networks

机译:二进制传感器网络中基于自适应粒子群优化的多源定位算法

获取原文
获取外文期刊封面目录资料

摘要

With the development of wireless communication and sensor techniques, source localization based on sensor network is getting more attention. However, fewer works investigate the multiple source localization for binary sensor network. In this paper, a self-adaptive particle swarm optimization based multiple source localization method is proposed. A detection model based on Neyman-Pearson criterion is introduced. Then the maximum likelihood estimator is employed to establish the objective function which is used to estimate the location of sources. Therefore, the multiple-source localization problem is transformed into optimization problem. In order to improve the ability of global search of particle swarm optimization, the self-adaptive particle swarm optimization is used to solve this problem. Various simulations have been conducted, and the results show that the proposed method owns higher localization accuracy in comparison with other methods.
机译:随着无线通信和传感器技术的发展,基于传感器网络的源定位越来越受到重视。但是,很少有研究调查二进制传感器网络的多源定位。提出了一种基于自适应粒子群算法的多源定位方法。介绍了一种基于Neyman-Pearson准则的检测模型。然后,采用最大似然估计器建立目标函数,该目标函数用于估计源的位置。因此,将多源定位问题转化为优化问题。为了提高粒子群优化算法的全局搜索能力,采用自适应粒子群算法解决了这一问题。进行了各种仿真,结果表明,与其他方法相比,该方法具有更高的定位精度。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号