Random Field Estimation with Delay-Constrained and Delay-Tolerant Wireless Sensor Networks
<p/> <p>In this paper, we study the problem of random field estimation with wireless sensor networks. We consider two encoding strategies, namely, Compress-and-Estimate (C&E) and Quantize-and-Estimate (Q&E), which operate with and without side information at the decoder,...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
SpringerOpen
2010-01-01
|
| Series: | EURASIP Journal on Wireless Communications and Networking |
| Online Access: | http://jwcn.eurasipjournals.com/content/2010/102460 |
| Summary: | <p/> <p>In this paper, we study the problem of random field estimation with wireless sensor networks. We consider two encoding strategies, namely, Compress-and-Estimate (C&E) and Quantize-and-Estimate (Q&E), which operate with and without side information at the decoder, respectively. We focus our attention on two scenarios of interest: <it>delay-constrained</it> networks, in which the observations collected in a particular timeslot must be immediately encoded and conveyed to the Fusion Center (FC); <it>delay-tolerant</it> (DT) networks, where the time horizon is enlarged to a number of consecutive timeslots. For both scenarios and encoding strategies, we extensively analyze the distortion in the reconstructed random field. In DT scenarios, we find closed-form expressions of the optimal number of samples to be encoded in each timeslot (Q&E and C&E cases). Besides, we identify buffer stability conditions and a number of interesting distortion versus buffer occupancy tradeoffs. Latency issues in the reconstruction of the random field are addressed, as well. Computer simulation and numerical results are given in terms of distortion versus number of sensor nodes or SNR, latency versus network size, or buffer occupancy.</p> |
|---|---|
| ISSN: | 1687-1472 1687-1499 |