Cooperative and distributed algorithm for compressed sensing recovery in WSNs

Wireless sensor networks (WSNs) could benefit a lot from compressive sensing (CS). Inherent physical structure of sensors of WSNs (battery-powered devices) demands computational-efficient algorithms with no heavy burden on a small subset of the sensors, i.e. fusion sensors. This could be achieved by distributed algorithms in which computation is distributed among all sensor nodes. On this basis, in this study, the authors have proposed a distributed and cooperative sparse recovery algorithm in which each sensor decodes a sparse signal by running a recovery algorithm with the cooperation of its neighbours. The proposed algorithm has a general structure and can be adapted to many optimisation algorithms in the context of the CS. This algorithm is completely distributed and requires an acceptable computational complexity that is suitable for WSNs. A detailed proof of convergence behaviour of the proposed algorithm is also presented. The superiority of the proposed algorithm compared with similar methods in terms of recovery quality and convergence rate is confirmed through simulation.