Exploring the gain of Opportunistic Routing in wireless Multicast

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. In this paper, we explore the gain of adopting OR in wireless multicast. The main challenge is to efficiently share opportunistic relay paths between multiple receivers. We proposed a scheme in [1] named Minimum Steiner Tree with Opportunistic Routing (MSTOR). In MSTOR, the source and receivers are connected by a Steiner tree. Packets are transmitted using Unicast OR on each link of the tree. MSTOR does not exploit opportunistic receptions cross different links in the tree. In this paper, we propose a Multicast OR (MOR) algorithm follow another approach. Starting from the source, MOR opportunistically employs a set of forwarders to push a packet closer to all receivers round-by-round. Each forwarder is responsible for sending the packet to a subset of receivers, and transmits the packet once each round. Based on packet receptions at the end of each round, a new forwarder set is constructed to maximize the Expect Transmission Advancement (ETA) towards all receivers. We study the performance improvement of MSTOR and MOR using numerical simulations. Our results demonstrate that both MOR and MSTOR can achieve a much higher multicast efficiency than the original Unicast OR and the traditional minimum multicast-tree based schemes. MOR constantly achieves significant transmission cost savings in all studied cases.

Original languageEnglish (US)
Title of host publication2014 International Conference on Advanced Technologies for Communications, ATC 2014
PublisherIEEE Computer Society
Pages506-511
Number of pages6
Volume2015-February
ISBN (Print)9781479969555
DOIs
StatePublished - Feb 17 2015
Event2014 7th International Conference on Advanced Technologies for Communications, ATC 2014 - Hanoi, Viet Nam
Duration: Oct 15 2014Oct 17 2014

Other

Other2014 7th International Conference on Advanced Technologies for Communications, ATC 2014
CountryViet Nam
CityHanoi
Period10/15/1410/17/14

Fingerprint

Routing algorithms
Wireless networks
Computer simulation
Costs

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Cite this

Le, T., & Liu, Y. (2015). Exploring the gain of Opportunistic Routing in wireless Multicast. In 2014 International Conference on Advanced Technologies for Communications, ATC 2014 (Vol. 2015-February, pp. 506-511). [7043441] IEEE Computer Society. https://doi.org/10.1109/ATC.2014.7043441

Exploring the gain of Opportunistic Routing in wireless Multicast. / Le, Tan; Liu, Yong.

2014 International Conference on Advanced Technologies for Communications, ATC 2014. Vol. 2015-February IEEE Computer Society, 2015. p. 506-511 7043441.

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

Le, T & Liu, Y 2015, Exploring the gain of Opportunistic Routing in wireless Multicast. in 2014 International Conference on Advanced Technologies for Communications, ATC 2014. vol. 2015-February, 7043441, IEEE Computer Society, pp. 506-511, 2014 7th International Conference on Advanced Technologies for Communications, ATC 2014, Hanoi, Viet Nam, 10/15/14. https://doi.org/10.1109/ATC.2014.7043441
Le T, Liu Y. Exploring the gain of Opportunistic Routing in wireless Multicast. In 2014 International Conference on Advanced Technologies for Communications, ATC 2014. Vol. 2015-February. IEEE Computer Society. 2015. p. 506-511. 7043441 https://doi.org/10.1109/ATC.2014.7043441
Le, Tan ; Liu, Yong. / Exploring the gain of Opportunistic Routing in wireless Multicast. 2014 International Conference on Advanced Technologies for Communications, ATC 2014. Vol. 2015-February IEEE Computer Society, 2015. pp. 506-511
@inproceedings{7f0e0e1f5bdf471f9ed1b0bca1137f4c,
title = "Exploring the gain of Opportunistic Routing in wireless Multicast",
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. In this paper, we explore the gain of adopting OR in wireless multicast. The main challenge is to efficiently share opportunistic relay paths between multiple receivers. We proposed a scheme in [1] named Minimum Steiner Tree with Opportunistic Routing (MSTOR). In MSTOR, the source and receivers are connected by a Steiner tree. Packets are transmitted using Unicast OR on each link of the tree. MSTOR does not exploit opportunistic receptions cross different links in the tree. In this paper, we propose a Multicast OR (MOR) algorithm follow another approach. Starting from the source, MOR opportunistically employs a set of forwarders to push a packet closer to all receivers round-by-round. Each forwarder is responsible for sending the packet to a subset of receivers, and transmits the packet once each round. Based on packet receptions at the end of each round, a new forwarder set is constructed to maximize the Expect Transmission Advancement (ETA) towards all receivers. We study the performance improvement of MSTOR and MOR using numerical simulations. Our results demonstrate that both MOR and MSTOR can achieve a much higher multicast efficiency than the original Unicast OR and the traditional minimum multicast-tree based schemes. MOR constantly achieves significant transmission cost savings in all studied cases.",
author = "Tan Le and Yong Liu",
year = "2015",
month = "2",
day = "17",
doi = "10.1109/ATC.2014.7043441",
language = "English (US)",
isbn = "9781479969555",
volume = "2015-February",
pages = "506--511",
booktitle = "2014 International Conference on Advanced Technologies for Communications, ATC 2014",
publisher = "IEEE Computer Society",

}

