IDEAS home Printed from https://ideas.repec.org/a/sae/intdis/v9y2013i9p376028.html
   My bibliography  Save this article

Throughput-Optimal Scheduling for Cooperative Communications in Wireless Ad Hoc Networks

Author

Listed:
  • Thong Huynh
  • Won-Joo Hwang
  • Suk-Hwan Lee

Abstract

Cooperative communications that take advantage of the broadcasting nature of wireless environments can help to increase system throughput in wireless ad hoc networks. However, the promised throughput might be lost in presence of the error transmission and the interference caused by relay transmission in cooperative communication. In this paper, we introduced the relay selection schemes that can control the interference at the relay to prevent the relay that may harm other pairs. Then, we proposed the throughput-optimal scheduling that takes into account error probability in decision and maximizes throughput, that is, the amount of packets transmitted without error in network. In addition, we derive a simple and lightweight framework to implement the proposed policy in distributed manner. The simulation results show that the proposed scheduling policy outperforms the noncooperative policy and multihop relay policy.

Suggested Citation

  • Thong Huynh & Won-Joo Hwang & Suk-Hwan Lee, 2013. "Throughput-Optimal Scheduling for Cooperative Communications in Wireless Ad Hoc Networks," International Journal of Distributed Sensor Networks, , vol. 9(9), pages 376028-3760, September.
    • Handle: RePEc:sae:intdis:v:9:y:2013:i:9:p:376028
    DOI: 10.1155/2013/376028
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1155/2013/376028
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2013/376028?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:sae:intdis:v:9:y:2013:i:9:p:376028. 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: SAGE Publications (email available below). General contact details of provider: .

    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.