Exploiting sparse coding: A sliding window enhancement of a random linear network coding scheme
EstadísticasView Usage Statistics
Full recordShow full item record
© 2016 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
IEEE International Conference on Communications (ICC), Kuala Lumpur, Malaysia, 2016, 757-762
Enlace a la publicación
Random linear coding
Random Linear Network Coding (RLNC) is a technique that provides several benefits. For instance, when applied over wireless mesh networks, it can be exploited to ease routing solutions as well as to increase the robustness against packet losses. Nevertheless, the complexity of the decoding process and the required overhead might jeopardize its performance. There is a trade-off when deciding the field and block sizes; larger values decrease the probability of transmitting linearly dependent packets, but they also increase both the required overhead and the decoding complexity. In order to overcome these limitations, we propose a sliding window enhancement; a fixed number of packets (fewer than the block size) is combined within every transmission, and the decoding process can therefore take advantage of the algebra with sparse matrices. The paper presents an analytical model, which is first validated and later broaden by means of an extensive simulation campaign carried out over the ns-3 simulator.