On Optimal Policies for Network-Coded Cooperation: Theory and Implementation

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

Research output: Contribution to journalArticle

20 Citations (Scopus)

Abstract

Network-coded cooperative communication (NC-CC) has been proposed and evaluated as a powerful technology that can provide a better quality of service in the next-generation wireless systems, e.g., D2D communications. Previous contributions have focused on performance evaluation of NC-CC scenarios rather than searching for optimal policies that can minimize the total cost of reliable packet transmission. We break from this trend by initially analyzing the optimal design of NC-CC for a wireless network with one source, two receivers, and half-duplex erasure channels. The problem is modeled as a special case of Markov decision process (MDP), which is called stochastic shortest path (SSP), and is solved for any field size, arbitrary number of packets, and arbitrary erasure probabilities of the channels. The proposed MDP solution results in an optimal transmission policy per time slot, and we use it to design near-optimal heuristics for packet transmission in a network of one source and N ≥ 2 receivers. We also present numerical results that illustrate the performance of the proposed heuristics under a variety of scenarios. To complete our analysis, our heuristics are implemented in Aalborg University's Raspberry Pi testbed and compared with random linear network coding (RLNC) broadcast in terms of completion time, total number of required transmissions, and percentage of delivered generations. Our measurements show that enabling cooperation only among pairs of devices can decrease the completion time by up to 4.75 times, while delivering 100% of the 10 000 generations transmitted, as compared to RLNC broadcast delivering only 88% of them in our tests.

Original languageEnglish (US)
Article number6991522
Pages (from-to)199-212
Number of pages14
JournalIEEE Journal on Selected Areas in Communications
Volume33
Issue number2
DOIs
StatePublished - Feb 1 2015

Fingerprint

Cooperative communication
Linear networks
Network coding
Testbeds
Wireless networks
Quality of service
Communication
Costs

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Khamfroush, Hana ; Lucani, Daniel E. ; Pahlevani, Peyman ; Barros, Joao. / On Optimal Policies for Network-Coded Cooperation : Theory and Implementation. In: IEEE Journal on Selected Areas in Communications. 2015 ; Vol. 33, No. 2. pp. 199-212.
@article{7fff2fce95e740e5bbc33178f76a7366,
title = "On Optimal Policies for Network-Coded Cooperation: Theory and Implementation",
abstract = "Network-coded cooperative communication (NC-CC) has been proposed and evaluated as a powerful technology that can provide a better quality of service in the next-generation wireless systems, e.g., D2D communications. Previous contributions have focused on performance evaluation of NC-CC scenarios rather than searching for optimal policies that can minimize the total cost of reliable packet transmission. We break from this trend by initially analyzing the optimal design of NC-CC for a wireless network with one source, two receivers, and half-duplex erasure channels. The problem is modeled as a special case of Markov decision process (MDP), which is called stochastic shortest path (SSP), and is solved for any field size, arbitrary number of packets, and arbitrary erasure probabilities of the channels. The proposed MDP solution results in an optimal transmission policy per time slot, and we use it to design near-optimal heuristics for packet transmission in a network of one source and N ≥ 2 receivers. We also present numerical results that illustrate the performance of the proposed heuristics under a variety of scenarios. To complete our analysis, our heuristics are implemented in Aalborg University's Raspberry Pi testbed and compared with random linear network coding (RLNC) broadcast in terms of completion time, total number of required transmissions, and percentage of delivered generations. Our measurements show that enabling cooperation only among pairs of devices can decrease the completion time by up to 4.75 times, while delivering 100{\%} of the 10 000 generations transmitted, as compared to RLNC broadcast delivering only 88{\%} of them in our tests.",
author = "Hana Khamfroush and Lucani, {Daniel E.} and Peyman Pahlevani and Joao Barros",
year = "2015",
month = "2",
day = "1",
doi = "10.1109/JSAC.2014.2384291",
language = "English (US)",
volume = "33",
pages = "199--212",
journal = "IEEE Journal on Selected Areas in Communications",
issn = "0733-8716",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

On Optimal Policies for Network-Coded Cooperation : Theory and Implementation. / Khamfroush, Hana; Lucani, Daniel E.; Pahlevani, Peyman; Barros, Joao.

In: IEEE Journal on Selected Areas in Communications, Vol. 33, No. 2, 6991522, 01.02.2015, p. 199-212.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On Optimal Policies for Network-Coded Cooperation

T2 - Theory and Implementation

AU - Khamfroush, Hana

AU - Lucani, Daniel E.

AU - Pahlevani, Peyman

AU - Barros, Joao

PY - 2015/2/1

Y1 - 2015/2/1

N2 - Network-coded cooperative communication (NC-CC) has been proposed and evaluated as a powerful technology that can provide a better quality of service in the next-generation wireless systems, e.g., D2D communications. Previous contributions have focused on performance evaluation of NC-CC scenarios rather than searching for optimal policies that can minimize the total cost of reliable packet transmission. We break from this trend by initially analyzing the optimal design of NC-CC for a wireless network with one source, two receivers, and half-duplex erasure channels. The problem is modeled as a special case of Markov decision process (MDP), which is called stochastic shortest path (SSP), and is solved for any field size, arbitrary number of packets, and arbitrary erasure probabilities of the channels. The proposed MDP solution results in an optimal transmission policy per time slot, and we use it to design near-optimal heuristics for packet transmission in a network of one source and N ≥ 2 receivers. We also present numerical results that illustrate the performance of the proposed heuristics under a variety of scenarios. To complete our analysis, our heuristics are implemented in Aalborg University's Raspberry Pi testbed and compared with random linear network coding (RLNC) broadcast in terms of completion time, total number of required transmissions, and percentage of delivered generations. Our measurements show that enabling cooperation only among pairs of devices can decrease the completion time by up to 4.75 times, while delivering 100% of the 10 000 generations transmitted, as compared to RLNC broadcast delivering only 88% of them in our tests.

AB - Network-coded cooperative communication (NC-CC) has been proposed and evaluated as a powerful technology that can provide a better quality of service in the next-generation wireless systems, e.g., D2D communications. Previous contributions have focused on performance evaluation of NC-CC scenarios rather than searching for optimal policies that can minimize the total cost of reliable packet transmission. We break from this trend by initially analyzing the optimal design of NC-CC for a wireless network with one source, two receivers, and half-duplex erasure channels. The problem is modeled as a special case of Markov decision process (MDP), which is called stochastic shortest path (SSP), and is solved for any field size, arbitrary number of packets, and arbitrary erasure probabilities of the channels. The proposed MDP solution results in an optimal transmission policy per time slot, and we use it to design near-optimal heuristics for packet transmission in a network of one source and N ≥ 2 receivers. We also present numerical results that illustrate the performance of the proposed heuristics under a variety of scenarios. To complete our analysis, our heuristics are implemented in Aalborg University's Raspberry Pi testbed and compared with random linear network coding (RLNC) broadcast in terms of completion time, total number of required transmissions, and percentage of delivered generations. Our measurements show that enabling cooperation only among pairs of devices can decrease the completion time by up to 4.75 times, while delivering 100% of the 10 000 generations transmitted, as compared to RLNC broadcast delivering only 88% of them in our tests.

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

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

U2 - 10.1109/JSAC.2014.2384291

DO - 10.1109/JSAC.2014.2384291

M3 - Article

AN - SCOPUS:84924954494

VL - 33

SP - 199

EP - 212

JO - IEEE Journal on Selected Areas in Communications

JF - IEEE Journal on Selected Areas in Communications

SN - 0733-8716

IS - 2

M1 - 6991522

ER -