Computer Science – Distributed – Parallel – and Cluster Computing
Scientific paper
2009-10-14
Computer Science
Distributed, Parallel, and Cluster Computing
Submitted to the IEEE Transactions on Signal Processing. Initial submission on May 2009. 12 pages
Scientific paper
In this correspondence, we present an algorithm for distributed sensor localization with noisy distance measurements (DILAND) that extends and makes the DLRE more robust. DLRE is a distributed sensor localization algorithm in $\mathbb{R}^m$ $(m\geq1)$ introduced in \cite{usman_loctsp:08}. DILAND operates when (i) the communication among the sensors is noisy; (ii) the communication links in the network may fail with a non-zero probability; and (iii) the measurements performed to compute distances among the sensors are corrupted with noise. The sensors (which do not know their locations) lie in the convex hull of at least $m+1$ anchors (nodes that know their own locations.) Under minimal assumptions on the connectivity and triangulation of each sensor in the network, this correspondence shows that, under the broad random phenomena described above, DILAND converges almost surely (a.s.) to the exact sensor locations.
Kar Soummya
Khan Usman A.
Moura Jose M. F.
No associations
LandOfFree
DILAND: An Algorithm for Distributed Sensor Localization with Noisy Distance Measurements does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with DILAND: An Algorithm for Distributed Sensor Localization with Noisy Distance Measurements, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and DILAND: An Algorithm for Distributed Sensor Localization with Noisy Distance Measurements will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-617498