By Topic

A localization algorithm with learning-based distances

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

2 Author(s)
DuyBach Bui ; Auto-ID Lab. Korea, Inf. & Commun. Univ., Daejeon, South Korea ; Daeyoung Kim

Existing range-based localization algorithms are superior only when a high accuracy node-to-node measured distance exists. This assumption is actually difficult to satisfy with current ranging techniques used in tiny sensor nodes. Meanwhile, range-free localization algorithms work independently of ranging error but can only produce limited node accuracy. In this paper, we propose a novel localization scheme that uses a learning-based distance function to estimate distances. The adaptation of distance function to ranging error and other network conditions, i.e., network density, number of anchor, results in better estimated distances. This leads to more accurate position calculation comparing to existing works, especially when ranging error is high.

Published in:

Computer Communications and Networks, 2005. ICCCN 2005. Proceedings. 14th International Conference on

Date of Conference:

17-19 Oct. 2005