Skip to main content

Joint Optimization of Routing and Storage Node Deployment in Heterogeneous Wireless Sensor Networks Towards Reliable Data Storage

  • Conference paper
  • First Online:
Wireless Algorithms, Systems, and Applications (WASA 2019)

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

Abstract

The penetration of Wireless Sensor Networks (WSNs) in various applications poses a high demand on reliable data storage, especially considering sensor networks are usually deployed in harsh environment. In this paper, we introduce Heterogeneous Wireless Sensor Networks where robust storage nodes are deployed in sensor networks and data redundancy is utilized through coding techniques, in order to improve the reliability of data storage. Taking into account the cost of both data delivery and storage, we propose an algorithm to jointly optimize data routing and storage node deployment. This problem is a binary non-linear combinatorial optimization, and it is highly non-trivial to design efficient algorithms due to its NP-hardness. By levering the Markov approximation framework, we elaborately deign a Continuous Time Markov Chain (CTMC) based scheduling algorithm to drive the storage node deployment and the corresponding routing strategy. Extensive simulations are performed to verify the efficacy of our algorithm.

This work is partially supported by Shandong Provincial Natural Science Foundation, China (Grant No. ZR2017QF005) and NSFC (Grant No. 61702304, 61832012, 61602195, 61672321 and 61771289).

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

Notes

  1. 1.

    We assume that the data storage is performed periodically in individual nodes. In each period, the data cumulated in the sensing phase are encoded and delivered to the storage nodes.

  2. 2.

    The shortest paths can be calculated through applying many state-of-the-art algorithms, as we will show in Sect. 3.1 later.

References

  1. Akyildiz, I., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Comput. Netw. 38(4), 393–422 (2002)

    Google Scholar 

  2. Albano, M., Chessa, S.: Distributed erasure coding in data centric storage for wireless sensor networks. In: Proceedings of IEEE ISCC, pp. 22–27 (2009)

    Google Scholar 

  3. Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)

    Google Scholar 

  4. Chen, M., Liew, S., Shao, Z., Kai, C.: Markov approximation for combinatorial network optimization. IEEE Trans. Inf. Theory 59(10), 6301–6327 (2013)

    Google Scholar 

  5. Cheng, S., Cai, Z., Li, J.: Curve query processing in wireless sensor networks. IEEE Trans. Veh. Technol. 64(11), 5198–5209 (2015)

    Google Scholar 

  6. Cheng, S., Cai, Z., Li, J., Gao, H.: Extracting kernel dataset from big sensory data in wireless sensor networks. IEEE Trans. Knowl. Data Eng. 29(4), 813–827 (2017)

    Google Scholar 

  7. D’Angelo, G., Diodati, D., Navarra, A., Pinotti, C.: The minimum k-storage problem: complexity, approximation, and experimental analysis. IEEE Trans. Mob. Comput. 5(7), 1797–1811 (2016)

    Google Scholar 

  8. Deng, R., He, S., Chen, J.: An online algorithm for data collection by multiple sinks in wireless-sensor networks. IEEE Trans. Control Netw. Syst. 5(1), 93–104 (2018)

    Google Scholar 

  9. Dimakis, A., Prabhakaran, V., Ramchandran, K.: Decentralized erasure codes for distributed networked storage. IEEE Trans. Inf. Theory 52(6), 2809–2816 (2006)

    Google Scholar 

  10. Gallager, R.: Stochastic Processes: Theory for Applications, 1st edn. Cambridge University Press, Cambridge (2014)

    Google Scholar 

  11. Ghaffari, M., Li, J.: Improved distributed algorithms for exact shortest paths. In: Proceedings of the 50th ACM STOC, pp. 431–444 (2018)

    Google Scholar 

  12. He, Z., Cai, Z., Cheng, S., Wang, X.: Approximate aggregation for tracking quantiles and range countings in wireless sensor networks. Theor. Comput. Sci. 607(3), 381–390 (2015)

    Google Scholar 

  13. Holzer, S., Wattenhofer, R.: Optimal distributed all pairs shortest paths and applications. In: Proceedings of ACM PODC, pp. 355–364 (2012)

    Google Scholar 

  14. Li, F., Yang, Y., Chi, Z., Zhao, L., Yang, Y., Luo, J.: Trinity: enabling self-sustaining WSNs indoors with energy-free sensing and networking. ACM Trans. Embed. Comput. Syst. 17(2), 57:1–57:27 (2018)

    Google Scholar 

  15. Li, J., Cheng, S., Cai, Z., Yu, J., Wang, C., Li, Y.: Approximate holistic aggregation in wireless sensor networks. ACM Trans. Sens. Netw. 13(2), 11:1–11:24 (2017)

    Google Scholar 

  16. Liu, Q., Zhang, K., Liu, X., Linge, N.: Grid routing: an energy-efficient routing protocol for WSNs with single mobile sink. Int. J. Sens. Netw. 25(2), 93–103 (2017)

    Google Scholar 

  17. Luo, J., Li, F., He, Y.: 3DQS: distributed data access in 3D wireless sensor networks. In: Proceedings of IEEE ICC, pp. 1–5 (2011)

    Google Scholar 

  18. Maia, G., Guidoni, D., Viana, A., Aquino, A., Mini, R., Loureiro, A.: A distributed data storage protocol for heterogeneous wireless sensor networks with mobile sinks. Ad Hoc Netw. 11(5), 1588–1602 (2013)

    Google Scholar 

  19. Sheng, B., Li, Q., Mao, W.: Data storage placement in sensor networks. In: Proceedings of ACM MobiHoc, pp. 344–355 (2006)

    Google Scholar 

  20. Talari, A., Rahnavard, N.: CStorage: decentralized compressive data storage in wireless sensor networks. Ad Hoc Netw. 37, 475–485 (2016)

    Google Scholar 

  21. Tian, J., Yan, T., Wang, G.: A network coding based energy efficient data backup in survivability-heterogeneous sensor networks. IEEE Trans. Mob. Comput. 4(10), 1992–2006 (2015)

    Google Scholar 

  22. Wang, J., Cao, J., Sherratt, R., Park, J.: An improved ant colony optimization-based approach with mobile sink for wireless sensor networks. J. Supercomput. 74(12), 6633–6645 (2018)

    Google Scholar 

  23. Yang, X., Tao, X., Dutkiewicz, E., Huang, X., Guo, Y., Cui, Q.: Energy-efficient distributed data storage for wireless sensor networks based on compressed sensing and network coding. IEEE Trans. Wirel. Commun. 12(10), 5087–5099 (2013)

    Google Scholar 

  24. Zeng, R., Jiang, Y., Lin, C., Fan, Y., Shen, X.: A distributed fault/intrusion-tolerant sensor data storage scheme based on network coding and homomorphic fingerprinting. IEEE Trans. Parallel Distrib. Syst. 23(10), 1819–1830 (2012)

    Google Scholar 

  25. Zhang, C., Luo, J., Xiang, L., Li, F., Lin, J., He, Y.: Harmonic quorum systems: data management in 2D/3D wireless sensor networks with holes. In: Proceedings of IEEE SECON, pp. 1–9 (2012)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Dongxiao Yu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Li, F., Yang, H., Zou, Y., Yu, D., Yu, J. (2019). Joint Optimization of Routing and Storage Node Deployment in Heterogeneous Wireless Sensor Networks Towards Reliable Data Storage. In: Biagioni, E., Zheng, Y., Cheng, S. (eds) Wireless Algorithms, Systems, and Applications. WASA 2019. Lecture Notes in Computer Science(), vol 11604. Springer, Cham. https://doi.org/10.1007/978-3-030-23597-0_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-23597-0_13

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-23596-3

  • Online ISBN: 978-3-030-23597-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics