arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0910.2743cs.DCcs.ITmath.IT
收藏

DILAND:一种带噪声距离测量的分布式传感器定位算法

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

Usman A. Khan, Soummya Kar, Jose M. F. Moura

摘要:

在这种对应关系中,我们提出了一种算法,分布式传感器定位与噪声距离测量(DILAND)的扩展,使DLRE更强大。DLRE是$\mathbb{R}^m$ $(m\geq1)$中的分布式传感器定位算法,在\cite{usman_loctsp:08}中引入。DILAND在以下情况下运行:(i)传感器之间的通信有噪声;(ii)网络中的通信链路可能以非零概率失败;以及(iii)为计算传感器之间的距离而执行的测量被噪声破坏。传感器(不知道它们的位置)位于至少$m+1$锚(知道它们自己的位置的节点)的凸包中。在对网络中每个传感器的连通性和三角测量的最小假设下,这种对应关系表明,在上述广泛的随机现象下,DILAND几乎肯定收敛(a.s.)精确的传感器位置

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