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

Yigal Bejerano, Seung Jae Han, Keon Taek Lee, Amit Kumar

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

Energy-aware routing is important in multi-hop wireless networks that are operated by battery power, 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 do not perform well, 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 algorithm which uses one energy-efficient path for each communicating peer throughout the network lifetime, eliminating the overhead of multi-path routing. It is proved that our algorithm 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 the dynamic multi-path approach, particularly under heavy network loads.

Original languageEnglish
Title of host publication33rd IEEE Conference on Local Computer Networks, LCN 2008
Pages160-167
Number of pages8
DOIs
Publication statusPublished - 2008 Dec 31
Event33rd IEEE Conference on Local Computer Networks, LCN 2008 - Montreal, AB, Canada
Duration: 2008 Oct 142008 Oct 17

Publication series

NameProceedings - Conference on Local Computer Networks, LCN

Other

Other33rd IEEE Conference on Local Computer Networks, LCN 2008
CountryCanada
CityMontreal, AB
Period08/10/1408/10/17

Fingerprint

Routing algorithms
Energy efficiency
Wireless sensor networks
Wireless networks
Energy utilization
Monitoring
Sensors

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Hardware and Architecture

Cite this

Bejerano, Y., Han, S. J., Lee, K. T., & Kumar, A. (2008). Single-path routing for life time maximization in multi-hop wireless networks. In 33rd IEEE Conference on Local Computer Networks, LCN 2008 (pp. 160-167). [4664165] (Proceedings - Conference on Local Computer Networks, LCN). https://doi.org/10.1109/LCN.2008.4664165
Bejerano, Yigal ; Han, Seung Jae ; Lee, Keon Taek ; Kumar, Amit. / Single-path routing for life time maximization in multi-hop wireless networks. 33rd IEEE Conference on Local Computer Networks, LCN 2008. 2008. pp. 160-167 (Proceedings - Conference on Local Computer Networks, LCN).
@inproceedings{a050248a1dc64d70b885ff1bea356c1d,
title = "Single-path routing for life time maximization in multi-hop wireless networks",
abstract = "Energy-aware routing is important in multi-hop wireless networks that are operated by battery power, 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 do not perform well, 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 algorithm which uses one energy-efficient path for each communicating peer throughout the network lifetime, eliminating the overhead of multi-path routing. It is proved that our algorithm 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 the dynamic multi-path approach, particularly under heavy network loads.",
author = "Yigal Bejerano and Han, {Seung Jae} and Lee, {Keon Taek} and Amit Kumar",
year = "2008",
month = "12",
day = "31",
doi = "10.1109/LCN.2008.4664165",
language = "English",
isbn = "9781424424139",
series = "Proceedings - Conference on Local Computer Networks, LCN",
pages = "160--167",
booktitle = "33rd IEEE Conference on Local Computer Networks, LCN 2008",

}

Bejerano, Y, Han, SJ, Lee, KT & Kumar, A 2008, Single-path routing for life time maximization in multi-hop wireless networks. in 33rd IEEE Conference on Local Computer Networks, LCN 2008., 4664165, Proceedings - Conference on Local Computer Networks, LCN, pp. 160-167, 33rd IEEE Conference on Local Computer Networks, LCN 2008, Montreal, AB, Canada, 08/10/14. https://doi.org/10.1109/LCN.2008.4664165

Single-path routing for life time maximization in multi-hop wireless networks. / Bejerano, Yigal; Han, Seung Jae; Lee, Keon Taek; Kumar, Amit.

33rd IEEE Conference on Local Computer Networks, LCN 2008. 2008. p. 160-167 4664165 (Proceedings - Conference on Local Computer Networks, LCN).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

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

AU - Bejerano, Yigal

AU - Han, Seung Jae

AU - Lee, Keon Taek

AU - Kumar, Amit

PY - 2008/12/31

Y1 - 2008/12/31

N2 - Energy-aware routing is important in multi-hop wireless networks that are operated by battery power, 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 do not perform well, 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 algorithm which uses one energy-efficient path for each communicating peer throughout the network lifetime, eliminating the overhead of multi-path routing. It is proved that our algorithm 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 the dynamic multi-path approach, particularly under heavy network loads.

AB - Energy-aware routing is important in multi-hop wireless networks that are operated by battery power, 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 do not perform well, 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 algorithm which uses one energy-efficient path for each communicating peer throughout the network lifetime, eliminating the overhead of multi-path routing. It is proved that our algorithm 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 the dynamic multi-path approach, particularly under heavy network loads.

UR - http://www.scopus.com/inward/record.url?scp=58049098140&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58049098140&partnerID=8YFLogxK

U2 - 10.1109/LCN.2008.4664165

DO - 10.1109/LCN.2008.4664165

M3 - Conference contribution

AN - SCOPUS:58049098140

SN - 9781424424139

T3 - Proceedings - Conference on Local Computer Networks, LCN

SP - 160

EP - 167

BT - 33rd IEEE Conference on Local Computer Networks, LCN 2008

ER -

Bejerano Y, Han SJ, Lee KT, Kumar A. Single-path routing for life time maximization in multi-hop wireless networks. In 33rd IEEE Conference on Local Computer Networks, LCN 2008. 2008. p. 160-167. 4664165. (Proceedings - Conference on Local Computer Networks, LCN). https://doi.org/10.1109/LCN.2008.4664165