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

Fingerprint

Linear networks
Network coding
coding
evaluation
matrices
Cryptography
Throughput

All Science Journal Classification (ASJC) codes

  • Physics and Astronomy(all)

Cite this

@article{31f6ae6e45d247d694d4da5a97c2a6b6,
title = "Performance evaluation of random linear network coding using a Vandermonde matrix",
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.",
author = "Mane, {Pallavi R.} and Adiga, {Sudhakara G.} and {Sathish Kumar}, M.",
year = "2014",
doi = "10.1016/j.phycom.2013.11.008",
language = "English",
volume = "10",
pages = "24--30",
journal = "Physical Communication",
issn = "1874-4907",
publisher = "Elsevier",

}

Performance evaluation of random linear network coding using a Vandermonde matrix. / Mane, Pallavi R.; Adiga, Sudhakara G.; Sathish Kumar, M.

In: Physical Communication, Vol. 10, 2014, p. 24-30.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Performance evaluation of random linear network coding using a Vandermonde matrix

AU - Mane, Pallavi R.

AU - Adiga, Sudhakara G.

AU - Sathish Kumar, M.

PY - 2014

Y1 - 2014

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

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

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

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

U2 - 10.1016/j.phycom.2013.11.008

DO - 10.1016/j.phycom.2013.11.008

M3 - Article

VL - 10

SP - 24

EP - 30

JO - Physical Communication

JF - Physical Communication

SN - 1874-4907

ER -