Skip to main content

Advertisement

Springer Nature Link
Log in

Distributed probabilistic routing for sensor network lifetime optimization

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

A probabilistic and distributed routing approach for multi-hop sensor network lifetime optimization is presented in this paper. In particular, each sensor self-adjusts their routing probabilities locally to their forwarders based on its neighborhood knowledge, while aiming at optimizing the overall network lifetime (defined as the elapsed time before the first node runs out of energy). The theoretical feasibility and a practical routing algorithm are presented. Specifically, a sufficient distributed condition regarding the neighborhood state for distributed probabilistic routing to achieve the optimal network lifetime is presented theoretically. Based on it, a distributed adaptive probabilistic routing (DAPR) algorithm, which considered both the transmission scheduling and the routing probability evolvement is developed. We prove quantitatively that DAPR could lead the routing probabilities of the distributed sensors to converge to an optimal state which optimizes the network lifetime. Further, when network dynamics happen, such as topology changes, DAPR can adjust the routing probabilities quickly to converge to a new state for optimizing the remained network lifetime. We presented the convergence speed of DAPR. Extensive simulations verified its convergence and near-optimal properties. The results also showed its quick adaptation to both the network topology and data rate dynamics.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Notes

  1. In our online demo [15], users can generate random network topologies or manually control the network topologies to evaluate and compare the performance of DAPR, Greedy, DLBT and Level-based balancing algorithms.

