Author Login Editor-in-Chief Peer Review Editor Work Office Work

Computer Engineering ›› 2009, Vol. 35 ›› Issue (20): 25-27. doi: 10.3969/j.issn.1000-3428.2009.20.009

• Degree Paper • Previous Articles     Next Articles

Node Localization Algorithm for WSN Based on Graph Drawing Algorithm

ZHANG Qing-guo, WANG Jing-hua   

  1. (Department of Computer Science, Huazhong Normal University, Wuhan 430079)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-10-20 Published:2009-10-20

基于画图算法的WSN节点定位算法

张清国,王敬华   

  1. (华中师范大学计算机科学系,武汉 430079)

Abstract: Aiming at the node localization problems in Wireless Sensor Network(WSN), a novel node localization algorithm for WSN based on the algorithm similar to class Kamada Kawai graph drawing algorithm is proposed. The algorithm transforms node localization problem in WSN to graph drawing problem, and uses classical graph drawing algorithms to find the optimal solution of the graph drawing problem, which finishes localization. Simulation experimental results show this algorithm converges fast and can achieve high localization accuracy and better performance.

Key words: Wireless Sensor Network(WSN), graph drawing algorithm, localization

摘要: 针对无线传感器网络的节点定位问题,提出一种新的基于类Kamada Kawai画图算法的无线传感器网络节点定位算法,将无线传感器网络节点定位问题转化成画图问题,用经典的画图算法求得问题的最优解,从而实现对节点的定位。仿真实验结果表明,该算法收敛速度快、定位精度高、能够获得较好的效果。

关键词: 无线传感器网络, 画图算法, 定位

CLC Number: