Skip to main content

Probability Based Algorithms for Guaranteeing the Stability of Rechargeable Wireless Sensor Networks

  • Conference paper
  • 2556 Accesses

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

Abstract

The lifetime of a wireless sensor network can be prolonged by introducing mobile sink to balance the energy consumption in data gathering. However, it doesn’t solve the bottleneck of energy consumption and network will still fail inevitably. The option of recharging a relay opens up new possibilities for prolonging the network lifetime even maintaining the network living forever by recharging a sensor using a mobile sink when necessary. In this paper, we investigate the strategies for the mobile sink to recharge the wireless network in order to maintain the stability of network achieving the requirement of network system. In our approach, we develop an efficient algorithm to divide the sensor network into a number of domains  (independent communication areas which are consisted by a cluster of neighbored sensors) in the first stage. Then we iteratively calculate the maximum lifetime of each domain. When travelling and arriving at a domain, mobile sink determines whether or not recharge it according to the probability model. The lifetime of a domain is estimated based on the residual energy of each sensor within the domain using our energy routing algorithm. We also propose a probability model for the mobile sink to determine whether to recharge a domain or not. The effectiveness of our approach has been verified by extensive simulation results.

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

Buying options

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Liang, W., Schweitzer, P., Xu, Z.: Approximation Algorithms for Capacitated Minimu Forest Problems in Wireless Sensor Networks with a Mobile Sink. IEEE Transactions on Computers 62(10) (2012)

    Google Scholar 

  2. Buragohain, C., Agrawal, D., Suri, S.: Power Aware Routing For Sensor Database. Proceedings of INFOCOM (2005)

    Google Scholar 

  3. Cristescu, R., Beferull-Lozano, B., Vetterli, M.: On Network Correlated Data Gathering. In: Proceedgins of INFOCOM (2004)

    Google Scholar 

  4. Vieira, M.A.M., Coelho, C.N.: Survey on Wireless Sensor Network Devices. In: Emerging Technologies and Factory Automation, vol. 1, pp. 537–544 (2003)

    Google Scholar 

  5. Bari, A., Teng, D., Jaekel, A.: Optimal Relay Node Placement in Hierachical Sensor Networks with Mobile Data Collector. In: Global Telecommunications Conference, pp. 1–5 (2011)

    Google Scholar 

  6. Feng, S., Liang, W., Luo, J., Xu, X.: Network lifetime maximation for time-sensitive data gathering in wireless sensor network. Computer Networks 11(1), 47–60 (2012)

    Google Scholar 

  7. Liu, W., Fan, J., Zhang, S., Wang, X.: Relay Hop Constrained Rendezvous Algorithm for Mobile Data Gathering in Wireless Sensor Networks. In: Hsu, C.-H., Li, X., Shi, X., Zheng, R. (eds.) NPC 2013. LNCS, vol. 8147, pp. 332–343. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  8. Tan, H.O., Korpeoglu, I.: Power Efficient Data Gathering and Aggregation in Wireless Sensor Network. SIGMOD Record 32(4), 66–71 (2003)

    Article  Google Scholar 

  9. Faith, S., Mohamed, Y.: Optimized Connectivity Restoration in a Partitioned Wireless Sensor Network. Information Processing Letters 69, 53–57 (2011)

    Google Scholar 

  10. Izzet, F.S., Kemal, A., Rith, S., Mohamed, Y.: Connectivity Restoration in Disjoint Wireless Sensor Networks using Limited Number of Mobile Relays. IEEE Transactions on Mobile Computing 11(1), 47–60 (2012)

    Article  Google Scholar 

  11. Khuller, S., Raghavachari, B., Neal, Y.: Balancing Minimum Spanning and Shortest Path Trees. IEEE Transactions on Mobile Computing 11(1), 47–60 (2012)

    Article  Google Scholar 

  12. Wadaa, A., Olariu, S., Wilson, L., Jones, K., Xu, Q.: On Training a Sensor Networks. In: Proc. of Parallel and Distributed Processing Symp. (2003)

    Google Scholar 

  13. Ataul, B., Da, T., Arunita, J.: Maximum Flow Based Model and Method of the Maximum Lifetime Problem of Sensor Network. In: Intelligent Control and Automation, pp. 21–23 (2006)

    Google Scholar 

  14. Sharaf, M.A., Beacer, J., Labrinidis, A., Chrysanthis, P.A.: Balancing Energy Effcientcy and Quality of Aggregate Data in Sensor Networks. Journal of VLDB (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Gao, Y., Yu, C., Xiao, J., Sun, J., Jiang, G., Wang, H. (2014). Probability Based Algorithms for Guaranteeing the Stability of Rechargeable Wireless Sensor Networks. In: Sun, Xh., et al. Algorithms and Architectures for Parallel Processing. ICA3PP 2014. Lecture Notes in Computer Science, vol 8630. Springer, Cham. https://doi.org/10.1007/978-3-319-11197-1_8

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11197-1_8

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11196-4

  • Online ISBN: 978-3-319-11197-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics