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

计算机工程 ›› 2008, Vol. 34 ›› Issue (3): 12-14,1. doi: 10.3969/j.issn.1000-3428.2008.03.005

• 博士论文 • 上一篇    下一篇

无线传感器网络抽样定位和求精算法

于 宁1,万江文2   

  1. (1. 北京邮电大学自动化学院,北京 100876;2. 北京航空航天大学仪器科学与光电工程学院,北京 100083)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2008-02-05 发布日期:2008-02-05

Sampling Localization and Refinement Algorithm for Wireless Sensor Networks

YU Ning1, WAN Jiang-wen2   

  1. (1. Automation School, Beijing University of Posts and Telecommunications, Beijing 100876; 2. School of Instrument Science & Opto-electronics Engineering, Beijing University of Aeronautics and Astronautics, Beijing 100083)
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-02-05 Published:2008-02-05

摘要: 定位技术是无线传感器网络的支撑技术之一。针对无线传感器网络低成本、低能耗的要求,提出一种抽样定位和求精的分布式算法。算法在第1阶段基于收到的锚节点信息进行抽样,形成节点的初始位置估计。在第2阶段对节点初始位置进行求精。仿真实验结果显示了该定位算法可以在1~2次求精情况下达到收敛,在样本量为20左右的较低阈值下实现较高的定位精度,在12%左右的锚节点比例下实现95%以上的定位覆盖率,并且与dv-hop和dv-distance定位算法比较,证明该算法分别可以提高20%和5%的定位精度。

关键词: 无线传感器网络, 定位, 抽样定位, 求精算法

Abstract: Localization is one of the supporting technologies in wireless sensor networks. In this paper, a novel sampling localization and refinement distributed algorithm is described and evaluated. The algorithm includes two stages. In first stage, sampling is carried out based on received anchor information and the initial position estimate of sensor node comes into being. In second stage, the initial node position is refined. Simulation results show this algorithm is convergent under 1~2 refinement times and achieves high localization accuracy in low sample size threshold as 20. It also gets 95% localization coverage when anchor ratio is about 12%. Comparing with dv-hop and dv-distance methods, it improves localization accuracy by 20% and 5%.

Key words: wireless sensor networks, localization, sampling localization, refinement algorithm

中图分类号: