Abstract
A new support identification technique based on factor graphs and belief propagation is proposed for compressive sensing (CS) aided wireless sensor networks (WSNs), which reliably estimates the locations of non-zero entries in a sparse signal through an iterative process. Our factor graph based approach achieves a support identification error rate of 10% at an signal to noise ratio (SNR) that is 6 dB lower than that required by the state-of-the-art relative frequency based support identification approach, as well as by the orthogonal matching pursuit (OMP) algorithm. We also demonstrate that our support identification technique is capable of mitigating the signal reconstruction noise by as much as 4 dB upon pruning the sparse sensing matrix. Furthermore, by intrinsically amalgamating the relative frequency based and the proposed factor graph based approach, we conceived a hybrid support identification technique for reducing communication between the sensor nodes and the fusion center (FC), while maintaining high-accuracy support identification and simultaneously mitigating the noise contaminating signal reconstruction.
Original language | English |
---|---|
Article number | 9585471 |
Pages (from-to) | 27195-27207 |
Number of pages | 13 |
Journal | IEEE Sensors Journal |
Volume | 21 |
Issue number | 23 |
DOIs | |
State | Published - Dec 2021 |
Keywords
- Complexity theory
- Compressive sensing
- Matching pursuit algorithms
- noise reduction
- Sensors
- Signal processing algorithms
- Signal reconstruction
- Sparse matrices
- sparse sensing matrix
- support identification
- Wireless sensor networks
- wireless sensor networks