Abstract
Sparse network coding (SNC) is a promising technique for reducing the complexity of random linear network coding (RLNC), by selecting a sparse coefficient matrix to code the packets. However, the performance of SNC for the average decoding delay (ADD) of the packets is still unknown. We study the performance of ADD and propose a Markov chain model to analyze this SNC metric. This model provides a lower bound for decoding delay of a generation as well as a lower bound for decoding delay of a portion of a generation. Results show that although RLNC provides a better decoding delay of an entire generation, SNC outperforms RLNC in terms of ADD per packet. Sparsity of the coefficient matrix is a key parameter for ADD per packet to transmit stream data. The proposed model enables us to select the appropriate degree of sparsity based on the required ADD. Numerical results validate that the proposed model would enable a precise evaluation of SNC technique behavior.
Original language | English |
---|---|
Article number | 8364597 |
Journal | IEEE Communications Letters |
Volume | 22 |
Issue number | 8 |
Pages (from-to) | 1668-1671 |
Number of pages | 4 |
ISSN | 1089-7798 |
DOIs | |
Publication status | Published - Aug 2018 |
Bibliographical note
Publisher Copyright:© 1997-2012 IEEE.
Keywords
- Markov chain model
- Random linear network coding
- sparse network coding