TY - GEN
T1 - Distributed compression and estimation for wireless sensor networks with noisy channels
AU - Fang, Jun
AU - Li, Hongbin
PY - 2008
Y1 - 2008
N2 - The problem of distributed estimation in wireless sensor networks (WSNs) has attracted much attention over the past few years. As bandwidth and power are severely limited in WSNs, one of the main objectives in current WSN research is to design bandwidth and power efficient algorithms. A multitude of studies along this line have appeared recently. Among them, some previous works (e.g.,[3]-[7]) consider distributed estimation using aggressively quantized versions of the original observations. In this setup, quantization becomes an integral part of the estimation process and is critical to the estimation performance. Another category of methods (e.g.,[8]-[13]), not relying on the above low-rate quantization strategy, follow an optimal decentralized compression-estimation approach to reduce the transmission requirement. In these methods, the data dimensionality is reduced before each sensor sends its data to a fusion center (FC). Upon receiving the compressed data, the FC combines them according to some fusion criterion to obtain a final estimate. The crux of these techniques is to design the compression matrix so as to minimize the estimation mean-square error (MSE), which has been extensively investigated by[8]-[13] under different fusion criterions and observation correlation scenarios. These works[8]-[13], however, mostly assume perfect wireless channels through which the signals can be sent from the sensors to the fusion center (FC) without any distortion. This assumption, clearly, is unrealistic in practice because the wireless links inevitably suffer from the channel noise and adverse channel effects such as fading and attenuation. In this paper, we study the problem of decentralized compression-estimation in the presence of channel noise and fading. By utilizing a series of matrix transformations and established properties, we present a scheme to design the compression matrices. Specifically, for the single sensor case, an analytic solution of the optimal compression is derived.
AB - The problem of distributed estimation in wireless sensor networks (WSNs) has attracted much attention over the past few years. As bandwidth and power are severely limited in WSNs, one of the main objectives in current WSN research is to design bandwidth and power efficient algorithms. A multitude of studies along this line have appeared recently. Among them, some previous works (e.g.,[3]-[7]) consider distributed estimation using aggressively quantized versions of the original observations. In this setup, quantization becomes an integral part of the estimation process and is critical to the estimation performance. Another category of methods (e.g.,[8]-[13]), not relying on the above low-rate quantization strategy, follow an optimal decentralized compression-estimation approach to reduce the transmission requirement. In these methods, the data dimensionality is reduced before each sensor sends its data to a fusion center (FC). Upon receiving the compressed data, the FC combines them according to some fusion criterion to obtain a final estimate. The crux of these techniques is to design the compression matrix so as to minimize the estimation mean-square error (MSE), which has been extensively investigated by[8]-[13] under different fusion criterions and observation correlation scenarios. These works[8]-[13], however, mostly assume perfect wireless channels through which the signals can be sent from the sensors to the fusion center (FC) without any distortion. This assumption, clearly, is unrealistic in practice because the wireless links inevitably suffer from the channel noise and adverse channel effects such as fading and attenuation. In this paper, we study the problem of decentralized compression-estimation in the presence of channel noise and fading. By utilizing a series of matrix transformations and established properties, we present a scheme to design the compression matrices. Specifically, for the single sensor case, an analytic solution of the optimal compression is derived.
UR - http://www.scopus.com/inward/record.url?scp=51849148053&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51849148053&partnerID=8YFLogxK
U2 - 10.1109/CISS.2008.4558673
DO - 10.1109/CISS.2008.4558673
M3 - Conference contribution
AN - SCOPUS:51849148053
SN - 9781424422470
T3 - CISS 2008, The 42nd Annual Conference on Information Sciences and Systems
SP - 1048
EP - 1052
BT - CISS 2008, The 42nd Annual Conference on Information Sciences and Systems
T2 - CISS 2008, 42nd Annual Conference on Information Sciences and Systems
Y2 - 19 March 2008 through 21 March 2008
ER -