Skip to main content

Distributed Compressed Sensing Based on Bipartite Graph in Wireless Sensor Networks

  • Conference paper
Advances in Swarm Intelligence (ICSI 2012)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7332))

Included in the following conference series:

  • 2193 Accesses

Abstract

In this paper, Combined with bipartite graph thought in graph theory distributed compressive sensing network architecture based on unbalanced expander is proposed. Meanwhile we’ve designed the distributed algorithm corresponding with the architecture. And we apply the distributed compressive sensing network based on unbalanced expander to the fire ground simulation experiment, through analysis of the mean square error and signal-to-noise ratio, we prove the proposed model not only takes good effect on reducing nodes’ energy consumption but also ensuring the performance for the signal reconstruction in noisy and noise-free case.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Lan, L.H., Ju, S.G., Jin, H.: Anonymizing social network using bipartite graph. In: International Conference of Computational and Information Sciences, pp. 993–996 (2010)

    Google Scholar 

  2. Cormode, G., Muthukrishnan, S.: Combinatorial algorithms for Compressed Sensing. In: Proc. 40th Ann. Conf. Information Sciences and Systems, Princeton, pp. 201–206 (2006)

    Google Scholar 

  3. Mhmudimanesh, M.D., Khelil, A.M., Suri, N.R.: Reordering for Better Compressibility: Efficient Spatial Sampling in Wireless Sensor Networks. In: The Third IEEE International Coference on Sensor Network, Ubiquitous, pp. 50–57 (2010)

    Google Scholar 

  4. Castro, Y.D.: Error Prediction and Variable Selection Via Unbalance. Statistics Theory 211, 504–510 (2010)

    Google Scholar 

  5. Donoho, D.L.: Compressed Sensing. IEEE Trans. Info. Theory 4, 1289–1306 (2006)

    Article  MathSciNet  Google Scholar 

  6. Wang, W., Garofalakis, M., Ramchandran, K.W.: Distributed Sparse Random Projections for Refinable Approximation. In: Information Processing in Sensor Networks, pp. 331–339 (2007)

    Google Scholar 

  7. Hu, H.F., Yang, Z.: Spatial Correlation-Based Distributed Compressed Sensing in Wireless Sensor Neteorks. In: 6th International Conference of Wireless Communications Networking and Mobile Computing, Chengdu, pp. 876–878 (2010)

    Google Scholar 

  8. Daniel, O., Gonzalo, A., Generali, R.: Restricted Isometry Property for alphastable random projections. In: IEEE International Conference of Acoustics, Speech and Signal Processing, pp. 3676–3679 (2011)

    Google Scholar 

  9. Xu, W., Hassib, B.: Efficiente compressive sensing with determinstic guarantees using expander graphs. In: IEEE Information Theory Workshop, pp. 204–209 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhuang, Z., Wei, C., Li, F. (2012). Distributed Compressed Sensing Based on Bipartite Graph in Wireless Sensor Networks. In: Tan, Y., Shi, Y., Ji, Z. (eds) Advances in Swarm Intelligence. ICSI 2012. Lecture Notes in Computer Science, vol 7332. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31020-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-31020-1_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-31019-5

  • Online ISBN: 978-3-642-31020-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics