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

Distributed Estimation Using Reduced-Dimensionality Sensor Observations

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

5
216
0

Year Published

2007
2007
2019
2019

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 202 publications
(221 citation statements)
references
References 11 publications
5
216
0
Order By: Relevance
“…The sensor nodes collect observations of a physical phenomenon and collaborate with each other to perform a certain signal processing task, e.g., localization, detection or estimation of certain signals or parameters. Some approaches require a socalled fusion center (e.g., [1]- [6]) that gathers all the sensor signals, whereas other algorithms are distributed such that all processing happens inside the network (e.g., [7]- [23]). The latter is usually preferred, especially when it is scalable in terms of communication bandwidth and processing power.…”
Section: A Distributed Signal Estimation In Wireless Sensor Networkmentioning
confidence: 99%
“…The sensor nodes collect observations of a physical phenomenon and collaborate with each other to perform a certain signal processing task, e.g., localization, detection or estimation of certain signals or parameters. Some approaches require a socalled fusion center (e.g., [1]- [6]) that gathers all the sensor signals, whereas other algorithms are distributed such that all processing happens inside the network (e.g., [7]- [23]). The latter is usually preferred, especially when it is scalable in terms of communication bandwidth and processing power.…”
Section: A Distributed Signal Estimation In Wireless Sensor Networkmentioning
confidence: 99%
“…According to [9], for i.i.d. local observations an upper bound for the MSE, when the messages are transmitted over a memoryless binary symmetric channel is given by the following lemma: Lemma 6: [9] If the bit error rates from node k is , then the MSE achieved by the fusion center based on the decoded messages {m 1 ,..., m n } is upper bounded by (19) where and p 0 > 0 satisfies the following condition:…”
Section: ) Quantized Local Processingmentioning
confidence: 99%
“…where is the L 2 -norm of the power vector P = [P 1 ,..., P n ] T , ε 2 is the desired MSE threshold at the fusion center and the MSE is as given by (19). The optimal number of bits to quantize the observations at node k, that is given by the solution to (21), are characterized in the following lemma.…”
Section: ) Quantized Local Processingmentioning
confidence: 99%
“…In many multi-node estimation frameworks the measurement data is fused, possibly through a fusion center, to estimate a common parameter or signal assumed to be the same for each node (e.g. [2][3][4][5][6]). This can be viewed as a special case of the more general problem where each node in the network estimates a different node-specific signal.…”
Section: Introductionmentioning
confidence: 99%
“…Unlike other compression schemes for multi-dimensional sensor data (e.g. [4][5][6]), the algorithm does not need prior knowledge of the intra-and inter-sensor cross-correlation structure of the network. Nodes estimate and re-estimate all necessary statistics on the compressed data during operation.…”
Section: Introductionmentioning
confidence: 99%