Skip to main content
Springer Nature Link
Log in

Generic cooperative and distributed algorithm for recovery of signals with the same sparsity profile in wireless sensor networks: a non-convex approach

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Most of the wireless sensor networks (WSNs) are equipped with battery-powered devices with limited processing/communication resources which necessitate the designed algorithms to reduce the computational burden on nodes as much as possible. This could be achieved using distributed algorithms in which the computations are distributed between all of the nodes. In WSNs, the sensors observe phenomena that could be common to some of them, in addition to the intra-signal correlation; therefore, the acquired signals by the sensors possess some inter-signal correlation. These joint structures could be exploited if the designed algorithms are cooperative. On this basis, in this paper a new distributed and cooperative signal recovery algorithm in the application of compressive sensing for WSNs is proposed. We consider a situation that the sensor nodes intend to recover signals that differ from one sensor to another, in the underdetermined systems of equations, while these signals have common sparsity profile. In fact, we introduce a general structure which can be applied to many optimization problems with different non-convex objective functions and different constraints. In this paper, this method will be used on three problems with different constraints and will result in three completely distributed methods. The simulation results show that the proposed method presents better performance compared to the other existing algorithms in terms of both recovery and convergence rate.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Foucart S, Rauhut H (2013) A mathematical introduction to compressive sensing. Springer, New York

    Book  MATH  Google Scholar 

  2. Candès E, Romberg J, Tao T (2006) Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans Inf Theory 52:489–509

    Article  MathSciNet  MATH  Google Scholar 

  3. Donoho D (2006) Compressed sensing. IEEE Trans Inf Theory 52:1289–1306

    Article  MathSciNet  MATH  Google Scholar 

  4. Cohen A, Dahmen W, DeVore R (2009) Compressed sensing and best k-term approximation. J Am Math Soc 22(1):211–231

    Article  MathSciNet  MATH  Google Scholar 

  5. Donoho DL, Elad M (2003) Optimally sparse representation in general (nonorthogonal) dictionaries via l 1 minimization. Proc Nat Acad Sci USA 100(5):2197–2202

    Article  MATH  Google Scholar 

  6. Candès EJ (2008) The restricted isometry property and its implications for compressed sensing. C R Math Acad Sci Paris Ser I 346(9, 10):589–592

    Article  MathSciNet  MATH  Google Scholar 

  7. Candès EJ, Tao T (2006) Near-optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans Inf Theory 52:5406–5425

    Article  MathSciNet  MATH  Google Scholar 

  8. Candès E, Tao T (2005) Decoding by linear programming. IEEE Trans Inf Theory 51(12):4203–4215

    Article  MathSciNet  MATH  Google Scholar 

  9. Gorodnitsky IF, George JS, Rao BD (1995) Neuromagnetic source imaging with FOCUSS: a recursive weighted minimum norm algorithm. J Electroencephalog Clin Neurophysiol 95(4):231–251

    Article  Google Scholar 

  10. Gorodnitsky IF, Rao BD (1997) Sparse signal reconstructions from limited data using FOCUSS: a re-weighted minimum norm algorithm. IEEE Trans Signal Process 45(3):600–616

    Article  Google Scholar 

  11. Rao BD, Kreutz-Delgado K (1999) An affine scaling methodology for best basis selection. IEEE Trans Signal Process 47(1):187–200

    Article  MathSciNet  MATH  Google Scholar 

  12. Kreutz-Delgado K, Rao BD (1999) Sparse basis selection, ICA, and majorization: toward a unified perspective. In: Proc. ICASSP, Phoenix, AZ

  13. Mallat S, Zhang Z (1993) Matching pursuit in a time-frequency dictionary. IEEE Trans Signal Process 41(12):3397–3415

    Article  MATH  Google Scholar 

  14. Tropp JA, Gilbert AC (2007) Signal recovery from random measurements via orthogonal matching pursuit. IEEE Trans Inf Theory 53(12):4655–4666

    Article  MathSciNet  MATH  Google Scholar 

  15. Needell D, Tropp JA (2008) CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl Comp Harmonic Anal 26:301–321

    Article  MathSciNet  MATH  Google Scholar 

  16. Donoho DL, Tsaig Y, Drori I, Starck JL (2006) Sparse solution of underdetermined linear equations by stage wise orthogonal matching pursuit. Technical Report

  17. Dai W, Milenkovic O (2009) Subspace pursuit for compressive sensing signal reconstruction. IEEE Trans Inf Theory 55(5):2230–2249

    Article  MathSciNet  MATH  Google Scholar 

  18. Karahanoglu NB, Erdogan H (2012) Compressed sensing signal recovery via forward-backward pursuit. Preprint submitted to Digital Signal Processing

  19. Ji S, Tan C, Yang P, Sun Y-J, Fu D, Wang J (2018) Compressive sampling and data fusion-based structural damage monitoring in wireless sensor network. J Supercomput 74(3):1108–1131

    Article  Google Scholar 

  20. Baron D, Duarte MF, Wakin MB, Sarvotham S, Baraniuk RG (2009) Distributed compressive sensing, appeared in Rice University Compressive Sensing Resources. http://www.dsp.rice.edu/cs. Accessed 22 Jan 2009

  21. Adnani SN, Tinati MA, Azarnia G, Rezaii TY (2018) Energy efficient data reconstruction algorithm for spatially- and temporally-correlated data in wireless sensor networks. In: IET Signal Processing. https://doi.org/10.1049/iet-spr.2017.0467

  22. Azarnia G, Tinati MA (2015) Steady-state analysis of the deficient length incremental LMS adaptive networks. Circuits Syst Signal Process 34(9):2893–2910

    Article  MathSciNet  Google Scholar 

  23. Azarnia G, Tinati MA (2015) Steady-state analysis of the deficient length incremental LMS adaptive networks with noisy links. AEUE- Int J Electron Commun 69(1):153–162

    Article  Google Scholar 

  24. Shiri H, Tinati MA, Codreanu M, Daneshvar S (2018) Distributed sparse diffusion estimation based on set membership and affine projection algorithm. Digit Signal Proc 73:47–61

    Article  MathSciNet  Google Scholar 

  25. Shiri H, Tinati MA, Codreanu M, Azarnia G (2018) Distributed sparse diffusion estimation with reduced communication cost. In: IET Signal Processing. https://doi.org/10.1049/iet-spr.2017.0377

  26. Mateos G, Bazerque JA, Giannakis GB (2010) Distributed sparse linear regression. IEEE Trans Signal Process 58(10):5262–5276

    Article  MathSciNet  MATH  Google Scholar 

  27. Patterson S, Eldar YC, Keidar I (2014) Distributed compressed sensing for static and time-varying networks. IEEE Trans Signal Process 62(19):4931–4946

    Article  MathSciNet  MATH  Google Scholar 

  28. Mota JF, Xavier JM, Aguiar PM, Puschel M (2012) Distributed basis pursuit. IEEE Trans Signal Process 60(4):1942–1956

    Article  MathSciNet  MATH  Google Scholar 

  29. Jijun H, Song Z (2015) A novel decentralized scheme for cooperative compressed spectrum sensing in distributed networks. Int J Distrib Sensor Netw 11(8):785143

    Article  Google Scholar 

  30. Azarnia Ghanbar, Tinati MA, Yousefi Rezaii T (2018) Cooperative and distributed algorithm for compressed sensing recovery in wireless sensor networks. IET Signal Proc 12(3):346–357. https://doi.org/10.1049/iet-spr.2017.0093

    Article  Google Scholar 

  31. Ling Q, Tian Z (2011) Decentralized support detection of multiple measurement vectors with joint sparsity. In: Proc. ICASSP, pp 2996–2999

  32. Ling Q, Wen Z, Yin W (2013) Decentralized jointly sparse optimization by reweighted l q-minimization. IEEE Trans Signal Process 61(5):1165–1170

    Article  MathSciNet  MATH  Google Scholar 

  33. Jin S, Zhang X (2015) Decentralized iterative reweighted algorithm for recovery of jointly sparse signals. In: IEEE WCNC 2015, New Orleans, LA

  34. Sundman D, Chatterjee S, Skoglund M (2014) Distributed greedy pursuit algorithms. Sig Process 105:298–315

    Article  Google Scholar 

  35. Wimalajeewa T, Varshney P (2014) OMP based joint sparsity pattern recovery under communication constraints. IEEE Trans Signal Process 62(19):5059–5072

    Article  MathSciNet  MATH  Google Scholar 

  36. Fosson SM et al (2016) Distributed recovery of jointly sparse signals under communication constraints. IEEE Trans Signal Process 64(13):3470–3482

    Article  MathSciNet  MATH  Google Scholar 

  37. Chen W, Wassell IJ, Rodrigues MRD (2015) Dictionary design for distributed compressive sensing. IEEE Signal Processing Letters 22(1):95–99

    Article  Google Scholar 

  38. Matamoros J, Fosson SM, Magli E, Antón-Haro C (2015) Distributed ADMM for in-network reconstruction of sparse signals with innovations. IEEE Trans Signal Inf Process over Netw 1(4):225–234

    Article  MathSciNet  Google Scholar 

  39. Zhang Y, Qi R, Zeng Y (2016) Forward-backward pursuit method for distributed compressed sensing. Multimedia Tools and Applications 76(20):1–22

    Google Scholar 

  40. Chen W, Wassel IJ (2016) Bayesian learning for the type-3 joint sparse signal recovery. In: 2016 IEEE International Conference on Communications (ICC), pp 1–6

  41. Sundman D, Chatterjee S, Skoglund M (2016) Design and analysis of a greedy pursuit for distributed compressed sensing. IEEE Trans Signal Process 64(11):2803–2818

    Article  MathSciNet  MATH  Google Scholar 

  42. Chartrand R (2012) Nonconvex splitting for regularized low-rank + sparse decomposition. IEEE Trans Signal Process 60:5810–5819

    Article  MathSciNet  MATH  Google Scholar 

  43. Chartrand R, Wohlberg B (2013) A nonconvex ADMM algorithm for group sparsity with sparse groups. In: Proc. 38th IEEE Int. Conf. Acoust., Speech, Signal Process., Vancouver, Canada, May 26–31, pp 6009–6013

  44. Natarajan BK (1995) Sparse approximate solutions to linear systems. SIAM J Comput 24(2):227–234

    Article  MathSciNet  MATH  Google Scholar 

  45. Bandeira AS, Dobriban E, Mixon DG, Sawin WF (2013) Certifying the restricted isometry property is hard. IEEE Trans Inf Theory 59(6):3448–3450

    Article  MathSciNet  MATH  Google Scholar 

  46. Mallat S (1999) A wavelet tour of signal processing. Academic Press, San Diego

    MATH  Google Scholar 

  47. Horn RA, Mathias R, Nakamura Y (1991) Inequalities for unitarily invariant norms and bilinear matrix products. Linear Multilinear Algebra 30:303–314

    Article  MathSciNet  MATH  Google Scholar 

  48. Bertsekas D, Tsitsiklis J (1997) Parallel and distributed computation: numerical methods, 2nd edn. Athena Scientific, Singapore

    MATH  Google Scholar 

  49. Ling Q, Tian Z (2010) Decentralized sparse signal recovery for compressive sleeping wireless sensor networks. IEEE Trans Signal Process 58(7):3816–3827

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical and Computer Engineering, University of Tabriz, Tabriz, Iran

    Ghanbar Azarnia, Mohammad Ali Tinati & Tohid Yousefi Rezaii

Authors
  1. Ghanbar Azarnia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Ali Tinati
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Tohid Yousefi Rezaii
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ghanbar Azarnia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Azarnia, G., Tinati, M.A. & Yousefi Rezaii, T. Generic cooperative and distributed algorithm for recovery of signals with the same sparsity profile in wireless sensor networks: a non-convex approach. J Supercomput 75, 2315–2340 (2019). https://doi.org/10.1007/s11227-018-2632-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-018-2632-y

Keywords

Search

Navigation

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy