Paper Info
Title
On The Overhead Of Telescopic Codes In Network Coded Cooperation
Abstract
Although Random Linear Network Coding (RLNC) has been shown to reduce the number of transmissions for multicast scenarios at large enough field sizes, there is an inherent signaling overhead to achieve these benefits. Traditionally, a larger field requires less transmissions but at the cost of a larger coding vector of coefficients. On the contrary, a lower field needs fewer bits to represent the coding coefficients, but has the drawback of requiring more transmissions to deliver the data due to a high probability of linear dependence while receiving the last packets. This work advocates for the use of telescopic network codes as a way to achieve low overhead for cooperation in multicast transmissions over mobile networks. The idea behind them is to design a field of a larger size as a composite of a previous with lower size in order to have arithmetics of the extended field as operations in the base field, hence, allowing the system to use different fields in a single generation. The resulting codes posses very low overhead by having a short coded packet representation besides keeping a low linearly dependent probability for the last packets. We provide an analytical framework that is supported by numerical results showing that is feasible to attain less than 3% total mean overhead instead of higher values with RLNC schemes in most of the considered cases achieving at least 1.5-2x gains.
Year
Venue
Keywords
2015
2015 IEEE 82ND VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL)
Cooperation, mobile clouds, network coding, overhead
Field
DocType
Citations 
Linear network coding,Linear independence,Computer science,Network packet,Computer network,Coding (social sciences),Decoding methods,Multicast,Mobile telephony,Encoding (memory)
Conference
0
PageRank 
References 
Authors
0.34
8
4
Name
Order
Citations
PageRank
Nestor J. Hernandez Marcano141.73
Janus Heide215317.00
Daniel Enrique Lucani321718.06
Frank H. P. Fitzek4706123.89