Consensus in Ad Hoc WSNs With Noisy Links—Part II: Distributed Estimation and Smoothing of Random Signals
From MaRDI portal
Publication:4568630
Cited in
(14)- Correction to “Mean square convergence of consensus algorithms in random WSNs” [May 10 2866-2874]
- Performance analysis of the consensus-based distributed LMS algorithm
- Time averaging algorithms with stopping rules for multi-agent consensus with noisy measurements
- A recursive maximum a posteriori estimator
- The incremental subgradient methods on distributed estimations in-network
- An improved convergence guarantee for the gradient-push algorithm with a constant stepsize
- Mean Square Convergence of Consensus Algorithms in Random WSNs
- Model based peer-to-peer estimator over wireless sensor networks with lossy channels
- Resource-efficient and secure distributed state estimation over wireless sensor networks: a survey
- Distributed LMS estimation over networks with quantised communications
- Improving the convergence of distributed gradient descent via inexact average consensus
- On the convergence result of the gradient-push algorithm on directed graphs with constant stepsize
- Consensus in Ad Hoc WSNs With Noisy Links—Part I: Distributed Estimation of Deterministic Signals
- Analysis of incremental augmented affine projection algorithm for distributed estimation of complex-valued signals
This page was built for publication: Consensus in Ad Hoc WSNs With Noisy Links—Part II: Distributed Estimation and Smoothing of Random Signals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568630)