Name
Abstract | ||
|---|---|---|
Random Linear Network Coding (RLNC) provides a theoretically efficient method for coding. The drawbacks associated with it are the complexity of the decoding and the overhead resulting from the encoding vector. Increasing the field size and generation length presents a fundamental trade-off between packet-based throughput and operational overhead. On the one hand, decreasing the probability of redundant packets' being transmitted is beneficial for throughput and, consequently, reduces transmission energy. On the other hand, the decoding complexity and amount of header overhead increase with field size and generation length, leading to higher energy consumption. The main findings of this work are bounds for the transmission overhead due to linearly dependent packets. The optimal trade-off is system and topology dependent, as it depends on the cost in energy of performing coding operations versus transmitting data. We show that moderate field sizes are the correct choice when trade-offs are considered. The results show that sparse binary codes perform the best, unless the generation size is very low. |
Year | DOI | Venue |
|---|---|---|
2011 | 10.1109/icc.2011.5963013 | Communications |
Keywords | DocType | ISSN |
binary codes,computational complexity,decoding,linear codes,network coding,random codes,telecommunication network topology,code parameters,coding vector representation,decoding complexity,energy consumption,field size,generation length,operational overhead,packet-based throughput,random linear network coding,redundant packets,sparse binary codes | Conference | 1550-3607 E-ISBN : 978-1-61284-231-8 |
ISBN | Citations | PageRank |
978-1-61284-231-8 | 9 | 1.10 |
References | Authors | |
5 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Janus Heide | 1 | 153 | 17.00 |
| Morten Videbæk Pedersen | 2 | 202 | 18.49 |
| F. H.P. Fitzek | 3 | 689 | 56.23 |
| Muriel Médard | 4 | 6828 | 599.31 |