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/Paperpeer-review

Published
Publication date8/06/2015
Host publicationIEEE International Conference on Communications (ICC) Workshops: Workshop on Cooperative and Cognitive Networks (CoCoNet)
PublisherIEEE
Pages991-996
Number of pages6
ISBN (print)9781467363051
<mark>Original language</mark>English

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.

Bibliographic note

©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.