By Topic

A lower bound on expected localization error in wireless sensor network

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

4 Author(s)
Ma Di ; Sch. of EEE, NTU, Singapore, Singapore ; Er Meng Joo ; Lim Hock Beng ; Wang Bang

Localization is an important research problem in WSNs (wireless sensor networks) and many WSN localization algorithms have been proposed in the literature. For a single sensor node whose anchors' positions are known, the location estimation error lower bound can be computed by using the CRLB (Cramer-Rao Lower Bound). However, it is still unclear to the research community what the localization error lower bound is from a network point of view. In this paper, we derive a lower bound of the expected localization error for a network whose sensor nodes and anchors are randomly distributed according to a Poisson point process. We show that the lower bound of the expected localization error for a network is a function of the anchor density and the variance of anchor-to-sensor distance measurements.

Published in:

Control Automation Robotics & Vision (ICARCV), 2010 11th International Conference on

Date of Conference:

7-10 Dec. 2010