Flow-based XOR network coding for lossy wireless networks

Abdallah Khreishah, Issa Khalil, Pouya Ostovari, Jie Wu

Research output: Contribution to journalArticle

27 Citations (Scopus)

Abstract

A practical way for maximizing the throughput of a wireless network is to decompose the network into a superposition of small two-hop networks such that network coding can be performed inside these small networks to resolve bottlenecks. We call these networks 2-hop relay networks. Therefore, studying the capacity of 2-hop relay networks is very important. Most practical network coding protocols that perform the superposition ignore the diversity among the links by turning off coding when the channels are lossy. Other protocols deal with the packets separately not as members of flows which makes the network coding problem with lossy links intractable. In this paper, we use a different approach by looking at flows or batches instead of individual packets. We characterize the capacity region of the 2-hop relay network with packet erasure channels when the coding operations are limited to XOR. We derive our results by constructing an upper bound on the capacity region and then providing a coding scheme that can achieve the upper bound. The capacity characterization is in terms of linear equations. We also extend our 2-hop relay networks results to multihop wireless networks by providing a linear program that can perform the superposition optimally. We perform extensive simulations for both the 2-hop relay and large wireless networks and show the superiority of our protocols over the network coding protocols that deal with the packets separately.

Original languageEnglish
Article number6189010
Pages (from-to)2321-2329
Number of pages9
JournalIEEE Transactions on Wireless Communications
Volume11
Issue number6
DOIs
Publication statusPublished - 1 Jun 2012
Externally publishedYes

Fingerprint

Network coding
Relay Networks
Network Coding
Wireless Networks
Wireless networks
Superposition
Network protocols
Coding
Upper bound
Multi-hop Wireless Networks
Linear equations
Linear Program
Relay
Batch
Linear equation
Resolve
Throughput
Decompose
Simulation

Keywords

  • 2-hop relay networks
  • capacity
  • fairness
  • Network coding
  • packet erasure channels
  • wireless networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Applied Mathematics

Cite this

Flow-based XOR network coding for lossy wireless networks. / Khreishah, Abdallah; Khalil, Issa; Ostovari, Pouya; Wu, Jie.

In: IEEE Transactions on Wireless Communications, Vol. 11, No. 6, 6189010, 01.06.2012, p. 2321-2329.

Research output: Contribution to journalArticle

Khreishah, Abdallah ; Khalil, Issa ; Ostovari, Pouya ; Wu, Jie. / Flow-based XOR network coding for lossy wireless networks. In: IEEE Transactions on Wireless Communications. 2012 ; Vol. 11, No. 6. pp. 2321-2329.
@article{8bd1bc40ff7e4a4f8d12fd6454e8392a,
title = "Flow-based XOR network coding for lossy wireless networks",
abstract = "A practical way for maximizing the throughput of a wireless network is to decompose the network into a superposition of small two-hop networks such that network coding can be performed inside these small networks to resolve bottlenecks. We call these networks 2-hop relay networks. Therefore, studying the capacity of 2-hop relay networks is very important. Most practical network coding protocols that perform the superposition ignore the diversity among the links by turning off coding when the channels are lossy. Other protocols deal with the packets separately not as members of flows which makes the network coding problem with lossy links intractable. In this paper, we use a different approach by looking at flows or batches instead of individual packets. We characterize the capacity region of the 2-hop relay network with packet erasure channels when the coding operations are limited to XOR. We derive our results by constructing an upper bound on the capacity region and then providing a coding scheme that can achieve the upper bound. The capacity characterization is in terms of linear equations. We also extend our 2-hop relay networks results to multihop wireless networks by providing a linear program that can perform the superposition optimally. We perform extensive simulations for both the 2-hop relay and large wireless networks and show the superiority of our protocols over the network coding protocols that deal with the packets separately.",
keywords = "2-hop relay networks, capacity, fairness, Network coding, packet erasure channels, wireless networks",
author = "Abdallah Khreishah and Issa Khalil and Pouya Ostovari and Jie Wu",
year = "2012",
month = "6",
day = "1",
doi = "10.1109/TWC.2012.041912.112105",
language = "English",
volume = "11",
pages = "2321--2329",
journal = "IEEE Transactions on Wireless Communications",
issn = "1536-1276",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Flow-based XOR network coding for lossy wireless networks

AU - Khreishah, Abdallah

AU - Khalil, Issa

AU - Ostovari, Pouya

AU - Wu, Jie

PY - 2012/6/1

Y1 - 2012/6/1

N2 - A practical way for maximizing the throughput of a wireless network is to decompose the network into a superposition of small two-hop networks such that network coding can be performed inside these small networks to resolve bottlenecks. We call these networks 2-hop relay networks. Therefore, studying the capacity of 2-hop relay networks is very important. Most practical network coding protocols that perform the superposition ignore the diversity among the links by turning off coding when the channels are lossy. Other protocols deal with the packets separately not as members of flows which makes the network coding problem with lossy links intractable. In this paper, we use a different approach by looking at flows or batches instead of individual packets. We characterize the capacity region of the 2-hop relay network with packet erasure channels when the coding operations are limited to XOR. We derive our results by constructing an upper bound on the capacity region and then providing a coding scheme that can achieve the upper bound. The capacity characterization is in terms of linear equations. We also extend our 2-hop relay networks results to multihop wireless networks by providing a linear program that can perform the superposition optimally. We perform extensive simulations for both the 2-hop relay and large wireless networks and show the superiority of our protocols over the network coding protocols that deal with the packets separately.

AB - A practical way for maximizing the throughput of a wireless network is to decompose the network into a superposition of small two-hop networks such that network coding can be performed inside these small networks to resolve bottlenecks. We call these networks 2-hop relay networks. Therefore, studying the capacity of 2-hop relay networks is very important. Most practical network coding protocols that perform the superposition ignore the diversity among the links by turning off coding when the channels are lossy. Other protocols deal with the packets separately not as members of flows which makes the network coding problem with lossy links intractable. In this paper, we use a different approach by looking at flows or batches instead of individual packets. We characterize the capacity region of the 2-hop relay network with packet erasure channels when the coding operations are limited to XOR. We derive our results by constructing an upper bound on the capacity region and then providing a coding scheme that can achieve the upper bound. The capacity characterization is in terms of linear equations. We also extend our 2-hop relay networks results to multihop wireless networks by providing a linear program that can perform the superposition optimally. We perform extensive simulations for both the 2-hop relay and large wireless networks and show the superiority of our protocols over the network coding protocols that deal with the packets separately.

KW - 2-hop relay networks

KW - capacity

KW - fairness

KW - Network coding

KW - packet erasure channels

KW - wireless networks

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

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

U2 - 10.1109/TWC.2012.041912.112105

DO - 10.1109/TWC.2012.041912.112105

M3 - Article

VL - 11

SP - 2321

EP - 2329

JO - IEEE Transactions on Wireless Communications

JF - IEEE Transactions on Wireless Communications

SN - 1536-1276

IS - 6

M1 - 6189010

ER -