Show simple item record

dc.contributor.authorCohen, Alejandro
dc.contributor.authorThiran, Guillaume
dc.contributor.authorBracha, Vered Bar
dc.contributor.authorMedard, Muriel
dc.date.accessioned2022-07-25T13:52:02Z
dc.date.available2022-07-25T13:52:02Z
dc.date.issued2020
dc.identifier.urihttps://hdl.handle.net/1721.1/144006
dc.description.abstract© 1972-2012 IEEE. We propose a novel multipath multi-hop adaptive and causal random linear network coding (AC-RLNC) algorithm with forward error correction. This algorithm generalizes our joint optimization coding solution for point-to-point communication with delayed feedback. AC-RLNC is adaptive to the estimated channel condition, and is causal, as the coding adjusts the retransmission rates using a priori and posteriori algorithms. In the multipath network, to achieve the desired throughput and delay, we propose to incorporate an adaptive packet allocation algorithm for retransmission, across the available resources of the paths. This approach is based on a discrete water filling algorithm, i.e., bit-filling, but, with two desired objectives, maximize throughput and minimize the delay. In the multipath multi-hop setting, we propose a new decentralized balancing optimization algorithm. This balancing algorithm minimizes the throughput degradation, caused by the variations in the channel quality of the paths at each hop. Furthermore, to increase the efficiency, in terms of the desired objectives, we propose a new selective recoding method at the intermediate nodes. We derive bounds on the throughput and the mean and maximum in-order delivery delay of AC-RLNC, both in the multipath and multipath multi-hop case. In the multipath case, we prove that in the non-asymptotic regime, the suggested code may achieve more than 90% of the channel capacity with zero error probability under mean and maximum in-order delay constraints, namely a mean delay smaller than three times the optimal genie-aided one and a maximum delay within eight times the optimum. In the multipath multi-hop case, the balancing procedure is proven to be optimal with regards to the achieved rate. Through simulations, we demonstrate that the performance of our adaptive and causal approach, compared to selective repeat (SR)-ARQ protocol, is capable of gains up to a factor two in throughput and a factor of more than three in mean delay and eight in maximum delay. The improvements on the throughput delay trade-off are also shown to be significant with regards to the previously developed singlepath AC-RLNC solution.en_US
dc.language.isoen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.relation.isversionof10.1109/TCOMM.2020.3034941en_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alikeen_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/4.0/en_US
dc.sourcearXiven_US
dc.titleAdaptive Causal Network Coding with Feedback for Multipath Multi-hop Communicationsen_US
dc.typeArticleen_US
dc.identifier.citationCohen, Alejandro, Thiran, Guillaume, Bracha, Vered Bar and Medard, Muriel. 2020. "Adaptive Causal Network Coding with Feedback for Multipath Multi-hop Communications." IEEE Transactions on Communications, 69 (2).
dc.contributor.departmentMassachusetts Institute of Technology. Research Laboratory of Electronics
dc.relation.journalIEEE Transactions on Communicationsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2022-07-25T13:31:41Z
dspace.orderedauthorsCohen, A; Thiran, G; Bracha, VB; Medard, Men_US
dspace.date.submission2022-07-25T13:31:48Z
mit.journal.volume69en_US
mit.journal.issue2en_US
mit.licenseOPEN_ACCESS_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record