Con centric anchor beacon localization algorithm for wireless sensor networks

TitleCon centric anchor beacon localization algorithm for wireless sensor networks
Publication TypeJournal Article
Year of Publication2007
AuthorsVivekanandan, V., and V. W. S. Wong
JournalIEEE Transactions on Vehicular Technology
Volume56
Pagination2733–2744
ISSN0018-9545
Abstract

Many applications in wireless sensor networks require sensor nodes to obtain their absolute or relative geographical positions. Although various localization algorithms have been recently proposed, most of them require nodes to be equipped with range-determining hardware to obtain distance information. In this paper, we propose a concentric anchor beacon (CAB) localization algorithm for wireless sensor networks. CAB is a range-free approach and uses a small number of anchor nodes. Each anchor emits beacons at different power levels. From the information received by each beacon heard, nodes can determine in which annular ring they are located within each anchor. Each node uses the approximated center of intersection of the rings as its position estimate. We also propose two heuristics, namely CAB with Equal Area and CAB with Equal Width, to determine the transmitting power levels of the beacons. Simulation results show that the estimation error is reduced by half when anchors transmit beacons at two different power levels instead of at a single power level. CAB also gives a lower estimation error than some other range-free localization schemes (e.g., Centroid kind Approximated Point-In-Triangulation) when the anchor-to-node range ratio is less than 4.

URLhttp://dx.doi.org/10.1109/TVT.2007.899962
DOI10.1109/TVT.2007.899962

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2020 The University of British Columbia