IDEAS home Printed from https://ideas.repec.org/a/plo/pone00/0190622.html
   My bibliography  Save this article

Analysis of channel uncertainty in ARQ relay networks

Author

Listed:
  • Hina Ajmal
  • Aimal Khan
  • Saad Rehman
  • Farhan Hussain
  • Mohammad Alam
  • Rupert Young

Abstract

Several power allocation algorithms for cooperative relay networks are presented in the literature. These contributions assume perfect channel knowledge and capacity achieving codes. However in practice, obtaining the channel state information at a relay or at the destination is an estimation problem and can generally not be error free. The investigation of the power allocation mechanism in a wireless network due to channel imperfections is important because it can severely degrade its performance regarding throughput and bit error rate. In this paper, the impact of imperfect channel state information on the power allocation of an adaptive relay network is investigated. Moreover, a framework including Automatic Repeat reQuest (ARQ) mechanism is provided to make the power allocation mechanism robust against these channel imperfections. For this framework, the end-to-end SNR is calculated considering imperfect channel knowledge using ARQ analytically. The goal is to emphasize the impact of imperfect channel knowledge on the power allocation mechanism. In this paper, the simulation results illustrate the impact of channel uncertainties on the average outage probability, throughput, and consumed sum power for different qualities of channel estimation. It is shown that the presented framework with ARQ is extremely robust against the channel imperfections.

Suggested Citation

  • Hina Ajmal & Aimal Khan & Saad Rehman & Farhan Hussain & Mohammad Alam & Rupert Young, 2018. "Analysis of channel uncertainty in ARQ relay networks," PLOS ONE, Public Library of Science, vol. 13(1), pages 1-21, January.
  • Handle: RePEc:plo:pone00:0190622
    DOI: 10.1371/journal.pone.0190622
    as

    Download full text from publisher

    File URL: https://journals.plos.org/plosone/article?id=10.1371/journal.pone.0190622
    Download Restriction: no

    File URL: https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0190622&type=printable
    Download Restriction: no

    File URL: https://libkey.io/10.1371/journal.pone.0190622?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:plo:pone00:0190622. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: plosone (email available below). General contact details of provider: https://journals.plos.org/plosone/ .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.