Skip to main content

A Framework for Overall Storage Overflow Problem to Maximize the Lifetime in WSNs

  • Conference paper
  • First Online:
Combinatorial Optimization and Applications (COCOA 2017)

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

Abstract

Storage overflow problem in wireless sensor networks is a new and challenging issue, wherein data-collecting base station is not available while more data items are generated than available storage space in the entire network. In this paper, we consider overall storage overflow problem in WSNs, the goal of which is to maximize the minimum remaining energy of data node (the node with overflow data) in order to prolong the lifetime of the sensor network. For overall storage overflow problem, we propose a two-step solution. A degree-constrained data aggregation algorithm is presented, and then we further propose a data replication algorithm which is a unified method, integrating data aggregation and data redistribution. Extensive simulations show that our proposed algorithms significantly outperform than existing algorithms especially in extending the lifetime of the sensor network.

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 EPUB and 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

References

  1. Tang, B., Ma, Y., Alhakami, B.: Dao: overcoming overall storage overflow in base station-less sensor networks via energy efficient data aggregation. Technical report, California State University Dominguez Hills

    Google Scholar 

  2. Alhakami, B., Tang, B., Han, J., Beheshti, M.: DAO-R: integrating data aggregation and offloading in sensor networks via data replication. In: 2015 IEEE Global Communications Conference (GLOBECOM), pp. 1–7 (2015)

    Google Scholar 

  3. Tang, B., Jaggi, N., Wu, H., Kurkal, R.: Energy-efficient data redistribution in sensor networks. ACM Trans. Sensor Netw. 9(2), 1–28 (2013)

    Article  Google Scholar 

  4. Hou, X., Sumpter, Z., Burson, L., Xue, X.: Maximizing data preservation in intermittently connected sensor networks. In: 2012 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Systems (MASS), pp. 448–452 (2012)

    Google Scholar 

  5. Takahashi, M., Tang, B., Jaggi, N.: Energy-efficient data preservation in intermittently connected sensor networks. In: 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp. 590–595 (2011)

    Google Scholar 

  6. Xue, X., Hou, X., Tang, B., Bagai, R.: Data preservation in intermittently connected sensor networks with data priority. In: 2013 10th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks (SECON), pp. 122–130 (2013)

    Google Scholar 

  7. Tang, B., Bagai, R., Nilofar, F., Yildirim, M.B.: A generalized data preservation problem in sensor networks–a network flow perspective. In: International Conference on Ad-Hoc Networks and Wireless (ADHOC-NOW), pp. 275–289 (2014)

    Google Scholar 

  8. Kuo, T.W., Lin, K.C.J., Tsai, M.J.: On the construction of data aggregation tree with minimum energy cost in wireless sensor networks: NP-completeness and approximation algorithms. IEEE Trans. Comput. 65(10), 3109–3121 (2016)

    Article  MATH  MathSciNet  Google Scholar 

  9. Chen, Z., Yang, G., Chen, L., Xu, J.: Constructing maximum-lifetime data-gathering tree in wsns based on compressed sensing. Int. J. Distrib. Sensor Netw. 12(5), 1–11 (2016)

    MathSciNet  Google Scholar 

  10. Yan, X., Du, H., Ye, Q., Song, G.: Minimum-delay data aggregation schedule in duty-cycled sensor networks. In: Yang, Q., Yu, W., Challal, Y. (eds.) WASA 2016. LNCS, vol. 9798, pp. 305–317. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-42836-9_28

    Chapter  Google Scholar 

  11. Lee, T., Kim, D.S., Choo, H., Kim, M.: A delay-aware scheduling for data aggregation in duty-cycled wireless sensor networks. In: 2013 IEEE 9th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN), pp. 254–261 (2013)

    Google Scholar 

  12. Liu, C., Du, H., Ye, Q.: Sweep coverage with return time constraint. In: 2016 IEEE Global Communications Conference (GLOBECOM), pp. 1–6 (2016)

    Google Scholar 

  13. Alia, O.M.: Dynamic relocation of mobile base station in wireless sensor networks using a cluster-based harmony search algorithm. Inf. Sci. 385–386, 76–95 (2017)

    Article  Google Scholar 

  14. Cristescu, R., Beferull-Lozano, B., Vetterli, M., Wattenhofer, R.: Network correlated data gathering with explicit communication: NP-completeness and algorithms. IEEE/ACM Trans. Netw. 14(1), 41–54 (2006)

    Article  Google Scholar 

  15. Heinzelman, W.R., Chandrakasan, A., Balakrishnan, H.: Energy-efficient communication protocol for wireless microsensor networks. In: 33rd Annual Hawaii International Conference on System Sciences (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Chen Zhang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Song, G., Zhang, C., Liu, C., Chai, Y. (2017). A Framework for Overall Storage Overflow Problem to Maximize the Lifetime in WSNs. In: Gao, X., Du, H., Han, M. (eds) Combinatorial Optimization and Applications. COCOA 2017. Lecture Notes in Computer Science(), vol 10627. Springer, Cham. https://doi.org/10.1007/978-3-319-71150-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-71150-8_2

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-71149-2

  • Online ISBN: 978-3-319-71150-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics