摘要
移动锚节点规划路径存在节点重复访问的问题,会影响定位精度的提高。为此,提出一种移动锚节点路径规划算法,引用图论知识,将传感器节点转化为图的顶点,并结合蚁群算法,利用图的遍历解决路径规划问题,寻找出一条路径。实验结果表明,该算法能够定位传感器节点,避免节点的重复访问,降低节点定位的误差。
The mobile anchor node planning path exists the node access repetition,and can not improve the localization accuracy.In order to solve this problem,this paper puts forward Mobile Anchor node Path Planning（MAPP） algorithm,quotes the graph theory knowledge,translates sensor nodes into figure vertices,and combines with the ant colony algorithm,uses graph traversal to solve the problem of path planning,looks for a path.Experimental results show that the algorithm can locate the whole sensor nodes,meanwhile avoid the repetition of access,and reduce nodes localization error.
出处
《计算机工程》
CAS
CSCD
2012年第11期100-103,共4页
Computer Engineering
基金
甘肃省科技支撑计划基金资助项目(090GKCA075)
关键词
无线传感器网络
节点定位
移动锚节点
路径规划
蚁群算法
图论
Wireless Sensor Network（WSN）
node localization
mobile anchor
path planning
ant colony algorithm
graph theory
