Low complexity and provably efficient algorithm for joint inter and intrasession network coding in wireless networks

Abdallah Khreishah, Issa Khalil, Jie Wu

Research output: Contribution to journalArticle

7 Citations (Scopus)

Abstract

The performance of wireless networks can be enhanced by performing network coding on the intermediate relay nodes. To enhance the throughput of large wireless networks, we can decompose them into a superposition of simple relay networks called two-hop relay networks. Previously, the capacity region of two-hop relay networks with multiple unicast sessions and limited feedback was characterized where 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 exponential in terms of the number of sessions, 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. For two-hop relay networks with two sessions, we provide an optimal coding scheme that does not require the knowledge of the channel conditions. We also provide a linear programming formulation that uses our two-hop relay network results as a building block in large lossy multihop networks.

Original languageEnglish
Article number6244791
Pages (from-to)2015-2024
Number of pages10
JournalIEEE Transactions on Parallel and Distributed Systems
Volume24
Issue number10
DOIs
Publication statusPublished - 9 Sep 2013

Fingerprint

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

Keywords

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

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Computational Theory and Mathematics

Cite this

Low complexity and provably efficient algorithm for joint inter and intrasession network coding in wireless networks. / Khreishah, Abdallah; Khalil, Issa; Wu, Jie.

In: IEEE Transactions on Parallel and Distributed Systems, Vol. 24, No. 10, 6244791, 09.09.2013, p. 2015-2024.

Research output: Contribution to journalArticle

@article{4c4ec266e67148b9ab330e92ed4d89f2,
title = "Low complexity and provably efficient algorithm for joint inter and intrasession network coding in wireless networks",
abstract = "The performance of wireless networks can be enhanced by performing network coding on the intermediate relay nodes. To enhance the throughput of large wireless networks, we can decompose them into a superposition of simple relay networks called two-hop relay networks. Previously, the capacity region of two-hop relay networks with multiple unicast sessions and limited feedback was characterized where 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 exponential in terms of the number of sessions, 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. For two-hop relay networks with two sessions, we provide an optimal coding scheme that does not require the knowledge of the channel conditions. We also provide a linear programming formulation that uses our two-hop relay network results as a building block in large lossy multihop networks.",
keywords = "capacity, fairness, lossy wireless networks, Network coding, two-hop relay networks",
author = "Abdallah Khreishah and Issa Khalil and Jie Wu",
year = "2013",
month = "9",
day = "9",
doi = "10.1109/TPDS.2012.215",
language = "English",
volume = "24",
pages = "2015--2024",
journal = "IEEE Transactions on Parallel and Distributed Systems",
issn = "1045-9219",
publisher = "IEEE Computer Society",
number = "10",

}

TY - JOUR

T1 - Low complexity and provably efficient algorithm for joint inter and intrasession network coding in wireless networks

AU - Khreishah, Abdallah

AU - Khalil, Issa

AU - Wu, Jie

PY - 2013/9/9

Y1 - 2013/9/9

N2 - The performance of wireless networks can be enhanced by performing network coding on the intermediate relay nodes. To enhance the throughput of large wireless networks, we can decompose them into a superposition of simple relay networks called two-hop relay networks. Previously, the capacity region of two-hop relay networks with multiple unicast sessions and limited feedback was characterized where 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 exponential in terms of the number of sessions, 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. For two-hop relay networks with two sessions, we provide an optimal coding scheme that does not require the knowledge of the channel conditions. We also provide a linear programming formulation that uses our two-hop relay network results as a building block in large lossy multihop networks.

AB - The performance of wireless networks can be enhanced by performing network coding on the intermediate relay nodes. To enhance the throughput of large wireless networks, we can decompose them into a superposition of simple relay networks called two-hop relay networks. Previously, the capacity region of two-hop relay networks with multiple unicast sessions and limited feedback was characterized where 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 exponential in terms of the number of sessions, 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. For two-hop relay networks with two sessions, we provide an optimal coding scheme that does not require the knowledge of the channel conditions. We also provide a linear programming formulation that uses our two-hop relay network results as a building block in large lossy multihop networks.

KW - capacity

KW - fairness

KW - lossy wireless networks

KW - Network coding

KW - two-hop relay networks

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

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

U2 - 10.1109/TPDS.2012.215

DO - 10.1109/TPDS.2012.215

M3 - Article

VL - 24

SP - 2015

EP - 2024

JO - IEEE Transactions on Parallel and Distributed Systems

JF - IEEE Transactions on Parallel and Distributed Systems

SN - 1045-9219

IS - 10

M1 - 6244791

ER -