By performing the encoding operation on several message packets, rateless coding in cooperative networks has the potential risk of processing information already available to the receivers. In this paper, the intermediate packet decodability of rateless codes is exploited to mitigate such redundant packet processing at the cooperating nodes. The message packets that are already decoded at the receivers are eliminated from further processing by harnessing the back channel (from receiver to transmitter) for feedback. This reduces the required number of transmissions and optimizes the throughput of the network.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Ashish JAMES, A.S. MADHUKUMAR, Fumiyuki ADACHI, "Throughput Optimization in Rateless Coded Cooperative Relay Networks" in IEICE TRANSACTIONS on Communications,
vol. E95-B, no. 5, pp. 1810-1814, May 2012, doi: 10.1587/transcom.E95.B.1810.
Abstract: By performing the encoding operation on several message packets, rateless coding in cooperative networks has the potential risk of processing information already available to the receivers. In this paper, the intermediate packet decodability of rateless codes is exploited to mitigate such redundant packet processing at the cooperating nodes. The message packets that are already decoded at the receivers are eliminated from further processing by harnessing the back channel (from receiver to transmitter) for feedback. This reduces the required number of transmissions and optimizes the throughput of the network.
URL: https://globals.ieice.org/en_transactions/communications/10.1587/transcom.E95.B.1810/_p
Copy
@ARTICLE{e95-b_5_1810,
author={Ashish JAMES, A.S. MADHUKUMAR, Fumiyuki ADACHI, },
journal={IEICE TRANSACTIONS on Communications},
title={Throughput Optimization in Rateless Coded Cooperative Relay Networks},
year={2012},
volume={E95-B},
number={5},
pages={1810-1814},
abstract={By performing the encoding operation on several message packets, rateless coding in cooperative networks has the potential risk of processing information already available to the receivers. In this paper, the intermediate packet decodability of rateless codes is exploited to mitigate such redundant packet processing at the cooperating nodes. The message packets that are already decoded at the receivers are eliminated from further processing by harnessing the back channel (from receiver to transmitter) for feedback. This reduces the required number of transmissions and optimizes the throughput of the network.},
keywords={},
doi={10.1587/transcom.E95.B.1810},
ISSN={1745-1345},
month={May},}
Copy
TY - JOUR
TI - Throughput Optimization in Rateless Coded Cooperative Relay Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 1810
EP - 1814
AU - Ashish JAMES
AU - A.S. MADHUKUMAR
AU - Fumiyuki ADACHI
PY - 2012
DO - 10.1587/transcom.E95.B.1810
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E95-B
IS - 5
JA - IEICE TRANSACTIONS on Communications
Y1 - May 2012
AB - By performing the encoding operation on several message packets, rateless coding in cooperative networks has the potential risk of processing information already available to the receivers. In this paper, the intermediate packet decodability of rateless codes is exploited to mitigate such redundant packet processing at the cooperating nodes. The message packets that are already decoded at the receivers are eliminated from further processing by harnessing the back channel (from receiver to transmitter) for feedback. This reduces the required number of transmissions and optimizes the throughput of the network.
ER -