一种适用于无线传感器网络的健壮的有序定位算法  

A Robust Ordered Localization Algorithm for Wireless Sensor Network

作　　者：季检[1] 石胜飞[1] 李建中[1] 

机构地区：[1]哈尔滨工业大学计算机科学与技术学院,哈尔滨150001

出　　处：《计算机研究与发展》2008年第1期131-137,共7页Journal of Computer Research and Development

基　　金：国家"九七三"重点基础研究发展规划基金项目(2006CB303000);国家自然科学基金重点项目(60533110);国家自然科学基金项目(60473075;60703012;60773068;60773063);国家教育部新世纪优秀人才支持计划基金项目(NCET-05-0333);黑龙江省自然科学基金重点项目(ZJG03-05);黑龙江省青年科技专项资金项目(QC06C033)~~

摘　　要：提出了一种分布式无线传感器网络有序定位算法,利用邻居节点间的测量距离和两跳邻居的坐标信息来对网络中的节点进行定位,在测量距离误差较大的情况下仍然能够比较理想地估算出节点的地理位置.先对约束条件比较多的节点进行定位,这样该节点的定位精度就比较高,一个节点得到坐标后又会引入若干约束条件,这些条件又作为定位其他节点的约束,就这样一直定位下去.实验证明此种优化手段可以显著改善定位精度.详细分析了该定位算法中采用的各种技术,并针对邻居数目和测量距离精度做了很多实验来研究其对定位结果的影响.Proposed in this paper is a distributed localization algorithm for wireless sensor network, which takes advantage of the measured distance between neighbors and the coordinates of two-hop nodes. This algorithm is very robust, and it performs well even when the measured distance error is high, which is seldom possessed by localization algorithms under similar conditions. The main idea of this algorithm is to localize the node constrained by many conditions first, so the coordinates calculated are very accurate, after that, some constraints will be incorporated, and so on. It is verified in experiment that this technique can greatly enhance the localization accuracy. This algorithm is composed of three stages. In the first stage, a routing tree is set up, so each node can communicate with root; in the second stage, each node＇s coordinates are calculated by the order determined by localization priority; in the third stage, all nodes＇ coordinates are slightly altered to minimize error. The novelty of this localization algorithm explained, in detail, and the reason and effect of each optimization technique are evaluated. The experiments are conducted mainly about the influence of average neighbor number and the distance measurement error on localization accuracy.

关 键 词：无线传感器网络 定位 有序 误差 邻居间距 

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