A Selective 3-Anchor Dv-Hop Algorithm Based On The Nearest Anchor For Wireless Sensor Network

Abstract

Information of nodes’ locations is an important<br> criterion for lots of applications in Wireless Sensor Networks. In the<br> hop-based range-free localization methods, anchors transmit the<br> localization messages counting a hop count value to the whole<br> network. Each node receives this message and calculates its own<br> distance with anchor in hops and then approximates its own position.<br> However the estimative distances can provoke large error, and affect<br> the localization precision. To solve the problem, this paper proposes<br> an algorithm, which makes the unknown nodes fix the nearest anchor<br> as a reference and select two other anchors which are the most<br> accurate to achieve the estimated location. Compared to the DV-Hop<br> algorithm, experiment results illustrate that proposed algorithm has<br> less average localization error and is more effective.