| 基于图论的WSN节点定位路径规划 |
| |
| 引用本文： | 党小超,李小艳.基于图论的WSN节点定位路径规划[J].计算机工程,2012,38(11):100-103. |
| |
| 作者姓名： | 党小超 李小艳 |
| |
| 作者单位： | 1. 西北师范大学网络教育学院,兰州,730070
2. 西北师范大学数学与信息科学学院,兰州,730070 |
| |
| 基金项目： | 甘肃省科技支撑计划基金资助项目 |
| |
| 摘 要： | 移动锚节点规划路径存在节点重复访问的问题，会影响定位精度的提高。为此，提出一种移动锚节点路径规划算法，引用图论知识，将传感器节点转化为图的顶点，并结合蚁群算法，利用图的遍历解决路径规划问题，寻找出一条路径。实验结果表明，该算法能够定位传感器节点，避免节点的重复访问，降低节点定位的误差。
|
| 关 键 词： | 无线传感器网络 节点定位 移动锚节点 路径规划 蚁群算法 图论 |
| 收稿时间： | 2011-10-15 |
WSN Node Localization Path Planning Based on Graph Theory |
| |
| DANG Xiao-chao
,
LI Xiao-yan.WSN Node Localization Path Planning Based on Graph Theory[J].Computer Engineering,2012,38(11):100-103. |
| |
| Authors: | DANG Xiao-chao LI Xiao-yan |
| |
| Affiliation: | b(a.College of Network Education;b.College of Mathematics & Information Science,Northwest Normal University,Lanzhou 730070,China) |
| |
| 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. |
| |
| Keywords: | Wireless Sensor Network(WSN) node localization mobile anchor path planning ant colony algorithm graph theory |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程》浏览原始摘要信息 |
|
点击此处可从《计算机工程》下载全文 |
