Polynomial time and provably efficient network coding scheme for lossy wireless networks

Abdallah Khreishah, Issa Khalil, Jie Wu

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

3 Citations (Scopus)

Abstract

The network coding problem across multiple unicasts is an open problem. Previously, the capacity region of 2-hop relay networks with multiple unicast sessions and limited feedback was characterized where the coding and decoding nodes are neighbors and packet erasure channels are used. A near-optimal coding scheme that exploits the broadcast nature and the diversity of the wireless links was proposed. However, the complexity of the scheme is hyper' exponential as it requires the knowledge of the packets that are received by any subset of the receivers. In this paper, we provide a polynomial time coding scheme and characterize its performance using linear equations. The coding scheme uses random network coding to carefully mix intra and intersession network coding and makes a linear, not exponential, number of decisions. We also provide a linear programming formulation that uses our 2-hop relay network results as a building block in large lossy multihop networks. Through simulations, we verify the superiority of our proposed schemes over state-of-the-art.

Original languageEnglish
Title of host publicationProceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011
Pages391-400
Number of pages10
DOIs
Publication statusPublished - 16 Dec 2011
Externally publishedYes
Event8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011 - Valencia, Spain
Duration: 17 Oct 201122 Oct 2011

Other

Other8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011
CountrySpain
CityValencia
Period17/10/1122/10/11

Fingerprint

Network coding
Wireless networks
Polynomials
Linear equations
Linear programming
Telecommunication links
Decoding
Feedback

Keywords

  • 2-hop relay networks
  • capacity
  • fairness
  • lossy wireless networks
  • Network coding

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Khreishah, A., Khalil, I., & Wu, J. (2011). Polynomial time and provably efficient network coding scheme for lossy wireless networks. In Proceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011 (pp. 391-400). [6076637] https://doi.org/10.1109/MASS.2011.46

Polynomial time and provably efficient network coding scheme for lossy wireless networks. / Khreishah, Abdallah; Khalil, Issa; Wu, Jie.

Proceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011. 2011. p. 391-400 6076637.

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

Khreishah, A, Khalil, I & Wu, J 2011, Polynomial time and provably efficient network coding scheme for lossy wireless networks. in Proceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011., 6076637, pp. 391-400, 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011, Valencia, Spain, 17/10/11. https://doi.org/10.1109/MASS.2011.46
Khreishah A, Khalil I, Wu J. Polynomial time and provably efficient network coding scheme for lossy wireless networks. In Proceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011. 2011. p. 391-400. 6076637 https://doi.org/10.1109/MASS.2011.46
Khreishah, Abdallah ; Khalil, Issa ; Wu, Jie. / Polynomial time and provably efficient network coding scheme for lossy wireless networks. Proceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011. 2011. pp. 391-400
@inproceedings{87f9a14921814107ad28f99fbc47d298,
title = "Polynomial time and provably efficient network coding scheme for lossy wireless networks",
abstract = "The network coding problem across multiple unicasts is an open problem. Previously, the capacity region of 2-hop relay networks with multiple unicast sessions and limited feedback was characterized where the coding and decoding nodes are neighbors and packet erasure channels are used. A near-optimal coding scheme that exploits the broadcast nature and the diversity of the wireless links was proposed. However, the complexity of the scheme is hyper' exponential as it requires the knowledge of the packets that are received by any subset of the receivers. In this paper, we provide a polynomial time coding scheme and characterize its performance using linear equations. The coding scheme uses random network coding to carefully mix intra and intersession network coding and makes a linear, not exponential, number of decisions. We also provide a linear programming formulation that uses our 2-hop relay network results as a building block in large lossy multihop networks. Through simulations, we verify the superiority of our proposed schemes over state-of-the-art.",
keywords = "2-hop relay networks, capacity, fairness, lossy wireless networks, Network coding",
author = "Abdallah Khreishah and Issa Khalil and Jie Wu",
year = "2011",
month = "12",
day = "16",
doi = "10.1109/MASS.2011.46",
language = "English",
isbn = "9780769544694",
pages = "391--400",
booktitle = "Proceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011",

}

TY - GEN

T1 - Polynomial time and provably efficient network coding scheme for lossy wireless networks

AU - Khreishah, Abdallah

AU - Khalil, Issa

AU - Wu, Jie

PY - 2011/12/16

Y1 - 2011/12/16

N2 - The network coding problem across multiple unicasts is an open problem. Previously, the capacity region of 2-hop relay networks with multiple unicast sessions and limited feedback was characterized where the coding and decoding nodes are neighbors and packet erasure channels are used. A near-optimal coding scheme that exploits the broadcast nature and the diversity of the wireless links was proposed. However, the complexity of the scheme is hyper' exponential as it requires the knowledge of the packets that are received by any subset of the receivers. In this paper, we provide a polynomial time coding scheme and characterize its performance using linear equations. The coding scheme uses random network coding to carefully mix intra and intersession network coding and makes a linear, not exponential, number of decisions. We also provide a linear programming formulation that uses our 2-hop relay network results as a building block in large lossy multihop networks. Through simulations, we verify the superiority of our proposed schemes over state-of-the-art.

AB - The network coding problem across multiple unicasts is an open problem. Previously, the capacity region of 2-hop relay networks with multiple unicast sessions and limited feedback was characterized where the coding and decoding nodes are neighbors and packet erasure channels are used. A near-optimal coding scheme that exploits the broadcast nature and the diversity of the wireless links was proposed. However, the complexity of the scheme is hyper' exponential as it requires the knowledge of the packets that are received by any subset of the receivers. In this paper, we provide a polynomial time coding scheme and characterize its performance using linear equations. The coding scheme uses random network coding to carefully mix intra and intersession network coding and makes a linear, not exponential, number of decisions. We also provide a linear programming formulation that uses our 2-hop relay network results as a building block in large lossy multihop networks. Through simulations, we verify the superiority of our proposed schemes over state-of-the-art.

KW - 2-hop relay networks

KW - capacity

KW - fairness

KW - lossy wireless networks

KW - Network coding

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

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

U2 - 10.1109/MASS.2011.46

DO - 10.1109/MASS.2011.46

M3 - Conference contribution

SN - 9780769544694

SP - 391

EP - 400

BT - Proceedings - 8th IEEE International Conference on Mobile Ad-hoc and Sensor Systems, MASS 2011

ER -