Factor Graphs for Support Identification in Compressive Sensing Aided Wireless Sensor Networks

被引:1
作者
Chen, Jue [1 ]
Wang, Tsang-Yi [2 ]
Wu, Jwo-Yuh [3 ]
Li, Chih-Peng [2 ,4 ]
Ng, Soon Xin [1 ]
Maunder, Robert G. [1 ]
Hanzo, Lajos [1 ]
机构
[1] Univ Southampton, Sch Elect & Comp Sci, Southampton SO17 1BJ, Hants, England
[2] Natl Sun Yat Sen Univ, Inst Commun Engn, Kaohsiung, Taiwan
[3] Natl Yang Ming Chiao Tung Univ, Inst Commun Engn, Hsinchu 300, Taiwan
[4] Natl Sun Yat Sen Univ, Dept Elect Engn, Kaohsiung 80424, Taiwan
基金
欧洲研究理事会; 英国工程与自然科学研究理事会;
关键词
Sensors; Wireless sensor networks; Sparse matrices; Signal reconstruction; Matching pursuit algorithms; Signal processing algorithms; Complexity theory; Compressive sensing; support identification; wireless sensor networks; sparse sensing matrix; noise reduction; SIGNAL RECOVERY; SPARSE; EFFICIENT; RECONSTRUCTION; ALGORITHMS;
D O I
10.1109/JSEN.2021.3123209
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
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.
引用
收藏
页码:27195 / 27207
页数:13
相关论文
共 55 条
[1]  
Abo-Zahhad M M., 2015, International Journal of Communications, Network and System Sciences, V8, P197, DOI DOI 10.4236/IJCNS.2015.86021
[2]   EP-Based Joint Active User Detection and Channel Estimation for Massive Machine-Type Communications [J].
Ahn, Jinyoup ;
Shim, Byonghyo ;
Lee, Kwang Bok .
IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (07) :5178-5189
[3]   Decision Fusion for Clustered WSNs over IoT Infrastructure using 1-bit Quantization [J].
Al-Jarrah, M. A. ;
Yaseen, M. A. ;
Al-Dweik, A. .
2019 INTERNATIONAL CONFERENCE ON ELECTRICAL AND COMPUTING TECHNOLOGIES AND APPLICATIONS (ICECTA), 2019,
[4]   OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].
BAHL, LR ;
COCKE, J ;
JELINEK, F ;
RAVIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287
[5]   Bayesian Compressive Sensing Via Belief Propagation [J].
Baron, Dror ;
Sarvotham, Shriram ;
Baraniuk, Richard G. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2010, 58 (01) :269-280
[6]   The Dynamics of Message Passing on Dense Graphs, with Applications to Compressed Sensing [J].
Bayati, Mohsen ;
Montanari, Andrea .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (02) :764-785
[7]   Combining geometry and combinatorics: a unified approach to sparse signal recovery [J].
Berinde, R. ;
Gilbert, A. C. ;
Indyk, P. ;
Karloff, H. ;
Strauss, M. J. .
2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, :798-+
[8]   Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise [J].
Cai, T. Tony ;
Wang, Lie .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (07) :4680-4688
[9]   Greedy Algorithms for Sparse and Positive Signal Recovery Based on Bit-Wise MAP Detection [J].
Chae, Jeongmin ;
Hong, Songnam .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2020, 68 :4017-4029
[10]   Amplitude-Aided 1-Bit Compressive Sensing Over Noisy Wireless Sensor Networks [J].
Chen, Ching-Hsien ;
Wu, Jwo-Yuh .
IEEE WIRELESS COMMUNICATIONS LETTERS, 2015, 4 (05) :473-476