Distributed network coding-based opportunistic routing for multicast

Abdallah Khreishah, Issa Khalil, Jie Wu

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

36 Citations (Scopus)

Abstract

In this paper, we tackle the network coding-based opportunistic routing problem for multicast. We present the factors that affect the performance of the multicast protocols. Then, we formulate the problem as an optimization problem. Using the duality approach, we show that a distributed solution can be used to achieve the optimal solution. The distributed solution consists of two phases. In the first phase, the most reliable broadcasting tree is formed based on the ETX metric. In the second phase, a credit assignment algorithm is run at each node to determine the number of coded packets that the node has to send. The distributed algorithm adapts to the changes in the channel conditions and does not require explicit knowledge of the properties of the network. To reduce the number of feedback messages, and to resolve the problem of delayed feedback, we also perform network coding on the feedback messages. We evaluate our algorithm using simulations which show that in some realistic cases the throughput achieved by our algorithm can be double or triple that of the state-of-the-art.

Original languageEnglish
Title of host publicationProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)
Pages115-124
Number of pages10
DOIs
Publication statusPublished - 11 Jul 2012
Externally publishedYes
Event13th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'12 - Hilton Head, SC, United States
Duration: 11 Jun 201214 Jun 2012

Other

Other13th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'12
CountryUnited States
CityHilton Head, SC
Period11/6/1214/6/12

Fingerprint

Network coding
Feedback
Broadcasting
Parallel algorithms
Throughput
Network protocols

Keywords

  • coded-feedback
  • distributed algorithms
  • multicast
  • Network coding
  • opportunistic routing

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Networks and Communications
  • Software

Cite this

Khreishah, A., Khalil, I., & Wu, J. (2012). Distributed network coding-based opportunistic routing for multicast. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc) (pp. 115-124) https://doi.org/10.1145/2248371.2248390

Distributed network coding-based opportunistic routing for multicast. / Khreishah, Abdallah; Khalil, Issa; Wu, Jie.

Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2012. p. 115-124.

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

Khreishah, A, Khalil, I & Wu, J 2012, Distributed network coding-based opportunistic routing for multicast. in Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). pp. 115-124, 13th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc'12, Hilton Head, SC, United States, 11/6/12. https://doi.org/10.1145/2248371.2248390
Khreishah A, Khalil I, Wu J. Distributed network coding-based opportunistic routing for multicast. In Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2012. p. 115-124 https://doi.org/10.1145/2248371.2248390
Khreishah, Abdallah ; Khalil, Issa ; Wu, Jie. / Distributed network coding-based opportunistic routing for multicast. Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc). 2012. pp. 115-124
@inproceedings{309b12314574469888bc432fa09f7298,
title = "Distributed network coding-based opportunistic routing for multicast",
abstract = "In this paper, we tackle the network coding-based opportunistic routing problem for multicast. We present the factors that affect the performance of the multicast protocols. Then, we formulate the problem as an optimization problem. Using the duality approach, we show that a distributed solution can be used to achieve the optimal solution. The distributed solution consists of two phases. In the first phase, the most reliable broadcasting tree is formed based on the ETX metric. In the second phase, a credit assignment algorithm is run at each node to determine the number of coded packets that the node has to send. The distributed algorithm adapts to the changes in the channel conditions and does not require explicit knowledge of the properties of the network. To reduce the number of feedback messages, and to resolve the problem of delayed feedback, we also perform network coding on the feedback messages. We evaluate our algorithm using simulations which show that in some realistic cases the throughput achieved by our algorithm can be double or triple that of the state-of-the-art.",
keywords = "coded-feedback, distributed algorithms, multicast, Network coding, opportunistic routing",
author = "Abdallah Khreishah and Issa Khalil and Jie Wu",
year = "2012",
month = "7",
day = "11",
doi = "10.1145/2248371.2248390",
language = "English",
isbn = "9781450312813",
pages = "115--124",
booktitle = "Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)",

}

TY - GEN

T1 - Distributed network coding-based opportunistic routing for multicast

AU - Khreishah, Abdallah

AU - Khalil, Issa

AU - Wu, Jie

PY - 2012/7/11

Y1 - 2012/7/11

N2 - In this paper, we tackle the network coding-based opportunistic routing problem for multicast. We present the factors that affect the performance of the multicast protocols. Then, we formulate the problem as an optimization problem. Using the duality approach, we show that a distributed solution can be used to achieve the optimal solution. The distributed solution consists of two phases. In the first phase, the most reliable broadcasting tree is formed based on the ETX metric. In the second phase, a credit assignment algorithm is run at each node to determine the number of coded packets that the node has to send. The distributed algorithm adapts to the changes in the channel conditions and does not require explicit knowledge of the properties of the network. To reduce the number of feedback messages, and to resolve the problem of delayed feedback, we also perform network coding on the feedback messages. We evaluate our algorithm using simulations which show that in some realistic cases the throughput achieved by our algorithm can be double or triple that of the state-of-the-art.

AB - In this paper, we tackle the network coding-based opportunistic routing problem for multicast. We present the factors that affect the performance of the multicast protocols. Then, we formulate the problem as an optimization problem. Using the duality approach, we show that a distributed solution can be used to achieve the optimal solution. The distributed solution consists of two phases. In the first phase, the most reliable broadcasting tree is formed based on the ETX metric. In the second phase, a credit assignment algorithm is run at each node to determine the number of coded packets that the node has to send. The distributed algorithm adapts to the changes in the channel conditions and does not require explicit knowledge of the properties of the network. To reduce the number of feedback messages, and to resolve the problem of delayed feedback, we also perform network coding on the feedback messages. We evaluate our algorithm using simulations which show that in some realistic cases the throughput achieved by our algorithm can be double or triple that of the state-of-the-art.

KW - coded-feedback

KW - distributed algorithms

KW - multicast

KW - Network coding

KW - opportunistic routing

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

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

U2 - 10.1145/2248371.2248390

DO - 10.1145/2248371.2248390

M3 - Conference contribution

SN - 9781450312813

SP - 115

EP - 124

BT - Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

ER -