On code parameters and coding vector representation for practical RLNC
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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
| Online Access: | http://hdl.handle.net/1721.1/73680 https://orcid.org/0000-0003-4059-407X |
| _version_ | 1811086956153536512 |
|---|---|
| author | Heide, Janus Pedersen, Morten V. Fitzek, Frank H. P. Medard, Muriel |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Heide, Janus Pedersen, Morten V. Fitzek, Frank H. P. Medard, Muriel |
| author_sort | Heide, Janus |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T13:37:29Z |
| format | Article |
| id | mit-1721.1/73680 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T13:37:29Z |
| publishDate | 2012 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/736802022-09-28T15:06:37Z On code parameters and coding vector representation for practical RLNC Heide, Janus Pedersen, Morten V. Fitzek, Frank H. P. Medard, Muriel Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Medard, Muriel 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. Cooperation and Network Coding Project (CONE) (Grant 09-066549/FTP) 2012-10-09T15:26:41Z 2012-10-09T15:26:41Z 2011-07 2011-06 Article http://purl.org/eprint/type/ConferencePaper 978-1-61284-231-8 978-1-61284-232-5 1550-3607 http://hdl.handle.net/1721.1/73680 Heide, Janus et al. “On Code Parameters and Coding Vector Representation for Practical RLNC.” IEEE International Conference on Communications (ICC), 2011. 1–5. https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1109/icc.2011.5963013 Proceedings of the IEEE International Conference on Communications (ICC), 2011 Creative Commons Attribution-Noncommercial-Share Alike 3.0 http://creativecommons.org/licenses/by-nc-sa/3.0/ application/pdf Institute of Electrical and Electronics Engineers (IEEE) MIT web domain |
| spellingShingle | Heide, Janus Pedersen, Morten V. Fitzek, Frank H. P. Medard, Muriel On code parameters and coding vector representation for practical RLNC |
| title | On code parameters and coding vector representation for practical RLNC |
| title_full | On code parameters and coding vector representation for practical RLNC |
| title_fullStr | On code parameters and coding vector representation for practical RLNC |
| title_full_unstemmed | On code parameters and coding vector representation for practical RLNC |
| title_short | On code parameters and coding vector representation for practical RLNC |
| title_sort | on code parameters and coding vector representation for practical rlnc |
| url | http://hdl.handle.net/1721.1/73680 https://orcid.org/0000-0003-4059-407X |
| work_keys_str_mv | AT heidejanus oncodeparametersandcodingvectorrepresentationforpracticalrlnc AT pedersenmortenv oncodeparametersandcodingvectorrepresentationforpracticalrlnc AT fitzekfrankhp oncodeparametersandcodingvectorrepresentationforpracticalrlnc AT medardmuriel oncodeparametersandcodingvectorrepresentationforpracticalrlnc |