By Topic

A Novel Virtual Anchor Node-Based Localization Algorithm for Wireless Sensor Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Pengxi Liu ; Univ. of Sci. & Technol. of China, Beijing ; Xinming Zhang ; Shuang Tian ; Zhiwei Zhao
more authors

The accuracy of localization is a significant criterion to evaluate the practical utility of localization algorithm in wireless sensor networks. In mostly localization algorithms, one of the main methods to improve localization accuracy is to increase the number of anchor nodes. But the number of anchor nodes is always limited because of the hardware restrict, such as cost, energy consumption and so on. In this paper, we propose a novel algorithm with small extra logical overhead, which uses the shortest-hop path scheme to upgrade virtual anchor nodes, while the real number of physical anchors is the same as before. This algorithm firstly chooses out some special nodes from all the unknown ones to figure out more accurate positions of them, and then makes these ones as new virtual anchor nodes assist other unknowns in localizing together with the real anchors. The simulation results illustrate our algorithm has improved the accuracy of localization greatly.

Published in:

Networking, 2007. ICN '07. Sixth International Conference on

Date of Conference:

22-28 April 2007