Next Article in Journal
Homomorphic Filtering for Improving Time Synchronization in Wireless Networks
Previous Article in Journal
Characterization of N-Acyl Homoserine Lactones in Vibrio tasmaniensis LGP32 by a Biosensor-Based UHPLC-HRMS/MS Method
Article Menu
Issue 4 (April) cover image

Export Article

Open AccessArticle
Sensors 2017, 17(4), 907;

An Efficient Distributed Compressed Sensing Algorithm for Decentralized Sensor Network

School of Electronics and Information Engineering, Xi’an Jiaotong University, Xi’an 710049, China
Author to whom correspondence should be addressed.
Academic Editor: Leonhard M. Reindl
Received: 8 February 2017 / Revised: 13 April 2017 / Accepted: 13 April 2017 / Published: 20 April 2017
(This article belongs to the Section Sensor Networks)
Full-Text   |   PDF [2594 KB, uploaded 20 April 2017]   |  


We consider the joint sparsity Model 1 (JSM-1) in a decentralized scenario, where a number of sensors are connected through a network and there is no fusion center. A novel algorithm, named distributed compact sensing matrix pursuit (DCSMP), is proposed to exploit the computational and communication capabilities of the sensor nodes. In contrast to the conventional distributed compressed sensing algorithms adopting a random sensing matrix, the proposed algorithm focuses on the deterministic sensing matrices built directly on the real acquisition systems. The proposed DCSMP algorithm can be divided into two independent parts, the common and innovation support set estimation processes. The goal of the common support set estimation process is to obtain an estimated common support set by fusing the candidate support set information from an individual node and its neighboring nodes. In the following innovation support set estimation process, the measurement vector is projected into a subspace that is perpendicular to the subspace spanned by the columns indexed by the estimated common support set, to remove the impact of the estimated common support set. We can then search the innovation support set using an orthogonal matching pursuit (OMP) algorithm based on the projected measurement vector and projected sensing matrix. In the proposed DCSMP algorithm, the process of estimating the common component/support set is decoupled with that of estimating the innovation component/support set. Thus, the inaccurately estimated common support set will have no impact on estimating the innovation support set. It is proven that under the condition the estimated common support set contains the true common support set, the proposed algorithm can find the true innovation set correctly. Moreover, since the innovation support set estimation process is independent of the common support set estimation process, there is no requirement for the cardinality of both sets; thus, the proposed DCSMP algorithm is capable of tackling the unknown sparsity problem successfully. View Full-Text
Keywords: distributed compressed sensing; JSM-1; distributed compact sensing matrix pursuit (DCSMP) algorithm distributed compressed sensing; JSM-1; distributed compact sensing matrix pursuit (DCSMP) algorithm

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).

Share & Cite This Article

MDPI and ACS Style

Liu, J.; Huang, K.; Zhang, G. An Efficient Distributed Compressed Sensing Algorithm for Decentralized Sensor Network. Sensors 2017, 17, 907.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics



[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top