Distributed Field Reconstruction in Wireless Sensor Networks Based on Hybrid Shift-Invariant Spaces

We use the theory and algorithms developed for so-called shift-invariant spaces to develop a novel distributed architecture for sampling and reconstructing time-varying non-bandlimited physical fields in wireless sensor networks. We introduce hybrid shift-invariant spaces that generalize conventiona...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing 2012-10, Vol.60 (10), p.5426-5439
Main Authors: Reise, G., Matz, G., Grochenig, K.
Format: Article
Language:English
Subjects:
Adaptation models
Algorithms
Applied sciences
B-splines
Computer architecture
Detection, estimation, filtering, equalization, prediction
Error detection
Exact sciences and technology
field reconstruction
Generators
Information, signal and communications theory
Mathematical analysis
Mathematical model
Mathematical models
Mean square errors
Position (location)
Reconstruction
Remote sensors
Sampling, quantization
Sensors
shift-invariant spaces
Signal and communications theory
Signal, noise
Silicon
Splines (mathematics)
Studies
Telecommunications and information theory
Wireless sensor networks
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We use the theory and algorithms developed for so-called shift-invariant spaces to develop a novel distributed architecture for sampling and reconstructing time-varying non-bandlimited physical fields in wireless sensor networks. We introduce hybrid shift-invariant spaces that generalize conventional shift-invariant spaces and can adapt to local smoothness properties of the field. Using shift-invariant spaces with compactly supported generator functions allows us to split the global reconstruction into several smaller local problems that can be solved independently. Capitalizing on the sparsity of the matrices involved in the reconstruction, we propose direct and iterative reconstruction algorithms whose complexity per time slot scales only linearly with the number of sensor nodes. We furthermore analyze the impact of sensor localization errors on the mean square error of the reconstructed field. Numerical simulations illustrate that the proposed field reconstruction scheme performs close to bandlimited reconstruction and is less sensitive to sensor location errors while providing a significant reduction in computational complexity.
ISSN:1053-587X
1941-0476
DOI:10.1109/TSP.2012.2205918