期刊文献+

群混合算法应用于异构传感网络节点的优化部署 被引量:6

Swarm hybrid algorithm for nodes optimal deployment in heterogeneous wireless sensor network
下载PDF
导出
摘要 针对异构传感网络节点初始随机部署时产生覆盖盲区和覆盖冗余的问题,以降低节点成本和提高网络覆盖率为目标,引入ε-目标约束法,提出一种基于粒子群算法和鱼群算法的群混合算法。该群混合算法首先建立个体中心的概念,将鱼群算法的聚群行为和追尾行为的思想引入到粒子群算法中以快速寻取个体的最优位置的解域,再利用粒子群算法对个体的速度和位置进行迭代寻优。仿真结果表明,该群混合算法与标准粒子群算法和标准鱼群算法相比,在网络覆盖率和成本目标之间能达到更好的平衡和优化。 The coverage problem is a basic problem in the wireless sensor networks, which indicates the Quality of Service (QoS) of sensing by wireless sensor networks. A lot cover blind areas and cover redundancies will be produced, when the nodes are deployed initially in the networks. A hybrid algorithm was proposed to deploy the heterogeneous network nodes reasonably to improve the coverage ratio and reduce the cost of the nodes, which introduced the ^-target constraint method based on Particle Swarm Optimization (PSO) and Fish Swarm Algorithm (FSA). The swarm hybrid algorithm firstly set up the concept of individual center, to quickly search the best solution domain of the individuals' locations, introducing the idea of the cluster behavior and tracing cauda behavior into the PSO, and then used the PSO to find the optimized speed and optimized location of the individuals. The simulation results show that the swarm hybrid algorithm is better than the standard PSO and the standard FSA in pursuing the balance and optimization between the coverage ratio and the cost of the networks.
出处 《计算机应用》 CSCD 北大核心 2012年第5期1228-1231,1239,共5页 journal of Computer Applications
基金 国家自然科学基金资助项目(61163051) 云南省应用基础研究基金资助项目(2009ZC050M) 云南省教育厅科学研究基金资助项目(08Y0093)
关键词 无线传感网络 异构 覆盖率 覆盖育区 覆盖冗余 粒子群算法 鱼群算法 Wireless Sensor Network (WSN) heterogeneous coverage ratio cover blind areas cover redundancies particle swarm algorithm fish swarm algorithm
  • 相关文献

参考文献15

二级参考文献93

共引文献1132

同被引文献46

  • 1王维彬,刘洪霞.一种面向GIS空间数据的聚类方法[J].计算机仿真,2007,24(4):66-68. 被引量:3
  • 2KENNEDY J, EBERHART R C. Particle swarm optimization[ C]// Proceedings of IEEE International Conference on Neural Networks. Piscataway: IEEE, 1995:1942-1948.
  • 3HE QIE, WANG LING. An efficient co-evolutionary particle swarm optimization for constrained engineering designed problems[ J]. Engi- neering Applications of Artificial Intelligence, 2007, 20 ( 1 ) : 89 - 99.
  • 4HEIE WANGLING Ahybndpaicleswaooptmizationwitht feasibility-based rule for constrained optimization[ J]. Applied Math] ematics and Computation, 2007, 186(2) : 1407 - 1422. [.
  • 5FARMANI R, WRIGHT J A. Self-adaptive fitness formulation forconstrained optimization [ J]. IEEE Transactions on Evolutionary Computation, 2003, 7(5): 445-455.
  • 6MEZURA-MONTES E, COELLO C A C. A simple multi-mem- bered evolution strategy to solve constrained optimization problems [ J]. IEEE Transactions on Evolutionary Computation, 2005, 9 (1): 1-17.
  • 7RUNARSSON T P, YAO X. Stochastic ranking for constrained ev- olutionary optimization [ J]. IEEE Transactions on Evolutionary Computation, 2000, 4(3): 284-294.
  • 8ZHOU YONGQUAN, PEI SHENGYU. An effective adaptive multi- objective particle swarm for muhimodal constrained function optimi- zation[J]. Journal of Computers, 2010, 5(8) : 1144 - 1151.
  • 9RUNARSSON TP, YAO X. Search biases in constrained evolution- ary optimization[ J]. IEEE Transactions on Systems, Man, Cyber- netics, 2005, 35(2): 233-243.
  • 10KALYANMOY D. Optimal design of a welded beam via genetic al- gorithms[ J]. AIAA Journal, 1991,29 ( 11 ) : 2013 - 2015.

引证文献6

二级引证文献22

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部