Network-coded cooperation over time-varying channels

Hana Khamfroush, Daniel E. Lucani, Joao Barros, Peyman Pahlevani

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

In this paper, we investigate the optimal design of cooperative network-coded strategies for a three-node wireless network with time-varying half-duplex erasure channels. To this end, we formulate the problem of minimizing the total cost of transmitting $M$ packets from source to two receivers as a Markov decision process (MDP). The actions of the MDP model include the source and the type of transmission to be used in a given time slot given perfect knowledge of the system state. The cost of packet transmission is defined such that it can incorporate the difference between broadcast and unicast transmissions, e.g., in terms of the rate of packet transmission or the energy consumption. A comprehensive analysis of the MDP solution is carried out under different network conditions to extract optimal rules of packet transmission. Inspired by the extracted rules, we propose two near-optimal heuristics that are suitable for practical systems. We use two wireless channel models to analyze the performance of the proposed heuristics in practical wireless networks, namely, 1) an infrastructure-to-vehicle communication in a highway scenario considering Rayleigh fading and 2) real packet loss measurements for WiFi using Aalborg University's Raspberry Pi testbed. We compare our results with random linear network coding broadcasting schemes showing that our heuristics can provide up to 2 $\times$ gains in completion time and up to 4 $\times$ gains in terms of reliably serviced data packets.

Original languageEnglish (US)
Article number6945883
Pages (from-to)4413-4425
Number of pages13
JournalIEEE Transactions on Communications
Volume62
Issue number12
DOIs
StatePublished - Dec 1 2014

Fingerprint

Wireless networks
Linear networks
Network coding
Rayleigh fading
Packet loss
Broadcasting
Testbeds
Costs
Energy utilization
Communication
Optimal design

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

Khamfroush, H., Lucani, D. E., Barros, J., & Pahlevani, P. (2014). Network-coded cooperation over time-varying channels. IEEE Transactions on Communications, 62(12), 4413-4425. [6945883]. https://doi.org/10.1109/TCOMM.2014.2367016
Khamfroush, Hana ; Lucani, Daniel E. ; Barros, Joao ; Pahlevani, Peyman. / Network-coded cooperation over time-varying channels. In: IEEE Transactions on Communications. 2014 ; Vol. 62, No. 12. pp. 4413-4425.
@article{83281ee5b92a48c6b7543ee8ff7eb243,
title = "Network-coded cooperation over time-varying channels",
abstract = "In this paper, we investigate the optimal design of cooperative network-coded strategies for a three-node wireless network with time-varying half-duplex erasure channels. To this end, we formulate the problem of minimizing the total cost of transmitting $M$ packets from source to two receivers as a Markov decision process (MDP). The actions of the MDP model include the source and the type of transmission to be used in a given time slot given perfect knowledge of the system state. The cost of packet transmission is defined such that it can incorporate the difference between broadcast and unicast transmissions, e.g., in terms of the rate of packet transmission or the energy consumption. A comprehensive analysis of the MDP solution is carried out under different network conditions to extract optimal rules of packet transmission. Inspired by the extracted rules, we propose two near-optimal heuristics that are suitable for practical systems. We use two wireless channel models to analyze the performance of the proposed heuristics in practical wireless networks, namely, 1) an infrastructure-to-vehicle communication in a highway scenario considering Rayleigh fading and 2) real packet loss measurements for WiFi using Aalborg University's Raspberry Pi testbed. We compare our results with random linear network coding broadcasting schemes showing that our heuristics can provide up to 2 $\times$ gains in completion time and up to 4 $\times$ gains in terms of reliably serviced data packets.",
author = "Hana Khamfroush and Lucani, {Daniel E.} and Joao Barros and Peyman Pahlevani",
year = "2014",
month = "12",
day = "1",
doi = "10.1109/TCOMM.2014.2367016",
language = "English (US)",
volume = "62",
pages = "4413--4425",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "12",

}

Khamfroush, H, Lucani, DE, Barros, J & Pahlevani, P 2014, 'Network-coded cooperation over time-varying channels', IEEE Transactions on Communications, vol. 62, no. 12, 6945883, pp. 4413-4425. https://doi.org/10.1109/TCOMM.2014.2367016

Network-coded cooperation over time-varying channels. / Khamfroush, Hana; Lucani, Daniel E.; Barros, Joao; Pahlevani, Peyman.

In: IEEE Transactions on Communications, Vol. 62, No. 12, 6945883, 01.12.2014, p. 4413-4425.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Network-coded cooperation over time-varying channels

AU - Khamfroush, Hana

AU - Lucani, Daniel E.

AU - Barros, Joao

AU - Pahlevani, Peyman

PY - 2014/12/1

Y1 - 2014/12/1

N2 - In this paper, we investigate the optimal design of cooperative network-coded strategies for a three-node wireless network with time-varying half-duplex erasure channels. To this end, we formulate the problem of minimizing the total cost of transmitting $M$ packets from source to two receivers as a Markov decision process (MDP). The actions of the MDP model include the source and the type of transmission to be used in a given time slot given perfect knowledge of the system state. The cost of packet transmission is defined such that it can incorporate the difference between broadcast and unicast transmissions, e.g., in terms of the rate of packet transmission or the energy consumption. A comprehensive analysis of the MDP solution is carried out under different network conditions to extract optimal rules of packet transmission. Inspired by the extracted rules, we propose two near-optimal heuristics that are suitable for practical systems. We use two wireless channel models to analyze the performance of the proposed heuristics in practical wireless networks, namely, 1) an infrastructure-to-vehicle communication in a highway scenario considering Rayleigh fading and 2) real packet loss measurements for WiFi using Aalborg University's Raspberry Pi testbed. We compare our results with random linear network coding broadcasting schemes showing that our heuristics can provide up to 2 $\times$ gains in completion time and up to 4 $\times$ gains in terms of reliably serviced data packets.

AB - In this paper, we investigate the optimal design of cooperative network-coded strategies for a three-node wireless network with time-varying half-duplex erasure channels. To this end, we formulate the problem of minimizing the total cost of transmitting $M$ packets from source to two receivers as a Markov decision process (MDP). The actions of the MDP model include the source and the type of transmission to be used in a given time slot given perfect knowledge of the system state. The cost of packet transmission is defined such that it can incorporate the difference between broadcast and unicast transmissions, e.g., in terms of the rate of packet transmission or the energy consumption. A comprehensive analysis of the MDP solution is carried out under different network conditions to extract optimal rules of packet transmission. Inspired by the extracted rules, we propose two near-optimal heuristics that are suitable for practical systems. We use two wireless channel models to analyze the performance of the proposed heuristics in practical wireless networks, namely, 1) an infrastructure-to-vehicle communication in a highway scenario considering Rayleigh fading and 2) real packet loss measurements for WiFi using Aalborg University's Raspberry Pi testbed. We compare our results with random linear network coding broadcasting schemes showing that our heuristics can provide up to 2 $\times$ gains in completion time and up to 4 $\times$ gains in terms of reliably serviced data packets.

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

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

U2 - 10.1109/TCOMM.2014.2367016

DO - 10.1109/TCOMM.2014.2367016

M3 - Article

AN - SCOPUS:84919654315

VL - 62

SP - 4413

EP - 4425

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 12

M1 - 6945883

ER -

Khamfroush H, Lucani DE, Barros J, Pahlevani P. Network-coded cooperation over time-varying channels. IEEE Transactions on Communications. 2014 Dec 1;62(12):4413-4425. 6945883. https://doi.org/10.1109/TCOMM.2014.2367016