Advanced Search
Volume 36 Issue 4
May  2014
Turn off MathJax
Article Contents
Zhang Bo, Liu Yu-Lin, Wang Kai, Wang Jiao. Compressive Data Gathering Method Based on Probabilistic Sparse Random Matrices[J]. Journal of Electronics & Information Technology, 2014, 36(4): 834-839. doi: 10.3724/SP.J.1146.2013.00700
Citation: Zhang Bo, Liu Yu-Lin, Wang Kai, Wang Jiao. Compressive Data Gathering Method Based on Probabilistic Sparse Random Matrices[J]. Journal of Electronics & Information Technology, 2014, 36(4): 834-839. doi: 10.3724/SP.J.1146.2013.00700

Compressive Data Gathering Method Based on Probabilistic Sparse Random Matrices

doi: 10.3724/SP.J.1146.2013.00700
  • Received Date: 2013-05-16
  • Rev Recd Date: 2013-12-18
  • Publish Date: 2014-04-19
  • 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.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (2414) PDF downloads(860) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return