Abstract

Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a significant effect on the power consumption of both the transmitting node and listeners. This paper first presents a Geographical Power Efficient Routing (GPER) protocol for sensor networks. Each sensor node makes local decisions as to how far to transmit: therefore, the protocol is power efficient, localized, highly distributed, and scalable. In GPER, given a final destination, each node first establishes a subdestination within its maximum radio range. The node, however, may decide to relay the packet to this subdestination through an intermediary node or alter the subdestination if this will preserve power. Traditional deterministic geographic routing algorithms aim at achieving close to the shortest weighted paths. However, they normally stick to the same paths for the same source/destination pairs. This may conversely drain the nodes on these paths and result in short network life when the communication in the network is unevenly distributed. Thus, we further investigate a set of probabilistic multipath routing algorithms, which generate braided multipaths based only on local information. The algorithms have less communication and storage overhead than conventional on-demand multipath routing algorithms, while providing greater resilience to node failures. Simulations on NS2 show that GPER almost halves the power consumption in the network relative to alternative geographic routing algorithms. Furthermore, in situations where the communication tasks are non-uniformly distributed, probabilistic multipath routing contributes up to an additional 30% to network lifetime.

Original languageEnglish (US)
Pages (from-to)974-997
Number of pages24
JournalAd Hoc Networks
Volume5
Issue number7
DOIs
StatePublished - Sep 2007

Fingerprint

Routing algorithms
Sensor networks
Communication
Electric power utilization
Routing protocols
Sensor nodes
Network protocols

Keywords

  • Geographic routing
  • Localized routing
  • Power-aware routing
  • Wireless sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications

Cite this

Power-aware single- and multipath geographic routing in sensor networks. / Wu, Shibo; Candan, Kasim.

In: Ad Hoc Networks, Vol. 5, No. 7, 09.2007, p. 974-997.

Research output: Contribution to journalArticle

@article{8ef5228a235b473ca236bc116f56ed84,
title = "Power-aware single- and multipath geographic routing in sensor networks",
abstract = "Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a significant effect on the power consumption of both the transmitting node and listeners. This paper first presents a Geographical Power Efficient Routing (GPER) protocol for sensor networks. Each sensor node makes local decisions as to how far to transmit: therefore, the protocol is power efficient, localized, highly distributed, and scalable. In GPER, given a final destination, each node first establishes a subdestination within its maximum radio range. The node, however, may decide to relay the packet to this subdestination through an intermediary node or alter the subdestination if this will preserve power. Traditional deterministic geographic routing algorithms aim at achieving close to the shortest weighted paths. However, they normally stick to the same paths for the same source/destination pairs. This may conversely drain the nodes on these paths and result in short network life when the communication in the network is unevenly distributed. Thus, we further investigate a set of probabilistic multipath routing algorithms, which generate braided multipaths based only on local information. The algorithms have less communication and storage overhead than conventional on-demand multipath routing algorithms, while providing greater resilience to node failures. Simulations on NS2 show that GPER almost halves the power consumption in the network relative to alternative geographic routing algorithms. Furthermore, in situations where the communication tasks are non-uniformly distributed, probabilistic multipath routing contributes up to an additional 30{\%} to network lifetime.",
keywords = "Geographic routing, Localized routing, Power-aware routing, Wireless sensor networks",
author = "Shibo Wu and Kasim Candan",
year = "2007",
month = "9",
doi = "10.1016/j.adhoc.2006.04.007",
language = "English (US)",
volume = "5",
pages = "974--997",
journal = "Ad Hoc Networks",
issn = "1570-8705",
publisher = "Elsevier",
number = "7",

}

TY - JOUR

T1 - Power-aware single- and multipath geographic routing in sensor networks

AU - Wu, Shibo

AU - Candan, Kasim

PY - 2007/9

Y1 - 2007/9

N2 - Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a significant effect on the power consumption of both the transmitting node and listeners. This paper first presents a Geographical Power Efficient Routing (GPER) protocol for sensor networks. Each sensor node makes local decisions as to how far to transmit: therefore, the protocol is power efficient, localized, highly distributed, and scalable. In GPER, given a final destination, each node first establishes a subdestination within its maximum radio range. The node, however, may decide to relay the packet to this subdestination through an intermediary node or alter the subdestination if this will preserve power. Traditional deterministic geographic routing algorithms aim at achieving close to the shortest weighted paths. However, they normally stick to the same paths for the same source/destination pairs. This may conversely drain the nodes on these paths and result in short network life when the communication in the network is unevenly distributed. Thus, we further investigate a set of probabilistic multipath routing algorithms, which generate braided multipaths based only on local information. The algorithms have less communication and storage overhead than conventional on-demand multipath routing algorithms, while providing greater resilience to node failures. Simulations on NS2 show that GPER almost halves the power consumption in the network relative to alternative geographic routing algorithms. Furthermore, in situations where the communication tasks are non-uniformly distributed, probabilistic multipath routing contributes up to an additional 30% to network lifetime.

AB - Nodes in a sensor network, operating on power limited batteries, must save power to minimize the need for battery replacement. We note that the range of transmission has a significant effect on the power consumption of both the transmitting node and listeners. This paper first presents a Geographical Power Efficient Routing (GPER) protocol for sensor networks. Each sensor node makes local decisions as to how far to transmit: therefore, the protocol is power efficient, localized, highly distributed, and scalable. In GPER, given a final destination, each node first establishes a subdestination within its maximum radio range. The node, however, may decide to relay the packet to this subdestination through an intermediary node or alter the subdestination if this will preserve power. Traditional deterministic geographic routing algorithms aim at achieving close to the shortest weighted paths. However, they normally stick to the same paths for the same source/destination pairs. This may conversely drain the nodes on these paths and result in short network life when the communication in the network is unevenly distributed. Thus, we further investigate a set of probabilistic multipath routing algorithms, which generate braided multipaths based only on local information. The algorithms have less communication and storage overhead than conventional on-demand multipath routing algorithms, while providing greater resilience to node failures. Simulations on NS2 show that GPER almost halves the power consumption in the network relative to alternative geographic routing algorithms. Furthermore, in situations where the communication tasks are non-uniformly distributed, probabilistic multipath routing contributes up to an additional 30% to network lifetime.

KW - Geographic routing

KW - Localized routing

KW - Power-aware routing

KW - Wireless sensor networks

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

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

U2 - 10.1016/j.adhoc.2006.04.007

DO - 10.1016/j.adhoc.2006.04.007

M3 - Article

AN - SCOPUS:34249332794

VL - 5

SP - 974

EP - 997

JO - Ad Hoc Networks

JF - Ad Hoc Networks

SN - 1570-8705

IS - 7

ER -