Performance evaluation of random linear network coding using a Vandermonde matrix

Pallavi R. Mane, Sudhakara G. Adiga, M. Sathish Kumar

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

This paper discusses random linear network coding with and without the use of a Vandermonde matrix to obtain the coding coefficients. Performance comparisons of such random linear network coded networks with networks employing traditional store and forward technique are also provided. It is shown that random linear network coding using a Vandermonde matrix can improve the network utilization factor by reducing the overhead compared to random linear coding that does not use a Vandermonde matrix. Our numerical results show that random linear network coding with a Vandermonde matrix provides a considerable improvement in throughput and delay when compared to a network employing a traditional store and forward strategy. An inherent feature of random linear network coding which makes it possible to employ simple encryption techniques is also discussed.

Original languageEnglish
Pages (from-to)24-30
Number of pages7
JournalPhysical Communication
Volume10
DOIs
Publication statusPublished - 2014

All Science Journal Classification (ASJC) codes

  • Physics and Astronomy(all)

Fingerprint Dive into the research topics of 'Performance evaluation of random linear network coding using a Vandermonde matrix'. Together they form a unique fingerprint.

  • Cite this