王建华, 史明岳, 王婷婷. 基于量子粒子群算法的移动节点覆盖优化[J]. 微电子学与计算机, 2012, 29(6): 96-99,103.
引用本文: 王建华, 史明岳, 王婷婷. 基于量子粒子群算法的移动节点覆盖优化[J]. 微电子学与计算机, 2012, 29(6): 96-99,103.
WANG Jian-hua, SHI Ming-yue, WANG Ting-ting. Coverage Optimization of Dynamic Nodes Based on Quantum-Behaved Particle Swarm Algorithm[J]. Microelectronics & Computer, 2012, 29(6): 96-99,103.
Citation: WANG Jian-hua, SHI Ming-yue, WANG Ting-ting. Coverage Optimization of Dynamic Nodes Based on Quantum-Behaved Particle Swarm Algorithm[J]. Microelectronics & Computer, 2012, 29(6): 96-99,103.

基于量子粒子群算法的移动节点覆盖优化

Coverage Optimization of Dynamic Nodes Based on Quantum-Behaved Particle Swarm Algorithm

  • 摘要: 提出了基于量子粒子群的无线传感器网络覆盖优化算法.由于在量子空间中粒子满足集聚态性质完全不同,使得该算法可以在整个可行区域内搜索.全局搜索能力远远优干基本粒子群,克服了粒子群算法容易陷入局部最优的缺点.仿真结果表明,该算法比基本粒子群算法拥有更好的覆盖优化效果。

     

    Abstract: An optimization method of wireless sensor networks coverage based on quantum-behaved particle swarm optimization(QPSO) is proposed in this paper.The aggregation characteristic of every particle in the quantum space is unique,so the algorithm can search throughout the entire feasible region.Thus the QPSO.of which global search ability is much better than PSO.can avoid the disadvantages of being easily trapped into a local extremum. Simulation results show that the proposed algorithm is superior to particle swarm optimization in coverage optimization.

     

/

返回文章
返回