辅助定位信标节点的移动路径规划算法研究

发布时间：2018-02-22 10:13

本文关键词： 无线传感网传感节点位置路径规划　出处：《工程科学与技术》2017年02期 　论文类型：期刊论文

【摘要】：为快速实现监控区域内所有传感节点的定位,利用辅助定位信标节点的移动,提出无线传感网中辅助定位信标节点的移动路径规划算法(MPPA)。在MPPA算法中,考虑由多个六边形网格组成的监控区域,分析sink节点的移动特点,考虑其移动路径中停留位置只是六边形网格的顶点和中心,不在同一位置停留,相邻3个停留位置不共线以及每一个网格至少被3个以上不同停留位置覆盖等约束条件,提出信标节点的移动路径约束和传感节点定位约束,并建立其移动路径规划模型。根据邻居停留位置的信息素浓度决定下一个停留位置,根据蚂蚁选择的路径释放和挥发信息素。经过蚁群算法的多次迭代,可获知能覆盖所有网格的信标节点最优移动路径。信标节点沿着该路径移动时,传感节点可获知信标节点的不同位置信息,收集通信时的RSSI值,采用Kalman滤波算法降低通信噪声,采用最大似然估计算法计算自身位置坐标。仿真结果表明:MPPA算法可根据网格中心和顶点的位置,收敛于移动距离最短且能实现监控区域任何位置上传感节点定位的最优移动路径。MPPA算法降低了信标节点的移动路径长度和停留位置个数,降低了网络启动后所有传感节点获知自身位置所需要的时间,并将传感节点平均定位误差保持在较低的水平。在一定的条件下,MPPA算法比SCAN、DOUBLE_SCAN、HILBERT、CIRCLES和ZSCAN算法更优。
[Abstract]:In order to realize the localization of all sensor nodes in the monitoring area quickly, a mobile path planning algorithm for the auxiliary location beacon nodes in wireless sensor networks is proposed by using the auxiliary location beacon node movement. In the MPPA algorithm, Considering the monitoring area composed of several hexagonal meshes and analyzing the moving characteristics of sink nodes, considering that the moving path is only the vertex and center of the hexagonal grid, and not staying in the same position, The moving path constraints of beacon nodes and sensor node location constraints are proposed for each grid which is not collinear and each grid is covered by at least three different residence positions. Based on the pheromone concentration of neighbor's residence position, the next location is determined, and the release and volatilization pheromone are obtained according to the path chosen by ant. After several iterations of ant colony algorithm, the model of moving path planning is established. When the beacon node moves along the path, the sensor node can get the different location information of the beacon node, collect the RSSI value of the beacon node, and adopt the Kalman filter algorithm to reduce the communication noise. The maximum likelihood estimation algorithm is used to calculate the coordinates of its own position. The simulation results show that the proportion MPPA algorithm can be based on the location of the center and vertex of the grid. The optimal mobile path. MPPA algorithm, which converges to the shortest moving distance and can realize the location of sensor nodes in any position in the monitoring area, reduces the length of moving path and the number of residence positions of beacon nodes. It reduces the time required for all sensor nodes to know their position after the network is started and keeps the average positioning error of sensor nodes at a lower level. Under certain conditions the MPPA algorithm is better than the SCAN-DOUBLEE algorithm and the ZSCAN algorithm is better than the SCAN-DOUBLEE algorithm.
【作者单位】：浙江树人大学信息科技学院;常州大学信息科学与工程学院;
【基金】：国家自然科学基金资助项目(61501403) 浙江省自然科学基金资助项目(LY15F030004) 浙江省公益性技术应用研究计划项目资助(2016C33038)
【分类号】：TP212.9;TN929.5

【相似文献】