一种基于加权处理的无线传感器网络平均跳距离估计算法

刘锋; 张翰; 杨骥

doi:10.3724/SP.J.1146.2007.00735

一种基于加权处理的无线传感器网络平均跳距离估计算法

doi: 10.3724/SP.J.1146.2007.00735

基金项目:

国家自然科学基金(60502017, 60532030, 60625102)和航天支撑技术基金资助项目

计量
- 文章访问数: 3410
- HTML全文浏览量: 113
- PDF下载量: 1381
- 被引次数: 0
出版历程
- 收稿日期: 2007-05-15
- 修回日期: 2008-03-08
- 刊出日期: 2008-05-19

An Average One-hop Distance Estimation Algorithm Based on Weighted Disposal in Wireless Sensor Network

摘要

摘要: 定位技术是无线传感器网络的关键技术之一,传统DV-Hop定位算法只考虑了最近一个锚节点估计的平均跳距离值,而单个锚节点估计的平均跳距离值无法准确地反映网络的实际平均跳距离。本文提出了一种基于加权处理的平均跳距离估计算法,考虑多个锚节点估计的平均跳距离值,根据距离未知节点的跳数进行加权,使网络平均跳距离的估计更加准确,从而提高定位精度。仿真结果表明,与DV-Hop算法的平均跳距离估计算法相比,本文算法更准确地估计平均跳距离,降低了均方根误差,并提高了定位精度。
- 无线传感器网络; 平均跳距离; 定位; DV-Hop
Abstract: Localization is one of the key technologies in wireless sensor network. Only the average one-hop distance estimated by the nearest anchor was used in DV-Hop localization algorithm, but the value estimated by a single anchor can not reflect the whole networks actual average one-hop distance. A novel algorithm is proposed to estimate the average one-hop distance based on weighted disposal. The average one-hop distance estimated by several anchors is used in this algorithm and assigned different weights according to the hops to the unknown node. The unknown nodes average one-hop distance is estimated more accurate and the localization precision is improved. Simulation results demonstrate that the average one-hop distance is estimated more exactly in the proposed algorithm than that of DV-Hop, the root mean square error is decreased and the location precision is improved.

HTML全文

参考文献(1)

Arampatzis Th, Lygeros J, and Manesis S. A survey ofapplications of wireless sensors and wireless sensornetworks[C]. Proceedings of the IEEE InternationalSymposium on Mediterrean Conference on Control andAutomation, Limassol, Cyprus, 2005: 719-724.[2]任丰原, 黄海宁, 林闯. 无线传感器网络[J]. 软件学报, 2003,14(7): 1282-1290.Ren Feng-yuan, Huang Hai-ning, and Lin Chuang. Wirelesssensor network[J]. Journal of Software, 2003, 14(7): 1282-1290.[3]Akyildiz I F, Weilian Su, and Sankarasubramaniam Y, et al..A survey on sensor networks[J]. IEEE CommunicationsMagazine, 2002, 40(8): 102-114.[4]杨冕, 秦前清. 对传感器网络定位技术现状的研究[J]. 微机发展, 2005, 15(3): 26-28.Yang Mian and Qing Qian-qing. Research on currentlocalization technology of sensor networks[J]. MicrocomputerDevelopment, 2005, 15(3): 26-28.[5]Niculescu D. Positioning in Ad hoc sensor networks[J]. IEEENetwork, 2004, 18(4): 24-29.[6]史龙, 王福豹, 段渭军等. 无线传感器网络Range-Free自身定位机制与算法[J]. 计算机工程与应用, 2004, 40(23): 127-130.Shi Long, Wang Fu-bao, and Duan Wei-jun, et al.. Range-freeself-localization mechanicsm and algorithm for wirelessssensor networks[J]. Computer Engineering and Applications,2004, 40(23): 127-130.[7]Nicolescu D and Nath B. Ad-hoc positioning systems (APS)[C]. IEEE GLOBECOM '01, 2001, San Antonio, Texas, Vol.5:2926-2931.[8]Niculescu D and Nath B. DV based positioning in Ad hocnetworks [J].Journal of Telecommunication Systems.2003,22(1-4):267-280[9]Andreas S, Han Chih-Chieh, and Strivastava M B. Dynamicfine-grained kocalization in Ad-hoc networks of sensors [C].ACM SIGMOBILE 01, Rome, Italy, 2001: 166-179.[10]Doherty L, Pister K S J, and Ghaoui L E. Convex positionestimation in wireless sensor networks[C]. Proc. of the IEEEINFOCOM 2001, 2001, Anchorage, Alaska, Vol 3: 1655-1663.[11]Entenmann R C. A circuit for finding the root mean square[J].Proc. IEEE, 1964, 52(2): 193.

施引文献

资源附件(0)

访问统计