Skip to main content

Advertisement

SpringerLink
Log in

Single-path routing for life time maximization in multi-hop wireless networks

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

Energy-aware routing is important in multi-hop wireless networks that are powered by battery, e.g., wireless sensor networks. To maximize the network survivability, the energy efficiency of paths must be taken into account for route selection. Simple heuristics such as choosing paths with minimal energy consumption are ineffective, because the energy of the nodes on such paths may deplete quickly. The issue is particularly serious for the networks with regular traffic pattern as in monitoring sensor applications. Existing solutions to this issue typically adopt the multi-path routing approach, in which multiple paths are set up between source and destination and one (or all) of the paths is (are) used at a certain moment. However, this approach involves high overhead for establishment and management of multiple paths. In this paper, we present a static single-path routing scheme which uses one energy-efficient path for each communicating peer throughout the network lifetime, eliminating the overhead of multi-path routing. It is theoretically proved that our routing scheme achieves a constant factor approximate of the optimal solution. We compare the performance of the proposed scheme with that of multi-path routing via simulations. Despite the use of single static path, the proposed scheme outperforms existing multi-path routing schemes and produces performance close to the optimal multi-path solution, particularly in heavily loaded networks and multiple-gateway networks.

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

Access this article

Log in via an institution

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
Fig. 10
Fig. 11
Fig. 12

Similar content being viewed by others

Notes

  1. Note that the downstream only case or the upstream/downstream mixed case can be easily driven.

  2. Among three formulation models presented in this paper, only the basic model can compute the route selection by one time execution of LP solver, and other two more sophisticated models require multiple executions of LP solvers. While the other two models may produce higher performance, we use only the basic model in the simulations as it is the most practical choice.

