arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1610.09020math.OC
收藏

处理坏苹果:通过分布式松弛法的鲁棒的基于范围的网络定位

Dealing with bad apples: Robust range-based network localization via distributed relaxation methods

Cláudia Soares, João Gomes

摘要:

现实世界的网络应用程序必须应对失败的节点,恶意攻击,或者,不知何故,节点面临损坏的数据-分类为离群值。一个使能应用是网络节点的地理定位。然而,尽管在网络定位问题上做了出色的工作,以前的研究很少考虑离群数据-即使是现在,当已经部署的网络迫切需要强大的程序。我们提出了强大的,快速的,分布式网络定位算法,弹性高功率噪声,但也精确下,经常高斯噪声。我们使用的Huber M-估计作为估计的节点和噪声范围测量的距离之间的差异措施,从而获得一个强大的(但非凸)最优化问题。然后,我们设计了一个凸低估在多项式时间内可解,并紧在节点间的条款。我们还提供了一个凸低估的最优界。我们提出了一种新的表示与规范组成的Huber函数,使分布式鲁棒定位算法,以尽量减少建议低估。对于给定的精度,同步分布式方法具有最佳的收敛速度,异步分布式方法在有限时间内收敛。我们的贡献的主要亮点在于这样一个事实,即我们不付出任何代价的分布式计算,也不是在准确性,也不是在通信成本或收敛速度。仿真结果表明,使用我们提出的算法的优势,无论是在存在离群值和常规高斯噪声:我们的方法超过了一个替代的鲁棒性方法的基础上L1规范的准确性至少100米,在1公里的面积边。

英文摘要:

Real-world network applications must cope with failing nodes, malicious attacks, or, somehow, nodes facing corrupted data --- classified as outliers. One enabling application is the geographic localization of the network nodes. However, despite excellent work on the network localization problem, prior research seldom considered outlier data --- even now, when already deployed networks cry out for robust procedures. We propose robust, fast, and distributed network localization algorithms, resilient to high-power noise, but also precise under regular Gaussian noise. We use the Huber M-estimator as a difference measure between the distance of estimated nodes and noisy range measurements, thus obtaining a robust (but nonconvex) optimization problem. We then devise a convex underestimator solvable in polynomial time, and tight in the inter-node terms. We also provide an optimality bound for the convex underestimator. We put forward a new representation of the Huber function composed with a norm, enabling distributed robust localization algorithms to minimize the proposed underestimator. The synchronous distributed method has optimal convergence rate and the asynchronous one converges in finite time, for a given precision. The main highlight of our contribution lies on the fact that we pay no price for distributed computation nor in accuracy, nor in communication cost or convergence speed. Simulations show the advantage of using our proposed algorithms, both in the presence of outliers and under regular Gaussian noise: our method exceeds the accuracy of an alternative robust approach based on L1 norms by at least 100m in an area of 1Km sides.

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

↑