Multivariated Bayesian Compressive Sensing in Wireless Sensor Networks

被引:27
作者
Hwang, Seunggye [1 ]
Ran, Rong [2 ]
Yang, Janghoon [3 ]
Kim, Dong Ku [1 ]
机构
[1] Yonsei Univ, Sch Elect & Elect Engn, Seoul 120749, South Korea
[2] Ajou Univ, Seoul 443749, South Korea
[3] Seoul Media Inst Technol, Dept Newmedia Contents, Seoul 136791, South Korea
基金
新加坡国家研究基金会;
关键词
Compressive sensing; Bayesian estimation; wireless sensor networks; sensor selection algorithm; SIGNAL RECOVERY; RECONSTRUCTION; ACCESS;
D O I
10.1109/JSEN.2015.2508670
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Recently, compressive sensing has been studied in wireless sensor networks, which allows an aggregator to recover the desired sparse signal with fewer active sensor nodes. In this paper, we consider heterogeneous sensing environments, where the sensing quality varies due to the differences in the physical environment of each sensor node. We consider a Bayesian compressive sensing approach and propose two efficient algorithms that decrease the number of active sensor nodes while maintaining high performance. Both the selection algorithms aim to reduce the estimation error by minimizing the determinant of the error covariance matrix, which is proportional to the volume of the confidence ellipsoid. The first algorithm is the centralized greedy selection algorithm, which can achieve a nearly optimal solution in terms of the minimum confidence ellipsoid. It can also achieve almost the same level of performance as the combinatorial selection method, but has a lower complexity and outperforms the conventional convex relaxation method. The second algorithm is the decentralized selection algorithm, which is derived by approximating the determinant of the error covariance matrix. Unlike the centralized greedy algorithm, it can be done by each sensor node without heavy overhead or high complexity. Furthermore, we prove that the decentralized selection algorithm becomes equivalent to the centralized greedy algorithm as the number of sensor nodes increases. Our simulation results show that the centralized greedy selection algorithm provides the best performance while the decentralized algorithm performs nearly as well as the centralized algorithm as the number of sensor nodes increases.
引用
收藏
页码:2196 / 2206
页数:11
相关论文
共 27 条
[1]  
[Anonymous], 2011, TECH REP
[2]  
[Anonymous], 6 JOINT IFIP WIR MOB
[3]  
[Anonymous], 2009, BAYESIAN THEORY
[4]  
[Anonymous], 2001, PROC 14 INT C NEURAL
[5]  
Baron D., 2009, DISTRIBUTED COMPRESS
[6]   Robust uncertainty principles:: Exact signal reconstruction from highly incomplete frequency information [J].
Candès, EJ ;
Romberg, J ;
Tao, T .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (02) :489-509
[7]   Near-optimal signal recovery from random projections: Universal encoding strategies? [J].
Candes, Emmanuel J. ;
Tao, Terence .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2006, 52 (12) :5406-5425
[8]   Stable signal recovery from incomplete and inaccurate measurements [J].
Candes, Emmanuel J. ;
Romberg, Justin K. ;
Tao, Terence .
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS, 2006, 59 (08) :1207-1223
[9]   Optimized Node Selection for Compressive Sleeping Wireless Sensor Networks [J].
Chen, Wei ;
Wassell, Ian J. .
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2016, 65 (02) :827-836
[10]   Network correlated data gathering with explicit communication: NP-completeness and algorithms [J].
Cristescu, RZ ;
Beferull-Lozano, B ;
Vetterli, M ;
Wattenhofer, R .
IEEE-ACM TRANSACTIONS ON NETWORKING, 2006, 14 (01) :41-54