• DocumentCode
    2092496
  • Title

    Rate-adaptive HARQ in relay-based cooperative transmission

  • Author

    Khosravirad, Saeed R. ; Szczecinski, Leszek ; Labeau, Fabrice

  • Author_Institution
    Dept. of Electr. & Comput. Eng., McGill Univ., Montreal, QC, Canada
  • fYear
    2013
  • fDate
    9-13 June 2013
  • Firstpage
    5328
  • Lastpage
    5333
  • Abstract
    In this paper we analyze the maximum achievable throughput of Hybrid ARQ (HARQ) protocol for transmission over cooperative block-fading channels. It is assumed that the instantaneous channel state information (CSI) is not available at the encoders and only its outdated version is available via the error-free feedback channel. The outdated CSI is then used to adapt the transmission rate of all cooperating nodes. Considering source-relay-destination scenario, we use Dynamic Programming (DP) to find the optimal rate adaptation policy for both the Source node and the Relay node. Such an approach yields a significant increase in throughput compared to non-adaptive fixed-rate HARQ. Moreover, the maximum achievable throughput is shown for the cooperative HARQ channel which is applicable to both adaptive and non-adaptive models.
  • Keywords
    automatic repeat request; cooperative communication; dynamic programming; fading channels; relay networks (telecommunication); DP; cooperating nodes; cooperative HARQ channel; cooperative block-fading channels; dynamic programming; encoders; error-free feedback channel; hybrid ARQ protocol; instantaneous CSI; instantaneous channel state information; maximum achievable throughput; nonadaptive fixed-rate HARQ; optimal rate adaptation policy; outdated CSI; rate-adaptive HARQ; relay node; relay-based cooperative transmission; source node; source-relay-destination scenario; transmission rate; Decision support systems; Niobium; Wireless communication;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications (ICC), 2013 IEEE International Conference on
  • Conference_Location
    Budapest
  • ISSN
    1550-3607
  • Type

    conf

  • DOI
    10.1109/ICC.2013.6655434
  • Filename
    6655434