Home > Research > Publications & Outputs > Performance analysis of random linear network c...

Electronic data

  • ICC2015_CoCoNet

    Rights statement: ©2015 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

    Accepted author manuscript, 270 KB, PDF document

    Available under license: CC BY: Creative Commons Attribution 4.0 International License

Links

Text available via DOI:

View graph of relations

Performance analysis of random linear network coding in two-source single-relay networks

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paper

Published

Standard

Performance analysis of random linear network coding in two-source single-relay networks. / Khan, Amjad; Chatzigeorgiou, Ioannis.

IEEE International Conference on Communications (ICC) Workshops: Workshop on Cooperative and Cognitive Networks (CoCoNet). IEEE, 2015. p. 991-996.

Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSNConference contribution/Paper

Harvard

Khan, A & Chatzigeorgiou, I 2015, Performance analysis of random linear network coding in two-source single-relay networks. in IEEE International Conference on Communications (ICC) Workshops: Workshop on Cooperative and Cognitive Networks (CoCoNet). IEEE, pp. 991-996. https://doi.org/10.1109/ICCW.2015.7247305

APA

Khan, A., & Chatzigeorgiou, I. (2015). Performance analysis of random linear network coding in two-source single-relay networks. In IEEE International Conference on Communications (ICC) Workshops: Workshop on Cooperative and Cognitive Networks (CoCoNet) (pp. 991-996). IEEE. https://doi.org/10.1109/ICCW.2015.7247305

Vancouver

Khan A, Chatzigeorgiou I. Performance analysis of random linear network coding in two-source single-relay networks. In IEEE International Conference on Communications (ICC) Workshops: Workshop on Cooperative and Cognitive Networks (CoCoNet). IEEE. 2015. p. 991-996 https://doi.org/10.1109/ICCW.2015.7247305

Author

Khan, Amjad ; Chatzigeorgiou, Ioannis. / Performance analysis of random linear network coding in two-source single-relay networks. IEEE International Conference on Communications (ICC) Workshops: Workshop on Cooperative and Cognitive Networks (CoCoNet). IEEE, 2015. pp. 991-996

Bibtex

@inproceedings{aa91517ac144411caceaeb6a30d2590f,
title = "Performance analysis of random linear network coding in two-source single-relay networks",
abstract = "This paper considers the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node, over packet erasure channels. Intra-session network coding is used at the source nodes and inter-session network coding is employed at the relay node to combine the recovered source packets of both source nodes. In this work, we investigate the performance of the network-coded system in terms of the probability that the destination node will successfully recover the source packets of the two source nodes. We build our analysis on fundamental probability expressions for random matrices over finite fields and we derive upper bounds on the system performance for the case of systematic and non-systematic network coding. Simulation results show that the upper bounds are very tight and accurately predict the decoding probability at the destination node. Our analysis also exposes the clear benefits of systematic network coding at the source nodes compared to non-systematic transmission.",
author = "Amjad Khan and Ioannis Chatzigeorgiou",
note = " {\textcopyright}2015 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.",
year = "2015",
month = jun
day = "8",
doi = "10.1109/ICCW.2015.7247305",
language = "English",
isbn = "9781467363051",
pages = "991--996",
booktitle = "IEEE International Conference on Communications (ICC) Workshops",
publisher = "IEEE",

}

RIS

TY - GEN

T1 - Performance analysis of random linear network coding in two-source single-relay networks

AU - Khan, Amjad

AU - Chatzigeorgiou, Ioannis

N1 - ©2015 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

PY - 2015/6/8

Y1 - 2015/6/8

N2 - This paper considers the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node, over packet erasure channels. Intra-session network coding is used at the source nodes and inter-session network coding is employed at the relay node to combine the recovered source packets of both source nodes. In this work, we investigate the performance of the network-coded system in terms of the probability that the destination node will successfully recover the source packets of the two source nodes. We build our analysis on fundamental probability expressions for random matrices over finite fields and we derive upper bounds on the system performance for the case of systematic and non-systematic network coding. Simulation results show that the upper bounds are very tight and accurately predict the decoding probability at the destination node. Our analysis also exposes the clear benefits of systematic network coding at the source nodes compared to non-systematic transmission.

AB - This paper considers the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node, over packet erasure channels. Intra-session network coding is used at the source nodes and inter-session network coding is employed at the relay node to combine the recovered source packets of both source nodes. In this work, we investigate the performance of the network-coded system in terms of the probability that the destination node will successfully recover the source packets of the two source nodes. We build our analysis on fundamental probability expressions for random matrices over finite fields and we derive upper bounds on the system performance for the case of systematic and non-systematic network coding. Simulation results show that the upper bounds are very tight and accurately predict the decoding probability at the destination node. Our analysis also exposes the clear benefits of systematic network coding at the source nodes compared to non-systematic transmission.

U2 - 10.1109/ICCW.2015.7247305

DO - 10.1109/ICCW.2015.7247305

M3 - Conference contribution/Paper

SN - 9781467363051

SP - 991

EP - 996

BT - IEEE International Conference on Communications (ICC) Workshops

PB - IEEE

ER -