基于单个移动信标节点的路径规划方法.PDF

37 2 Vol. 37 No. 2 第 卷第 期 计算机应用研究 录用定稿 Application Research of Computers Accepted Paper 基于单个移动信标节点的路径规划方法 乔学工，段亚青 (太原理工大学 信息与计算机学院, 太原 030024) 摘 要：在基于移动信标节点的无线传感器网络中，移动信标节点的路径规划问题直接影响定位性能，针对现有路 径规划方法没有充分考虑到网络内未知节点的分布情况，存在定位覆盖率低且网络成本高的问题，设计了一种基于 单个移动信标节点的路径规划方法，先通过网络内未知节点的分布情况，确定虚拟信标节点的位置以及数目；然后 提出了一种基于高斯递减策略的非线性动态变化收敛因子改进灰狼优化算法，用于TSP 算法求解路径规划问题，获 得移动信标节点最短移动路径。仿真结果表明，该方法有效地提高了网络内未知节点的定位覆盖率，并且有效节省 了网络成本。 关键词：无线传感器网络；移动信标节点；虚拟信标节点；灰狼优化算法；路径规划 中图分类号：TP393 doi: 10.19734/j.issn.1001-3695.2018.07.0546 Path planning method based on single mobile beacon node Qiao Xuegong, Duan Yaqing (Institute of Information Computer, Taiyuan University of Technology, Taiyuan 030024, China) Abstract: In the wireless sensor network based on mobile beacon nodes, the path planning problem of mobile beacon nodes has important influence on positioning performance . However , the existing path planning method does not take full account of the distribution of unknown nodes in the networks, the positioning efficiency is low and the cost is large . Therefore, this paper designed a path planning method of mobile beacon node : Firstly, determined the position of the virtual beacon nodes, and the number by making full use of sensor nodes distribution; then proposed the grey wolf optimization algorithm of nonlinear dynamic change convergence factor based on Gaussian decreasing strategy . This algorithm is used in the TSP algorithm to solve the path planning problem, and can obtain the shortest