Skip to main content

Advertisement

Log in

Deterministic binary matrix based compressive data aggregation in big data WSNs

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

In big data wireless sensor networks, the volume of data sharply increases at an unprecedented rate and the dense deployment of sensor nodes will lead to high spatial-temporal correlation and redundancy of sensors’ readings. Compressive data aggregation may be an indispensable way to eliminate the redundancy. However, the existing compressive data aggregation requires a large number of sensor nodes to take part in each measurement, which may cause heavy load in data transmission. To solve this problem, in this paper, we propose a new compressive data aggregation scheme based on compressive sensing. We apply the deterministic binary matrix based on low density parity check codes as measurement matrix. Each row of the measurement matrix represents a projection process. Owing to the sparsity characteristics of the matrix, only the nodes whose corresponding elements in the matrix are non-zero take part in each projection. Each projection can form an aggregation tree with minimum energy consumption. After all the measurements are collected, the sink node can recover original readings precisely. Simulation results show that our algorithm can efficiently reduce the number of the transmitted packets and the energy consumption of the whole network while reconstructing the original readings accurately.

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

Access this article

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
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Amini, A., & Marvasti, F. (2011). Deterministic construction of binary, bipolar, and ternary compressed sensing matrices. IEEE Transactions on Information Theory, 57(4), 2360–2370.

    Article  Google Scholar 

  2. Applebaum, L., Howard, S. D., Searle, S., et al. (2009). Chirp sensing codes: Deterministic compressed sensing measurements for fast recovery. Applied and Computational Harmonic Analysis, 26(2), 283–290.

    Article  Google Scholar 

  3. Candè, E. J., & Wakin, M. B. (2008). An introduction to compressive sampling. IEEE on Signal Processing Magazine, 25(2), 21–30.

    Article  Google Scholar 

  4. Candes, E. J., Romberg, J. K., & Tao, T. (2006). Stable signal recovery from incomplete and inaccurate measurements. Communications on Pure and Applied Mathematics, 59(8), 1207–1223.

    Article  Google Scholar 

  5. Chen, C. W., & Wang, Y. (2008). Chain-type wireless sensor network for monitoring long range infrastructures: Architecture and protocols. International Journal of Distributed Sensor Networks, 4(4), 287–314.

    Article  Google Scholar 

  6. Cios, K. J., Pedrycz, W., & Swiniarski, R. W. (1998). Data mining and knowledge discovery. In Data mining methods for knowledge discovery (pp. 1–26). Springer.

  7. Dimakis, A. G., Smarandache, R., & Vontobel, P. O. (2012). LDPC codes for compressed sensing. IEEE Transactions on Information Theory, 58(5), 3093–3114.

    Article  Google Scholar 

  8. Dai, W., & Milenkovic, O. (2009). Subspace pursuit for compressive sensing signal reconstruction. IEEE Transactions on Information Theory, 55(5), 2230–2249.

    Article  Google Scholar 

  9. Giridhar, A., & Kumar, P. R. (2005). Computing and communicating functions over sensor networks. IEEE Journal on Selected Areas in Communications, 23(4), 755–764.

    Article  Google Scholar 

  10. Howard, S. D., Calderbank, A. R., & Searle, S. J. (2008). A fast reconstruction algorithm for deterministic compressive sensing using second order Reed–Muller codes. In IEEE 42nd annual conference on information sciences and systems, 2008. CISS 2008 (pp. 11–15).

  11. Hu, X. Y., Eleftheriou, E., & Arnold, D. M. (2001). Progressive edge-growth Tanner graphs. In IEEE global telecommunications conference, GLOBECOM’01, 2001 (Vol. 2, pp. 995–1001).

  12. Hu, X. Y., Eleftheriou, E., & Arnold, D. M. (2005). Regular and irregular progressive edge-growth tanner graphs. IEEE Transactions on Information Theory, 51(1), 386–398.

    Article  Google Scholar 

  13. Iwen, M. A. (2009). Simple deterministically constructible RIP matrices with sublinear fourier sampling requirements. In CISS (pp. 870–875).

  14. Kou, Y., Lin, S., & Fossorier, M. P. C. (2000). Low density parity check codes: Construction based on finite geometries. In IEEE global telecommunications conference, GLOBECOM’00 (Vol. 2, pp. 825–829).

  15. Labrinidis, A., & Jagadish, H. V. (2012). Challenges and opportunities with big data. Proceedings of the VLDB Endowment, 5(12), 2032–2033.

    Article  Google Scholar 

  16. Lee, S., Pattem, S., Sathiamoorthy, M., et al. (2009). Compressed sensing and routing in multi-hop networks. University of Southern California CENG technical report.

  17. Li, S., Gao, F., Ge, G., & Zhang, S. (2012). Deterministic construction of compressed sensing matrices via algebraic curves. IEEE Transactions on Information Theory, 58(8), 5035–5041.

    Article  Google Scholar 

  18. Li, Z., Kumar, B. V. K. V. (2004). A class of good quasi-cyclic low-density parity check codes based on progressive edge growth graph. In IEEE Conference record of the thirty-eighth Asilomar conference on signals, systems and computers, 2004 (Vol. 2, pp. 1990–1994).

  19. Liu, X. Y., Zhu, Y., Kong, L., Liu, C., Gu, Y., Vasilakos, A. V., et al. (2015). CDC: Compressive data collection for wireless sensor networks. IEEE Transactions on Parallel and Distributed Systems, 26(8), 2188–2197.

    Article  Google Scholar 

  20. Lu, W., Kpalma, K., Ronsin, J. (2012). Sparse binary matrices of LDPC codes for compressed sensing. In Data compression conference (DCC) (10 p.).

  21. Luo, J., Xiang, L., Rosenberg, C. (2010). Does compressed sensing improve the throughput of wireless sensor networks? In IEEE international conference on communications (ICC), 2010 (pp. 1–6).

  22. Needell, D., & Tropp, J. A. (2009). CoSaMP: Iterative signal recovery from incomplete and inaccurate samples. Applied and Computational Harmonic Analysis, 26(3), 301–321.

  23. Pati, Y. C., Rezaiifar, R., Krishnaprasad, P. S. (1993). Orthogonal matching pursuit: Recursive function approximation with applications to wavelet decomposition. In Proceedings 27th annual Asilomar conference on signals, systems and computers, 1993 (pp. 40–44).

  24. Rooshenas, A., Rabiee, H. R., Movaghar, A., et al. (2010). Reducing the data transmission in wireless sensor networks using the principal component analysis. In IEEE sixth international conference on intelligent sensors, sensor networks and information processing (ISSNIP), 2010 (pp. 133–138).

  25. Tang, H., Xu, J., Lin, S., et al. (2005). Codes on finite geometries. IEEE Transactions on Information Theory, 51(2), 572–596.

    Article  Google Scholar 

  26. Tsai, T. Y., Lan, W. C., Liu, C., et al. (2013). Distributed compressive data aggregation in large-scale wireless sensor networks. Journal of Advanced Computer Networks, 1(4), 295–300.

    Google Scholar 

  27. Wang, C., Zhang, X., & Li, O. (2015). Sparse random projection algorithm based on minimum energy tree in wireless sensor network. Journal of Communications, 10(9), 740–746.

  28. Wang, W., Garofalakis, M., & Ramchandran, K. (2007). Distributed sparse random projections for refinable approximation. In Proceedings of the 6th international conference on information processing in sensor networks. ACM (pp. 331–339).

  29. Wang, Y., Zhu, Y., Jiang, R., et al. (2014). Distributed compressive data gathering in low duty cycled wireless sensor networks. In 2014 IEEE 33rd international performance computing and communications conference (IPCCC) (pp. 1–8).

  30. Xu, J., Guo, S., Xiao, B., et al. (2015). Energy-efficient big data storage and retrieval for wireless sensor networks with nonuniform node distribution. Concurrency and Computation: Practice and Experience, 27(18), 5765–5779.

  31. Xu, X., Ansari, R., Khokhar, A., et al. (2015). Hierarchical data aggregation using compressive sensing (HDACS) in WSNs. ACM Transactions on Sensor Networks (TOSN), 11(3), 45.

    Article  Google Scholar 

Download references

Acknowledgements

This work was supported by the National Natural Science Foundation of China (61373179, 61373178, 61402381), Science and Technology Leading Talent Promotion Project of Chongqing (cstc2013kjrcljrccj40001), Natural Science Key Foundation of Chongqing (cstc2015jcyjBX0094) and Fundamental Research Funds for the Central Universities (XDJK2016A011, SWU113020, XDJK2013C094).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Songtao Guo.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Liu, C., Guo, S., Shi, Y. et al. Deterministic binary matrix based compressive data aggregation in big data WSNs. Telecommun Syst 66, 345–356 (2017). https://doi.org/10.1007/s11235-017-0294-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11235-017-0294-3

Keywords

Navigation