作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2012, Vol. 38 ›› Issue (11): 100-103. doi: 10.3969/j.issn.1000-3428.2012.11.031

• 网络与通信 • 上一篇    下一篇

基于图论的WSN节点定位路径规划

党小超a,李小艳b   

  1. (西北师范大学 a. 网络教育学院;b. 数学与信息科学学院,兰州 730070)
  • 收稿日期:2011-10-15 出版日期:2012-06-05 发布日期:2012-06-05
  • 作者简介:党小超(1963-),男,教授,主研方向:无线传感器网络;李小艳,硕士研究生
  • 基金资助:
    甘肃省科技支撑计划基金资助项目(090GKCA075)

WSN Node Localization Path Planning Based on Graph Theory

DANG Xiao-chao   a, LI Xiao-yan   b   

  1. (a. College of Network Education; b. College of Mathematics & Information Science, Northwest Normal University, Lanzhou 730070, China)
  • Received:2011-10-15 Online:2012-06-05 Published:2012-06-05

摘要: 移动锚节点规划路径存在节点重复访问的问题,会影响定位精度的提高。为此,提出一种移动锚节点路径规划算法,引用图论知识,将传感器节点转化为图的顶点,并结合蚁群算法,利用图的遍历解决路径规划问题,寻找出一条路径。实验结果表明,该算法能够定位传感器节点,避免节点的重复访问,降低节点定位的误差。

关键词: 无线传感器网络, 节点定位, 移动锚节点, 路径规划, 蚁群算法, 图论

Abstract: 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.

Key words: Wireless Sensor Network(WSN), node localization, mobile anchor, path planning, ant colony algorithm, graph theory

中图分类号: