Sparse Diffusion Steepest-Descent for One Bit Compressed Sensing in Wireless Sensor Networks

Abstract

This letter proposes a sparse diffusion steepest-descent algorithm for one bit compressed sensing in wireless sensor networks. The approach exploits the diffusion strategy from distributed learning in the one bit compressed sensing framework. To estimate a common sparse vector cooperatively from only the sign of measurements, steepest-descent is used to minimize the suitable global and local convex cost functions. A diffusion strategy is suggested for distributive learning of the sparse vector. Simulation results show the effectiveness of the proposed distributed algorithm compared to the state-of-the-art non distributive algorithms in the one bit compressed sensing framework.

4 pages, 3 figures

References in corpus (4)

• A fast approach for overcomplete sparse decomposition based on smoothed L0 norm
• A Sparsity-Aware Adaptive Algorithm for Distributed Learning
• Distributed Consensus Algorithms in Sensor Networks: Link Failures and Channel Noise
• Amplitude-Aided 1-Bit Compressive Sensing Over Noisy Wireless Sensor Networks