首页> 外文期刊>Parallel and Distributed Systems, IEEE Transactions on >Sensor Placement Algorithms for Fusion-Based Surveillance Networks
【24h】

Sensor Placement Algorithms for Fusion-Based Surveillance Networks

机译:基于融合的监视网络的传感器放置算法

获取原文
获取原文并翻译 | 示例
           

摘要

Mission-critical target detection imposes stringent performance requirements for wireless sensor networks, such as high detection probabilities and low false alarm rates. Data fusion has been shown as an effective technique for improving system detection performance by enabling efficient collaboration among sensors with limited sensing capability. Due to the high cost of network deployment, it is desirable to place sensors at optimal locations to achieve maximum detection performance. However, for sensor networks employing data fusion, optimal sensor placement is a nonlinear and nonconvex optimization problem with prohibitively high computational complexity. In this paper, we present fast sensor placement algorithms based on a probabilistic data fusion model. Simulation results show that our algorithms can meet the desired detection performance with a small number of sensors while achieving up to seven-fold speedup over the optimal algorithm.
机译:关键任务目标检测对无线传感器网络提出了严格的性能要求,例如较高的检测概率和较低的误报率。数据融合已被证明是一种有效的技术,可通过在传感能力有限的传感器之间实现高效协作来提高系统检测性能。由于网络部署的成本高昂,因此需要将传感器放置在最佳位置以实现最大的检测性能。但是,对于使用数据融合的传感器网络,传感器的最佳放置是一个非线性且非凸的优化问题,其计算复杂度过高。在本文中,我们提出了一种基于概率数据融合模型的快速传感器放置算法。仿真结果表明,我们的算法可以用少量的传感器满足所需的检测性能,同时比最佳算法实现高达七倍的加速。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号