Improved Bounds on the Decoding Failure Probability of Network Coding Over Multi-Source Multi-Relay Networks

Amjad Saeed Khan; Ioannis Chatzigeorgiou

doi:10.1109/LCOMM.2016.2594768

Improved Bounds on the Decoding Failure Probability of Network Coding Over Multi-Source Multi-Relay Networks

Amjad Saeed Khan, Ioannis Chatzigeorgiou

Lancaster University

Research output: Contribution to journal › Article › peer-review

17 Citations (Scopus)

34 Downloads (Pure)

Abstract

This letter considers a multi-source multi-relay network in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it can recover the packets of all source nodes. The links between source-to-relay nodes and relay-to-destination nodes are modeled as packet erasure channels. Improved bounds on the probability of decoding failure are presented, which are markedly close to simulation results and notably better than previous bounds. Examples demonstrate the tightness and usefulness of the new bounds over the old bounds.

Original language	English
Pages (from-to)	2035-2038
Number of pages	4
Journal	IEEE Communications Letters
Volume	20
Issue number	10
Early online date	27 Jul 2016
DOIs	https://doi.org/10.1109/LCOMM.2016.2594768
Publication status	Published - Oct 2016
Externally published	Yes

Bibliographical note

© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

Access to Document

10.1109/LCOMM.2016.2594768

Post-PrintAccepted author manuscript, 503 KBLicence: Unspecified

Cite this

@article{ded003363eff447da1d9a448d1a9efa5,

title = "Improved Bounds on the Decoding Failure Probability of Network Coding Over Multi-Source Multi-Relay Networks",

abstract = "This letter considers a multi-source multi-relay network in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it can recover the packets of all source nodes. The links between source-to-relay nodes and relay-to-destination nodes are modeled as packet erasure channels. Improved bounds on the probability of decoding failure are presented, which are markedly close to simulation results and notably better than previous bounds. Examples demonstrate the tightness and usefulness of the new bounds over the old bounds.",

author = "Khan, {Amjad Saeed} and Ioannis Chatzigeorgiou",

note = "{\textcopyright} 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.",

year = "2016",

month = oct,

doi = "10.1109/LCOMM.2016.2594768",

language = "English",

volume = "20",

pages = "2035--2038",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "Institute of Electrical and Electronics Engineers",

number = "10",

}

TY - JOUR

T1 - Improved Bounds on the Decoding Failure Probability of Network Coding Over Multi-Source Multi-Relay Networks

AU - Khan, Amjad Saeed

AU - Chatzigeorgiou , Ioannis

N1 - © 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

PY - 2016/10

Y1 - 2016/10

N2 - This letter considers a multi-source multi-relay network in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it can recover the packets of all source nodes. The links between source-to-relay nodes and relay-to-destination nodes are modeled as packet erasure channels. Improved bounds on the probability of decoding failure are presented, which are markedly close to simulation results and notably better than previous bounds. Examples demonstrate the tightness and usefulness of the new bounds over the old bounds.

AB - This letter considers a multi-source multi-relay network in which relay nodes employ a coding scheme based on random linear network coding on source packets and generate coded packets. If a destination node collects enough coded packets, it can recover the packets of all source nodes. The links between source-to-relay nodes and relay-to-destination nodes are modeled as packet erasure channels. Improved bounds on the probability of decoding failure are presented, which are markedly close to simulation results and notably better than previous bounds. Examples demonstrate the tightness and usefulness of the new bounds over the old bounds.

U2 - 10.1109/LCOMM.2016.2594768

DO - 10.1109/LCOMM.2016.2594768

M3 - Article

SN - 1089-7798

VL - 20

SP - 2035

EP - 2038

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 10

ER -

Improved Bounds on the Decoding Failure Probability of Network Coding Over Multi-Source Multi-Relay Networks

Abstract

Bibliographical note

Access to Document

Fingerprint

Cite this