改进杂草算法求解WSN节点分布优化问题  

Improved Invasive Weed Optimization Algorithm in Sensor Deployment for Wireless Sensor Networks

作　　者：单文桃 王鑫 丁力 SHAN Wentao;WANG Xin;DING Li(School of Mechanical Engineering,Jiangsu University of Technology,Changzhou Jiangsu 213001,China)

机构地区：[1]江苏理工学院机械工程学院,江苏常州213001

出　　处：《机床与液压》2018年第22期84-88,共5页Machine Tool & Hydraulics

基　　金：国家自然科学基金青年基金(51405209);江苏省青蓝工程优秀青年骨干教师项目

摘　　要：对改进杂草算法性能及其在无线传感器网络节点分布优化问题中的应用进行研究。在保证节点相互连通的前提下,建立无线传感器网络对目标区域覆盖的数学模型,并将节点分布优化问题转换为求解函数最大值问题;通过杂草算法优越的寻优能力来实现网路节点的最优分布,在此基础上,引入立方映射混沌算子来提高算法的局部搜索能力,利用高斯变异算子来增强种群的多样性;最后,通过标准函数测试与无线网络覆盖优化仿真对该算法进行验证。仿真结果表明:该算法具有收敛速度快、鲁棒性好、数据开采能力强的优点,能有效解决无线传感器网络节点分布优化问题。The performance of improved invasive weed optimization algorithm(IIWO)and its application for coverage optimization in wireless sensor networks were discussed.On the premise that connectivity among nodes was guaranteed,a mathematical model was established to achieve the coverage of objective area with wireless sensor networks.This problem was transformed into function optimization based on this algorithm.Then,the invasive weed optimization algorithm was used to search the optimal deployment with the strong search performance.The cubic mapping chaotic operator was introduced to enhance the ability of local search and robustness,and the Gauss mutation operator was used to keep the diversity of population.Lastly,the proposed algorithm was verified through the numerical benchmark functions and coverage simulation.All the results show that the proposed algorithm has fast convergence speed,nice robustness and strong ability of data mining.Hence,it has the ability to solve the problem of deployment problem in wireless sensor networks.

关 键 词：无线传感器网络 节点分布 杂草算法 立方混沌算子 高斯变异算子 

分 类 号：TN18[电子电信—物理电子学]