Abstract

In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as the variations in the available power of the nodes, centralized or stateful routing schemes are not applicable. Thus, in this paper, we first introduce a Geographic Multicast routing Protocol (GMP) for wireless sensor networks.1This work is supported by NSF Grant # 0308268, "ARIA - Quality-Adaptive Media-Flow Architectures for Sensor Data Management".1 The protocol is fully distributed and stateless. Given a set of the destinations, the transmitting node first constructs a virtual Euclidean Steiner tree rooted at itself and including the destinations, using a novel and highly efficient reduction ratio heuristic (called rrSTR). The simulation results on NS2 show that GMP requires 25% less hops and energy than the existing Position Based Multicasting, PBM, Location-Guided Steiner trees, LGS, approaches. The GMP algorithm as well as LGS and PBM all assume that each recipient receives the same copy of the multicast message. In reality, however, especially when the transmission includes streamed media, different recipients have different demands (in terms of the frequency of packets or the quality of media). Thus, in this paper, we investigate the suitability of the geographic multicasting schemes for situations where scalable transmission paths can save power. In particular, we propose intuitive mechanisms to extend the three schemes to cases where the data transmission can scale based on the demand. This leads to three new weighted multicast routing algorithms: wGMP, wLGS, and wPBM. The results show that the wGMP algorithm provides the best opportunities for scalability due to its flexible self-correcting decision making process, while other schemes, such as wLGS and wPBM are not directly suitable for scalable multicasting, due to their naively greedy structures.

Original languageEnglish (US)
Pages (from-to)2931-2953
Number of pages23
JournalComputer Communications
Volume30
Issue number14-15
DOIs
StatePublished - Oct 15 2007

Fingerprint

Multicasting
Routing protocols
Wireless sensor networks
Sensors
Routing algorithms
Sensor nodes
Data communication systems
Information management
Scalability
Decision making
Network protocols

Keywords

  • Geographic multicast
  • Group communication
  • Localized routing
  • Scalable streaming media
  • Wireless sensor networks

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Demand-scalable geographic multicasting in wireless sensor networks. / Wu, Shibo; Candan, Kasim.

In: Computer Communications, Vol. 30, No. 14-15, 15.10.2007, p. 2931-2953.

Research output: Contribution to journalArticle

@article{68c73e8d0a1849b5881c8440f46a9670,
title = "Demand-scalable geographic multicasting in wireless sensor networks",
abstract = "In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as the variations in the available power of the nodes, centralized or stateful routing schemes are not applicable. Thus, in this paper, we first introduce a Geographic Multicast routing Protocol (GMP) for wireless sensor networks.1This work is supported by NSF Grant # 0308268, {"}ARIA - Quality-Adaptive Media-Flow Architectures for Sensor Data Management{"}.1 The protocol is fully distributed and stateless. Given a set of the destinations, the transmitting node first constructs a virtual Euclidean Steiner tree rooted at itself and including the destinations, using a novel and highly efficient reduction ratio heuristic (called rrSTR). The simulation results on NS2 show that GMP requires 25{\%} less hops and energy than the existing Position Based Multicasting, PBM, Location-Guided Steiner trees, LGS, approaches. The GMP algorithm as well as LGS and PBM all assume that each recipient receives the same copy of the multicast message. In reality, however, especially when the transmission includes streamed media, different recipients have different demands (in terms of the frequency of packets or the quality of media). Thus, in this paper, we investigate the suitability of the geographic multicasting schemes for situations where scalable transmission paths can save power. In particular, we propose intuitive mechanisms to extend the three schemes to cases where the data transmission can scale based on the demand. This leads to three new weighted multicast routing algorithms: wGMP, wLGS, and wPBM. The results show that the wGMP algorithm provides the best opportunities for scalability due to its flexible self-correcting decision making process, while other schemes, such as wLGS and wPBM are not directly suitable for scalable multicasting, due to their naively greedy structures.",
keywords = "Geographic multicast, Group communication, Localized routing, Scalable streaming media, Wireless sensor networks",
author = "Shibo Wu and Kasim Candan",
year = "2007",
month = "10",
day = "15",
doi = "10.1016/j.comcom.2007.05.029",
language = "English (US)",
volume = "30",
pages = "2931--2953",
journal = "Computer Communications",
issn = "0140-3664",
publisher = "Elsevier",
number = "14-15",

}

