IDEAS home Printed from https://ideas.repec.org/a/wly/intnem/v32y2022i1ne2178.html
   My bibliography  Save this article

An optimization‐based congestion control for constrained application protocol

Author

Listed:
  • Godfrey A. Akpakwu
  • Gerhard P. Hancke
  • Adnan M. Abu‐Mahfouz

Abstract

The Constrained Application Protocol (CoAP) is a lightweight web transfer protocol designed based on the REST architecture standardized by the Internet Engineering Task Force (IETF) to meet and accommodate the requirements of the constrained Internet of Things (IoT) environments. Managing congestion control in a resource‐constrained lossy network with a high bit error rate is a significantly challenging task that needs to be addressed. The primary congestion control mechanism defined by CoAP specification leverages on basic binary exponential backoff and often fails to utilize the network dynamics to the best of its traffic conditions. As a result, CoCoA has been introduced for better IoT resource utilization. In addition, CoCoA retransmission timeout (RTO) for network dynamics is based on constant coefficient values. The resource‐constrained nature of IoT networks poses new design challenges for congestion control mechanisms. In this paper, we propose a new particle swarm optimization (PSO)‐based congestion control approach called psoCoCoA as a variation of CoCoA. The psoCoCoA applies random and optimal parameter‐driven simulation to optimize default CoAP parameters and update the fitness and velocity positions to adapt to the traffic conditions. This process is performed for different traffic scenarios by varying the retransmission and max‐age values by using the optimization‐based algorithm. We carried out extensive simulations to validate the congestion control performance for CoAP with Observe, CoCoA, and psoCoCoA with different network topologies. The results indicate that psoCoCA outperforms or very similar to CoCoA and achieves better performance compared to CoAP with Observe under different network scenarios.

Suggested Citation

  • Godfrey A. Akpakwu & Gerhard P. Hancke & Adnan M. Abu‐Mahfouz, 2022. "An optimization‐based congestion control for constrained application protocol," International Journal of Network Management, John Wiley & Sons, vol. 32(1), January.
  • Handle: RePEc:wly:intnem:v:32:y:2022:i:1:n:e2178
    DOI: 10.1002/nem.2178
    as

    Download full text from publisher

    File URL: https://doi.org/10.1002/nem.2178
    Download Restriction: no

    File URL: https://libkey.io/10.1002/nem.2178?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:wly:intnem:v:32:y:2022:i:1:n:e2178. 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: Wiley Content Delivery (email available below). General contact details of provider: https://doi.org/10.1002/(ISSN)1099-1190 .

    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.