English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

<para> 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 <emphasis emphasistype="italic"><formula formulatype="inline"><tex Notation="TeX">$\BBR ^{m}~(m\geq 1)$</tex></formula></emphasis> introduced in our previous work (<emphasis emphasistype="boldital">IEEE Trans. Signal Process.</emphasis>, vol. 57, no. 5, pp. 2000&#x2013;2016, May 2009). DILAND operates when: 1) the communication among the sensors is noisy; 2) the communication links in the network may fail with a nonzero probability; and 3) 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 <emphasis emphasistype="italic"><formula formulatype="inline"><tex Notation="TeX">$m+1$</tex></formula></emphasis> anchors (nodes that know their own locations). Under minimal assumptions on the connectivity and triangulation of each sensor in the network, we show that, under the broad random phenomena described above, DILAND converges almost surely (a.s.) to the exact sensor locations. </para>

DILAND: An Algorithm for Distributed Sensor Localization With Noisy Distance Measurements