Performance evaluation of random linear network coding using a Vandermonde matrix

Mane, Pallavi R and Sudhakara, G and Kumar, Sathish M (2014) Performance evaluation of random linear network coding using a Vandermonde matrix. Physical Communication, 10. pp. 24-30.

[img] PDF
1-s2.0-S1874490713000852-main.pdf - Published Version
Restricted to Registered users only

Download (954kB) | Request a copy

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.

Item Type: Article
Uncontrolled Keywords: Network coding Utilization factor Random linear network coding Vandermonde matrix Packet delivery delay
Subjects: Engineering > MIT Manipal > Electronics and Communication
Engineering > MIT Manipal > Mathematics
Depositing User: MIT Library
Date Deposited: 02 Jun 2014 06:14
Last Modified: 02 Jun 2014 06:14
URI: http://eprints.manipal.edu/id/eprint/139584

Actions (login required)

View Item View Item