arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.3793cs.MAcs.SYeess.SYmath.OC
收藏

传感器网络的分布式分类/估计算法

A distributed classification/estimation algorithm for sensor networks

Politecnico di Torino(都灵理工大学)

Fabio Fagnani, Sophie M. Fosson, Chiara Ravazzi

AI总结:

针对传感器网络中同时分类和估计隐藏参数的问题,提出一种协同迭代算法,并证明其收敛性及在无限传感器下估计误差任意小、分类误差趋于最优集中式最大似然估计。

摘要:

本文研究了在通信受限的传感器网络中同时分类和估计隐藏参数的问题。特别地,我们考虑一个由噪声传感器组成的网络,这些传感器测量一个共同的标量未知参数。我们假设一部分节点代表故障传感器,其测量值可靠性差。每个节点的目标是同时识别其类别(故障或非故障)并估计共同参数。我们提出了一种新颖的协同迭代算法,该算法能够应对网络施加的通信约束,并表现出卓越的性能。我们的主要结果是严格证明了算法的收敛性并刻画了极限行为。我们还表明,当传感器数量趋于无穷时,共同未知参数的估计误差任意小,而分类误差收敛到最优集中式最大似然估计的分类误差。我们还展示了数值结果,验证了理论分析并支持其可能的推广。我们将我们的策略与期望最大化算法进行了比较,并讨论了在鲁棒性、收敛速度和实现简单性方面的权衡。

英文摘要:

In this paper, we address the problem of simultaneous classification and estimation of hidden parameters in a sensor network with communications constraints. In particular, we consider a network of noisy sensors which measure a common scalar unknown parameter. We assume that a fraction of the nodes represent faulty sensors, whose measurements are poorly reliable. The goal for each node is to simultaneously identify its class (faulty or non-faulty) and estimate the common parameter. We propose a novel cooperative iterative algorithm which copes with the communication constraints imposed by the network and shows remarkable performance. Our main result is a rigorous proof of the convergence of the algorithm and a characterization of the limit behavior. We also show that, in the limit when the number of sensors goes to infinity, the common unknown parameter is estimated with arbitrary small error, while the classification error converges to that of the optimal centralized maximum likelihood estimator. We also show numerical results that validate the theoretical analysis and support their possible generalization. We compare our strategy with the Expectation-Maximization algorithm and we discuss trade-offs in terms of robustness, speed of convergence and implementation simplicity.

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

↑