基于概率稀疏随机矩阵的压缩数据收集方法  

Compressive Data Gathering Method Based on Probabilistic Sparse Random Matrices

作　　者：张波[1] 刘郁林[1] 王开[1] 王娇[1] 

机构地区：[1]重庆通信学院DSP研究室,重庆400035

出　　处：《电子与信息学报》2014年第4期834-839,共6页Journal of Electronics & Information Technology

基　　金：教育部新世纪优秀人才支持计划(NCET-11-0873);重庆市自然科学基金(CSTC2011BA2016);重庆高校创新团队建设计划(KJTD201343);重庆市基础与前沿研究计划项目(cstc2013jcyA40045)资助课题

摘　　要：测量矩阵设计是应用压缩感知理论解决实际问题的关键。该文针对无线传感器网络压缩数据收集问题设计了一种概率稀疏随机矩阵。该矩阵可在减少参与投影值计算节点个数的同时,让参与投影值计算的节点分布集中化,从而降低数据收集的通信能耗。在此基础上,为提高网络数据重构精度,又提出一种适用于概率稀疏随机矩阵优化的测量矩阵优化算法。仿真实验结果表明,与稀疏随机矩阵和稀疏Toeplitz测量矩阵相比,采用优化的概率稀疏随机矩阵作为压缩数据收集的测量矩阵可显著降低通信能耗,且重构误差更小。Designing measurement matrix is one of the key points of applying Compressed Sensing （CS） to solve practical issue. In this paper, a kind of probabilistic sparse random matrix is designed for compressive data gathering in Wireless Sensor Networks （WSNs）. Besides cutting the number of projection calculating nodes, the probabilistic sparse random matrices also make their location centralized, which leads a further reduction of communication overhead. Then, an optimization method for probabilistic sparse random matrices is also proposed to enhance the accuracy of network data reconstruction. Compared with the existing data gathering method using sparse random matrices and sparse Toeplitz matrices, the proposed method can reduce significantly not only the energy consumption, but also the reconstruction error.

关 键 词：无线传感器网络 压缩感知 稀疏测量矩阵 数据收集 

分 类 号：TP393[自动化与计算机技术—计算机应用技术] TN911.72[自动化与计算机技术—计算机科学与技术]