TY - JOUR

T1 - Demand-scalable geographic multicasting in wireless sensor networks

AU - Wu, Shibo

AU - Candan, Kasim

PY - 2007/10/15

Y1 - 2007/10/15

N2 - In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as the variations in the available power of the nodes, centralized or stateful routing schemes are not applicable. Thus, in this paper, we first introduce a Geographic Multicast routing Protocol (GMP) for wireless sensor networks.1This work is supported by NSF Grant # 0308268, "ARIA - Quality-Adaptive Media-Flow Architectures for Sensor Data Management".1 The protocol is fully distributed and stateless. Given a set of the destinations, the transmitting node first constructs a virtual Euclidean Steiner tree rooted at itself and including the destinations, using a novel and highly efficient reduction ratio heuristic (called rrSTR). The simulation results on NS2 show that GMP requires 25% less hops and energy than the existing Position Based Multicasting, PBM, Location-Guided Steiner trees, LGS, approaches. The GMP algorithm as well as LGS and PBM all assume that each recipient receives the same copy of the multicast message. In reality, however, especially when the transmission includes streamed media, different recipients have different demands (in terms of the frequency of packets or the quality of media). Thus, in this paper, we investigate the suitability of the geographic multicasting schemes for situations where scalable transmission paths can save power. In particular, we propose intuitive mechanisms to extend the three schemes to cases where the data transmission can scale based on the demand. This leads to three new weighted multicast routing algorithms: wGMP, wLGS, and wPBM. The results show that the wGMP algorithm provides the best opportunities for scalability due to its flexible self-correcting decision making process, while other schemes, such as wLGS and wPBM are not directly suitable for scalable multicasting, due to their naively greedy structures.

AB - In this paper, we focus on the challenge of demand-scalable multicast routing in wireless sensor networks. Due to the ad-hoc nature of the placement of the sensor nodes as well as the variations in the available power of the nodes, centralized or stateful routing schemes are not applicable. Thus, in this paper, we first introduce a Geographic Multicast routing Protocol (GMP) for wireless sensor networks.1This work is supported by NSF Grant # 0308268, "ARIA - Quality-Adaptive Media-Flow Architectures for Sensor Data Management".1 The protocol is fully distributed and stateless. Given a set of the destinations, the transmitting node first constructs a virtual Euclidean Steiner tree rooted at itself and including the destinations, using a novel and highly efficient reduction ratio heuristic (called rrSTR). The simulation results on NS2 show that GMP requires 25% less hops and energy than the existing Position Based Multicasting, PBM, Location-Guided Steiner trees, LGS, approaches. The GMP algorithm as well as LGS and PBM all assume that each recipient receives the same copy of the multicast message. In reality, however, especially when the transmission includes streamed media, different recipients have different demands (in terms of the frequency of packets or the quality of media). Thus, in this paper, we investigate the suitability of the geographic multicasting schemes for situations where scalable transmission paths can save power. In particular, we propose intuitive mechanisms to extend the three schemes to cases where the data transmission can scale based on the demand. This leads to three new weighted multicast routing algorithms: wGMP, wLGS, and wPBM. The results show that the wGMP algorithm provides the best opportunities for scalability due to its flexible self-correcting decision making process, while other schemes, such as wLGS and wPBM are not directly suitable for scalable multicasting, due to their naively greedy structures.

KW - Geographic multicast

KW - Group communication

KW - Localized routing

KW - Scalable streaming media

KW - Wireless sensor networks

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

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

U2 - 10.1016/j.comcom.2007.05.029

DO - 10.1016/j.comcom.2007.05.029

M3 - Article

AN - SCOPUS:34548835212

VL - 30

SP - 2931

EP - 2953

JO - Computer Communications

JF - Computer Communications

SN - 0140-3664

IS - 14-15

ER -