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

Joint congestion and contention avoidance in a scalable QoS-aware opportunistic routing in wireless ad-hoc networks

Author

Listed:
  • Ali Parsa
  • Neda Moghim
  • Sasan Haghani

Abstract

Opportunistic routing (OR) can greatly increase transmission reliability and network throughput in wireless ad-hoc networks by taking advantage of the broadcast nature of the wireless medium. However, network congestion is a barrier in the way of OR’s performance improvement, and network congestion control is a challenge in OR algorithms, because only the pure physical channel conditions of the links are considered in forwarding decisions. This paper proposes a new method to control network congestion in OR, considering three types of parameters, namely, the backlogged traffic, the traffic flows’ Quality of Service (QoS) level, and the channel occupancy rate. Simulation results show that the proposed algorithm outperforms the state-of-the-art algorithms in the context of OR congestion control in terms of average throughput, end-to-end delay, and Packet Delivery Ratio (PDR). Due to the higher PDR at different traffic loads and different node densities, it can be concluded that the proposed algorithm also improves network scalability, which is very desirable given the recent changes in wireless networks.

Suggested Citation

  • Ali Parsa & Neda Moghim & Sasan Haghani, 2023. "Joint congestion and contention avoidance in a scalable QoS-aware opportunistic routing in wireless ad-hoc networks," PLOS ONE, Public Library of Science, vol. 18(8), pages 1-27, August.
  • Handle: RePEc:plo:pone00:0288955
    DOI: 10.1371/journal.pone.0288955
    as

    Download full text from publisher

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

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

    File URL: https://libkey.io/10.1371/journal.pone.0288955?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:0288955. 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.