References

  1. Zhao, F., & Guibas, L. (2004). Wireless sensor networks: An information processing approach. San Francisco: Morgan Kaufmann Publishers.

    Google Scholar 

  2. Cordeiro, C., & Agrawal, D. (2006). Ad Hoc & sensor networks: Theory and applications. Singapore: World Scientific.

    Google Scholar 

  3. Ganjali, Y., & Keshavarzian, A. (2004). Load balancing in ad hoc networks: Single-path routing vs. multi-path routing. In Proceedings of IEEE INFOCOM’04, Hong Kong.

  4. Jones, C. E., Sivalingam, K. M., Agrawal, P., & Chen, J.-C. (2001). A survey of energy efficient network protocols for wireless networks. Wireless Networks, 7(4), 343–358.

    Article  MATH  Google Scholar 

  5. Banerjee, S., & Misra, A. (2002). Minimum energy paths for reliable communication in multi-hop wireless networks. In Proceedings of ACM Mobihoc’02 (pp. 146–156).

  6. Cruz, R. L., & Santhanam, A. (2003). Optimal routing, link scheduling, and power control in multi-hop wireless networks. In Proceedings of IEEE INFOCOM’03, San Francisco, CA, USA.

  7. Bhatia, R., & Kodialam, M. (2004). On power efficient communication over multi-hop wireless networks: Joint routing, scheduling and power control. In Proceedings of IEEE INFOCOM’03, Hong Kong.

  8. Kodialam, M., & Nandagopal, T. (2003). Characterizing the achievable rates in multihop wireless networks. In Proceedings of ACM Mobicom’03, San Diego, CA, USA (pp. 42–52).

  9. Zhu, J., & Wang, X. (2005). PEER: A progressive energy efficient routing protocol for wireless ad hoc networks. In Proceedings of IEEE INFOCOM’05, Miami, FL, USA (pp. 1887–1896).

  10. Hsiao, P.-H., Hwang, A., Kung, H. T., & Vlah, D. (2001). Load balancing routing for wireless access networks. In Proceedings of IEEE INFOCOM’01, Anchorage, Alaska, USA (pp. 986–995).

  11. Li, Q., Aslam, J., & Rus, D. (2001). Online power-aware routing in wireless ad-hoc networks. In Proceedings of ACM Mobicom’01, Rome, Italy (pp. 97–107).

  12. Kar, K., Kodialam, M., Lakshman, T. V., & Tassiulas, L. (2003). Routing for network capacity maximization in energy-constrained ad-hoc networks. In Proceedings IEEE INFOCOM’03, San Francisco, CA, USA.

  13. Popa, L., Rostamizadeh, A., Karp, R., Papadimitriou, C., & Stoica, I. (2007). Balancing traffic load in wireless networks with curveball routing. In Proceedings of ACM MobiHoc’07, Montreal, QC, Canada.

  14. Chang, J. H., & Tassiulas, L. (2000). Energy conserving routing in wireless ad-hoc networks. In Proceedings of IEEE INFOCOM’0000, Tel-Aviv, Israel, March.

  15. Srinivasan, V., Chiasserini, C.-F., Nuggehalli, P., & Rao, R. (2002). Optimal rate allocation and traffic splits for energy efficient routing in ad hoc networks. In Proceedings of IEEE INFOCOM’02, New York, NY, USA (pp. 950–957).

  16. Zussman, G., & Segall, A. (2003). Energy efficient routing in ad hoc disaster recovery networks. In Proceedings of IEEE INFOCOM’03, San Francisco, CA, USA.

  17. Zhu, J., & Wang, X. (2005). PEER: A progressive energy efficient routing protocol for wireless ad hoc networks. In Proceedings of IEEE INFOCOM’05, Miami, FL, USA (pp. 1887–1896).

  18. Slama, I., Jouaber, B., & Zeghlache, D. (2006). Routing for wireless sensor networks lifetime maximisation under energy constraints. In Proceedings of the 3rd international conference on Mobile technology, applications & systems Mobility’06, Bangkok, Thailand.

  19. Ma, C., & Yang, Y. (2006). Battery-aware routing for streaming data transmissions in wireless sensor networks. Mobile Networks and Applications, 11(5), 757–767.

    Article  Google Scholar 

  20. Chen, Y., & Nasser, N. (2006). Energy-balancing multipath routing protocol for wireless sensor networks. In Proceedings of the 3rd international conference on quality of service in heterogeneous wired/wireless networks QShine’06, Waterloo, ON, Canada.

  21. Yu, M., Malvankar, A., & Foo, S. (2006). An energy-efficient path availability routing algorithm for mobile ad hoc sensor networks. In Proceedings of IEEE ICC’06, Istanbul, Turkey.

  22. Luo, H., Luo, J., & Liu, Y. (2005). Energy efficient routing with adaptive data fusion in sensor networks. In Proceedings of the 2005 joint workshop on foundations of mobile computing DIALM-POMC’05, Cologne, Germany.

  23. Garey, M. R., & Johnson, D. S. (1979). Computers and intractability: A guide to the theory of NP-completeness. New York: Freeman Publication.

    MATH  Google Scholar 

  24. Dinitz, Y., Garg, N., & Goemans, M. X. (1998). On the single-source unsplittable flow problem. In IEEE symposium on foundations of computer science, FOCS’08 (pp. 290–299).

  25. Kolliopoulos, S. G., & Stein, C. (1997). Improved approximation algorithms for unsplittable flow problems. In Proceedings of the 38th annual IEEE computer society conference on foundations of computer science, FOCS’97, Miami Beach, FL, USA, October (pp. 426–435).

  26. Hua, C., & Peter Yum, T. S. (2008). Data aggregated maximum lifetime routing for wireless sensor networks. Elsevier Ad Hoc Networks, 6(3), 380–392.

    Article  Google Scholar 

  27. Luo, J., & Hubaux, J. P. (2009). Joint sink mobility and routing to maximize the lifetime of wireless sensor networks: The case of constrained mobility. IEEE/ACM transactions on networking, issue 99, November (pp. 1–14).

  28. Gatzianas, M., & Georgiadis, L. (2008). A distributed algorithm for maximum lifetime routing in sensor networks with mobile sink. IEEE Transactions on Wireless Communications, 7(3), 984–994.

    Article  Google Scholar 

Download references

Acknowledgments

This work was partially supported by the IT R&D program of MKE/KEIT [KI002137, Ultra Small Cell Based Autonomic Wireless Network].

Author information

Authors and Affiliations

  1. Bell Labs, Alcatel-Lucent, Murray Hill, NJ, USA

    Yigal Bejerano

  2. Department of Computer Science, Yonsei University, Seoul, Korea

    Keon-Taek Lee & Seung-Jae Han

  3. Department of Computer Science and Engineering, IIT, New Delhi, Delhi, India

    Amit Kumar

Authors
  1. Yigal Bejerano
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Keon-Taek Lee
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Seung-Jae Han
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Amit Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Seung-Jae Han.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bejerano, Y., Lee, KT., Han, SJ. et al. Single-path routing for life time maximization in multi-hop wireless networks. Wireless Netw 17, 263–275 (2011). https://doi.org/10.1007/s11276-010-0278-7

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-010-0278-7

Keywords

Search

Navigation