References

  1. Wang, H., Agoulmine, N., Ma, M., & Jin, Y. (2010). Network lifetime optimization in wireless sensor networks. IEEE Journal on Selected Areas in Communications, 28(7), 1127–1137.

    Article  Google Scholar 

  2. Degirmenci, G., Kharoufeh, J. P., & Prokopyev, O. A. (2014). Maximizing the lifetime of query-based wireless sensor networks. ACM Transactions on Sensor Networks, 10(4), 56:1–56:24.

    Article  Google Scholar 

  3. Powell, O., Leone, P., & Rolim, J. (2007). Energy optimal data propagation in wireless sensor networks. Journal of Parallel and Distributed Computing, 67, 302–317.

    Article  MATH  Google Scholar 

  4. Efthymiou, C., Nikoletseas, S., & Rolim, J. (2006). Energy balanced data propagation in wireless sensor networks. Wireless Networks, 12, 691–707.

    Article  Google Scholar 

  5. Jarry, A., Leone, P., Powell, O., & Rolim, J. (2006). An optimal data propagation algorithm for maximizing the lifespan of sensor networks. DCOSS’2006 (Vol. 4026, pp. 405–421)., Lecture Notes in Computer Science. Berlin/Heidelberg: Springer.

  6. Buragohain, C., Agrawal, D., Suri, S. (2005). Power aware routing for sensor databases. INFOCOM’05, pages 1747–1757 2881

  7. Ghadimi, E., Landsiedel, O., Soldati, P., Duquennoy, S., & Johansson, Mikael. (2014). Opportunistic routing in low duty-cycle wireless sensor networks. ACM Transactions on Sensor Networks, 10(4), 67:1–67:39.

    Article  Google Scholar 

  8. Boukerche, A., Efstathiou, D., Nikoletseas, S., & Raptopoulos, C. (2011). Close-to-optimal energy balanced data propagation via limited, local network density information. Proceedings of the 14th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems, MSWiM ’11 (pp. 85–92). New York: NY, USA, ACM.

  9. Dietrich, I., & Dressler, F. (2009). On the lifetime of wireless sensor networks. ACM Transactions on Sensor Networks, 5(1), 5:1–5:39.

    Article  Google Scholar 

  10. Liang, W. F., & Liu, Y. Z. (2007). Online data gathering for maximizing network lifetime in sensor networks. IEEE Transactions on Mobile Computing, 6(1), 2–11.

    Article  Google Scholar 

  11. Liang, L. W. (2010). Prolonging network lifetime for data gathering in wireless sensor networks. IEEE Transactions on Computers (in press).

  12. Wu, K., & Liu, A. (1995). Rearrangement inequality. Mathematics Competitions, 8, 53–60.

    Google Scholar 

  13. Wang, Y., Wang, Y., Qi, X. (2010). Guided-evolving:convergence to globally optimal load balance by distributed computing using local information, mobicom’10 demo, online at.

  14. Yan, T., Bi, Y., Sun, L., & Zhu, H. (2005). Probability based dynamic load-balancing tree algorithm for wireless sensor networks. Networking and Mobile Computing (Vol. 3619, pp. 682–691)., Lecture Notes in Computer Science. Berlin/Heidelberg: Springer.

  15. Wang, Y., Wang, Y., Qi, X. (2010). Guided-evolution: Convergence to global optimal by distributed computing using local information. Demo in MobiCom’10, online at: http://project.iiis.tsinghua.edu.cn/balance.

  16. Dag package, http://www-sigproc.eng.cam.ac.uk/atc27/matlab/layout.html.

  17. Chang, J.-H., & Tassiulas, L. (2004). Maximum lifetime routing in wireless sensor networks. IEEE/ACM Transactions on Networking, 12(4), 609–619.

    Article  Google Scholar 

  18. Sankar A., Liu, Z. (March 2004). Maximum lifetime routing in wireless ad-hoc networks. In INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies, Vol. 2, pages 1089–1097.

  19. Dai, H., Han, R. (2003). A node-centric load balancing algorithm for wireless sensor networks. Globecom’03, pp. 548–552 4209.

  20. Madan, R., & Lall, S. (2006). Distributed algorithms for maximum lifetime routing in wireless sensor networks. IEEE Transactions on Wireless Communications, 5(8), 2185–2193.

    Article  Google Scholar 

  21. Xue, Y., Cui, Y., Nahrstedt, K. (2005). A utility-based distributed maximum lifetime routing algorithm for wireless networks. In Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks, 2005, pp. 10–18.

  22. Jarry, A., Leone, P., & Nikoletseas, S. (2010). Optimal data gathering paths and energy balance mechanisms in wireless networks. DCOSS’2010 (Vol. 6131, pp. 288–305)., Lecture Notes in Computer Science. Berlin/Heidelberg: Springer.

  23. Barrett, C. L., Eidenbenz, S. J., Kroc, L., Marathe, M., & Smith, J. P. (2003). Parametric probabilistic sensor network routing. WSNA ’03 (pp. 122–131). New York: NY, USA, ACM.

  24. Chen, Y. R., Yu, L., Dong, Q. F., & Hong, Z. (2011). Distributed lifetime optimized routing algorithm for wireless sensor networks. Applied Mechanics and Materials, 40–41, 448–452.

    Article  Google Scholar 

  25. Razzaque, M. A., Hong, C. S. (2008). Load and energy balanced geographic routing for sensor networks. 10th International Conference on Advanced Communication Technology, Vol. I-III, pp. 1419–1422.

  26. Nguyen, D. T., Choi, W., Ha, M. T., & Choo, H. (2011). Design and analysis of a multi-candidate selection scheme for greedy routing in wireless sensor networks. Journal of Network and Computer Applications, 34(6), 1805–1817.

    Article  Google Scholar 

  27. Huang, X. X., & Fang, Y. G. (2008). Multiconstrained qos multipath routing in wireless sensor networks. Wireless Networks, 14(4), 465–478.

    Article  Google Scholar 

  28. Sanati, S., Yaghmaee, M. H., Beheshti, A. (2009). Energy aware multi-path and multi-speed routing protocol in wireless sensor networks. 2009 14th International Computer Conference, pp. 639–644,

  29. Sung, E. S., Potkonjak, M. (2009). Localized probabilistic routing for data gathering in wireless ad hoc networks. 2009 7th Annual Communication Networks and Services Research Conference, pp. 356–363.

  30. Wu, S. B., & Candan, K. S. (2007). Power-aware single- and multipath geographic routing in sensor networks. Ad Hoc Networks, 5(7), 974–997.

    Article  Google Scholar 

  31. Zhu, X. Q., Girod, B. (2005). A distributed algorithm for congestion-minimized multi-path routing over ad hoc networks. ICME’05, pp. 1485–1488.

  32. Tsai, Y. -P., Liu, R. -S., Luo, J. -T. (2009). Load balance based on path energy and self-maintenance routing protocol in wireless sensor networks. Lecture Notes in Computer Science, Vol. 5787, pp. 431–434. Springer: Berlin/Heidelberg

  33. Franceschelli, M., Giua, A., & Seatzu, C. (2009). Load balancing over heterogeneous networks with gossip-based algorithms. American Control Conference (ACC)’09, pp. 1987–1993.

  34. Lee, H., Keshavarzian, A., & Aghajan, H. (2010). Near-lifetime-optimal data collection in wireless sensor networks via spatio–temporal load balancing. ACM Transactions on Sensor Networks, 6, 26:1–26:32.

    Article  Google Scholar 

Download references

Acknowledgments

This work was supported in part by the National Natural Science Foundation of China (No. 61202360), the Fundamental Research Funds for the Central Universities in China (No. 21614324), and the Natural Science Foundation of Guangdong Province (No. 2014A030310172).

Author information

Authors and Affiliations

  1. Institute for Interdisciplinary Information Sciences, Tsinghua University, Beijing, China

    Yongcai Wang

  2. Department of Computer Science, Jinan University, Guangzhou, China

    Haisheng Tan

Authors
  1. Yongcai Wang
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Haisheng Tan
    View author publications

    You can also search for this author inPubMed Google Scholar

Corresponding author

Correspondence to Haisheng Tan.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Y., Tan, H. Distributed probabilistic routing for sensor network lifetime optimization. Wireless Netw 22, 975–989 (2016). https://doi.org/10.1007/s11276-015-1012-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-015-1012-2

Keywords