Opportunistic overlay multicast in wireless networks

Tan Le, Yong Liu

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

Abstract

Opportunistic Routing (OR) has recently been proposed to improve the efficiency of unicast in multi-hop wireless networks. OR exploits the broadcast nature of wireless transmission medium and opportunistically selects a relay path to deliver a packet to its receiver. To adopt OR in wireless multicast, the main challenge is to efficiently share opportunistic relay paths between multiple receivers. In this paper, we propose an opportunistic overlay multicast design for wireless networks, named Minimum Steiner Tree with Opportunistic Routing (MSTOR). In MSTOR, the source and receivers are connected by an overlay Steiner tree. The source multicasts packets along the overlay links of the Steiner tree to reach all receivers. The transmission of packets on each overlay link is controlled by unicast OR. We first propose an overlay construction algorithm based on the optimal "OR distance" between nodes. We then design the MSTOR protocol and implement it in OPNET by customizing the IEEE 802.15.4 modules. Through OPNET simulations, we study the performance improvement of MSTOR over several existing unicast and multicast routing schemes. Our results demonstrate that MSTOR can achieve a much higher multicast efficiency than the original unicast OR and the traditional minimum multicast-tree based schemes. MSTOR can be easily deployed for multicast in multi-hop wireless networks.

Original languageEnglish (US)
Title of host publication2010 IEEE Global Telecommunications Conference, GLOBECOM 2010
DOIs
StatePublished - 2010
Event53rd IEEE Global Communications Conference, GLOBECOM 2010 - Miami, FL, United States
Duration: Dec 6 2010Dec 10 2010

Other

Other53rd IEEE Global Communications Conference, GLOBECOM 2010
CountryUnited States
CityMiami, FL
Period12/6/1012/10/10

Fingerprint

Wireless networks
Routing protocols

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Le, T., & Liu, Y. (2010). Opportunistic overlay multicast in wireless networks. In 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010 [5683489] https://doi.org/10.1109/GLOCOM.2010.5683489

Opportunistic overlay multicast in wireless networks. / Le, Tan; Liu, Yong.

2010 IEEE Global Telecommunications Conference, GLOBECOM 2010. 2010. 5683489.

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

Le, T & Liu, Y 2010, Opportunistic overlay multicast in wireless networks. in 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010., 5683489, 53rd IEEE Global Communications Conference, GLOBECOM 2010, Miami, FL, United States, 12/6/10. https://doi.org/10.1109/GLOCOM.2010.5683489
Le T, Liu Y. Opportunistic overlay multicast in wireless networks. In 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010. 2010. 5683489 https://doi.org/10.1109/GLOCOM.2010.5683489
Le, Tan ; Liu, Yong. / Opportunistic overlay multicast in wireless networks. 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010. 2010.
@inproceedings{f948d81d0a3746e8932d2de7850c2fcf,
title = "Opportunistic overlay multicast in wireless networks",
abstract = "Opportunistic Routing (OR) has recently been proposed to improve the efficiency of unicast in multi-hop wireless networks. OR exploits the broadcast nature of wireless transmission medium and opportunistically selects a relay path to deliver a packet to its receiver. To adopt OR in wireless multicast, the main challenge is to efficiently share opportunistic relay paths between multiple receivers. In this paper, we propose an opportunistic overlay multicast design for wireless networks, named Minimum Steiner Tree with Opportunistic Routing (MSTOR). In MSTOR, the source and receivers are connected by an overlay Steiner tree. The source multicasts packets along the overlay links of the Steiner tree to reach all receivers. The transmission of packets on each overlay link is controlled by unicast OR. We first propose an overlay construction algorithm based on the optimal {"}OR distance{"} between nodes. We then design the MSTOR protocol and implement it in OPNET by customizing the IEEE 802.15.4 modules. Through OPNET simulations, we study the performance improvement of MSTOR over several existing unicast and multicast routing schemes. Our results demonstrate that MSTOR can achieve a much higher multicast efficiency than the original unicast OR and the traditional minimum multicast-tree based schemes. MSTOR can be easily deployed for multicast in multi-hop wireless networks.",
author = "Tan Le and Yong Liu",
year = "2010",
doi = "10.1109/GLOCOM.2010.5683489",
language = "English (US)",
isbn = "9781424456383",
booktitle = "2010 IEEE Global Telecommunications Conference, GLOBECOM 2010",

}

TY - GEN

T1 - Opportunistic overlay multicast in wireless networks

AU - Le, Tan

AU - Liu, Yong

PY - 2010

Y1 - 2010

N2 - Opportunistic Routing (OR) has recently been proposed to improve the efficiency of unicast in multi-hop wireless networks. OR exploits the broadcast nature of wireless transmission medium and opportunistically selects a relay path to deliver a packet to its receiver. To adopt OR in wireless multicast, the main challenge is to efficiently share opportunistic relay paths between multiple receivers. In this paper, we propose an opportunistic overlay multicast design for wireless networks, named Minimum Steiner Tree with Opportunistic Routing (MSTOR). In MSTOR, the source and receivers are connected by an overlay Steiner tree. The source multicasts packets along the overlay links of the Steiner tree to reach all receivers. The transmission of packets on each overlay link is controlled by unicast OR. We first propose an overlay construction algorithm based on the optimal "OR distance" between nodes. We then design the MSTOR protocol and implement it in OPNET by customizing the IEEE 802.15.4 modules. Through OPNET simulations, we study the performance improvement of MSTOR over several existing unicast and multicast routing schemes. Our results demonstrate that MSTOR can achieve a much higher multicast efficiency than the original unicast OR and the traditional minimum multicast-tree based schemes. MSTOR can be easily deployed for multicast in multi-hop wireless networks.

AB - Opportunistic Routing (OR) has recently been proposed to improve the efficiency of unicast in multi-hop wireless networks. OR exploits the broadcast nature of wireless transmission medium and opportunistically selects a relay path to deliver a packet to its receiver. To adopt OR in wireless multicast, the main challenge is to efficiently share opportunistic relay paths between multiple receivers. In this paper, we propose an opportunistic overlay multicast design for wireless networks, named Minimum Steiner Tree with Opportunistic Routing (MSTOR). In MSTOR, the source and receivers are connected by an overlay Steiner tree. The source multicasts packets along the overlay links of the Steiner tree to reach all receivers. The transmission of packets on each overlay link is controlled by unicast OR. We first propose an overlay construction algorithm based on the optimal "OR distance" between nodes. We then design the MSTOR protocol and implement it in OPNET by customizing the IEEE 802.15.4 modules. Through OPNET simulations, we study the performance improvement of MSTOR over several existing unicast and multicast routing schemes. Our results demonstrate that MSTOR can achieve a much higher multicast efficiency than the original unicast OR and the traditional minimum multicast-tree based schemes. MSTOR can be easily deployed for multicast in multi-hop wireless networks.

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

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

U2 - 10.1109/GLOCOM.2010.5683489

DO - 10.1109/GLOCOM.2010.5683489

M3 - Conference contribution

SN - 9781424456383

BT - 2010 IEEE Global Telecommunications Conference, GLOBECOM 2010

ER -