2015
DOI: 10.1109/tsp.2015.2413381
|View full text |Cite
|
Sign up to set email alerts
|

Sparsity-Aware Sensor Collaboration for Linear Coherent Estimation

Abstract: In the context of distributed estimation, we consider the problem of sensor collaboration, which refers to the act of sharing measurements with neighboring sensors prior to transmission to a fusion center. While incorporating the cost of sensor collaboration, we aim to find optimal sparse collaboration schemes subject to a certain information or energy constraint. Two types of sensor collaboration problems are studied: minimum energy with an information constraint; and maximum information with an energy constr… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
44
0

Year Published

2016
2016
2024
2024

Publication Types

Select...
5
2

Relationship

2
5

Authors

Journals

citations
Cited by 48 publications
(44 citation statements)
references
References 41 publications
0
44
0
Order By: Relevance
“…The prior PDF of x is given by x ∼ N (µ, Σ), where µ = [10,10] T and Σ = I. For simplicity, the row vectors of the measurement matrix H are chosen randomly, and independently, from the distribution N (0, I/ √ n) [13].…”
Section: : End Formentioning
confidence: 99%
See 1 more Smart Citation
“…The prior PDF of x is given by x ∼ N (µ, Σ), where µ = [10,10] T and Σ = I. For simplicity, the row vectors of the measurement matrix H are chosen randomly, and independently, from the distribution N (0, I/ √ n) [13].…”
Section: : End Formentioning
confidence: 99%
“…Therefore, the problem of sensor selection/scheduling arises, which aims to strike a balance between estimation accuracy and sensor activations over space and/or time. The importance of sensor selection has been discussed extensively in the context of various applications, such as target tracking [4], bit allocation [5], field monitoring [6], [7], optimal control [8], power allocation [9], [10], optimal experiment design [11], and leader selection in consensus networks [12].…”
mentioning
confidence: 99%
“…A recursive linear minimum mean squared error estimator (R-LMMSE) in the presence of multiplicative noise has been considered in [36], [37]. Motivated by the results in [36], [37] and since we have already assumed that |α| < 1, the following Lemma shows that (13) satisfies the assumption in [37] and hence that the R-LMMSE to be derived is stable. In the following, we denote u k := g T k Wh k .…”
Section: Offline Optimization Problemmentioning
confidence: 99%
“…In this section, for the purpose of comparison, we assume that the channel state information, i.e., h k and g k , of the statespace model (13) is available at the FC at time k. In this ideal case, R-LMMSE simplifies to the standard Kalman filter shown in Algorithm 2.…”
Section: Comparison With Csi Based Sensor Collaborationmentioning
confidence: 99%
See 1 more Smart Citation