TY - GEN

T1 - Exploring the gain of Opportunistic Routing in wireless Multicast

AU - Le, Tan

AU - Liu, Yong

PY - 2015/2/17

Y1 - 2015/2/17

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. In this paper, we explore the gain of adopting OR in wireless multicast. The main challenge is to efficiently share opportunistic relay paths between multiple receivers. We proposed a scheme in [1] named Minimum Steiner Tree with Opportunistic Routing (MSTOR). In MSTOR, the source and receivers are connected by a Steiner tree. Packets are transmitted using Unicast OR on each link of the tree. MSTOR does not exploit opportunistic receptions cross different links in the tree. In this paper, we propose a Multicast OR (MOR) algorithm follow another approach. Starting from the source, MOR opportunistically employs a set of forwarders to push a packet closer to all receivers round-by-round. Each forwarder is responsible for sending the packet to a subset of receivers, and transmits the packet once each round. Based on packet receptions at the end of each round, a new forwarder set is constructed to maximize the Expect Transmission Advancement (ETA) towards all receivers. We study the performance improvement of MSTOR and MOR using numerical simulations. Our results demonstrate that both MOR and MSTOR can achieve a much higher multicast efficiency than the original Unicast OR and the traditional minimum multicast-tree based schemes. MOR constantly achieves significant transmission cost savings in all studied cases.

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. In this paper, we explore the gain of adopting OR in wireless multicast. The main challenge is to efficiently share opportunistic relay paths between multiple receivers. We proposed a scheme in [1] named Minimum Steiner Tree with Opportunistic Routing (MSTOR). In MSTOR, the source and receivers are connected by a Steiner tree. Packets are transmitted using Unicast OR on each link of the tree. MSTOR does not exploit opportunistic receptions cross different links in the tree. In this paper, we propose a Multicast OR (MOR) algorithm follow another approach. Starting from the source, MOR opportunistically employs a set of forwarders to push a packet closer to all receivers round-by-round. Each forwarder is responsible for sending the packet to a subset of receivers, and transmits the packet once each round. Based on packet receptions at the end of each round, a new forwarder set is constructed to maximize the Expect Transmission Advancement (ETA) towards all receivers. We study the performance improvement of MSTOR and MOR using numerical simulations. Our results demonstrate that both MOR and MSTOR can achieve a much higher multicast efficiency than the original Unicast OR and the traditional minimum multicast-tree based schemes. MOR constantly achieves significant transmission cost savings in all studied cases.

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

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

U2 - 10.1109/ATC.2014.7043441

DO - 10.1109/ATC.2014.7043441

M3 - Conference contribution

SN - 9781479969555

VL - 2015-February

SP - 506

EP - 511

BT - 2014 International Conference on Advanced Technologies for Communications, ATC 2014

PB - IEEE Computer Society

ER -