Distributed Estimation Via Random Access
From MaRDI portal
Publication:3604443
Abstract: The problem of hypothesis testing against independence for a Gauss-Markov random field (GMRF) is analyzed. Assuming an acyclic dependency graph, an expression for the log-likelihood ratio of detection is derived. Assuming random placement of nodes over a large region according to the Poisson or uniform distribution and nearest-neighbor dependency graph, the error exponent of the Neyman-Pearson detector is derived using large-deviations theory. The error exponent is expressed as a dependency-graph functional and the limit is evaluated through a special law of large numbers for stabilizing graph functionals. The exponent is analyzed for different values of the variance ratio and correlation. It is found that a more correlated GMRF has a higher exponent at low values of the variance ratio whereas the situation is reversed at high values of the variance ratio.
Recommendations
Cited in
(10)- Performance of Distributed Estimation Over Unknown Parallel Fading Channels
- Linear coherent distributed estimation over unknown channels
- On Decentralized Estimation With Active Queries
- Statistical estimation of access frequencies in data broadcasting
- Random-structure distributed estimation systems
- Selective Measurement Transmission in Distributed Estimation With Data Association
- Distributed Linear Estimation Via a Roaming Token
- Distributed source-user estimation over directed graphs
- On Rate Requirements for Achieving the Centralized Performance in Distributed Estimation
- Distributed Recursive Estimation under Heavy-Tail Communication Noise
This page was built for publication: Distributed Estimation Via Random Access
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3604443)