面向WSN的移动锚节点路径规划算法  

Path planning algorithm of mobile anchor node for WSN

作　　者：黄冰倩 杜庆治[1] 龙华[1] 

机构地区：[1]昆明理工大学信息工程与自动化学院,云南昆明650500

出　　处：《云南大学学报（自然科学版）》2018年第1期29-35,共7页Journal of Yunnan University(Natural Sciences Edition)

基　　金：云南省科技惠民计划(2014RA051)

摘　　要：针对无线传感器网络中使用移动锚节点辅助未知节点定位问题,提出了一种动态路径规划算法.该算法首先引用相关图论知识,把无线传感器网络看成一个连通的无向图,将传感器节点转化为图的顶点选取虚拟信标节点,通过蚁群算法遍历所选取的节点获得移动路径.并对传统宽度优先搜索算法中节点选取冗余和经典蚁群算法中存在的收敛速度慢等问题提出改进.仿真实验结果表明,改进算法能在保证一定通信覆盖率的情况下减少节点重复遍历以及锚节点的移动距离.A dynamic path planning method is proposed in order to solve the problem of localization in Wire- less Sensor Networks with mobile beacon.Firstly, considering the graph theory, WSN is regarded as a connected undirected graph, the sensor node is transformed into the vertex of the graph and the virtual beacon node is selected, then using the ant colony algorithm to obtain the optimal path through these virtual beacon points.This method also improves the problem of node selection redundancy in traditional breadth first search algorithm and accelerates the convergence speed in the classical ant colony algorithm.Simulation results show that the improved algorithm can reduce the repeated traversal of nodes and shorten the moving distance of anchor nodes under the condition of ensuring a certain coverage rate.

关 键 词：移动锚节点 无线传感器网络 宽度优先搜索算法 蚁群算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]