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

Autonomous and adaptive congestion control for machine-type communication in cellular network

Author

Listed:
  • Qi Pan
  • Xiangming Wen
  • Zhaoming Lu
  • Wenpeng Jing
  • Haijun Zhang

Abstract

Machine-type communications have suffered serious congestion, overload, and poor quality of service problems in cellular networks, since the cellular networks are designed for human-to-human communications. Moreover, current solutions just focus on the congestion for single base station and cannot adaptively work in the dynamic and complex conditions. In this article, we provide an autonomous and adaptive attractor-selection-based congestion control scheme for massive access from machine-type communication devices based on the resource separation scheme. First, we introduce a feasible and self-adaptive extended attractor-selection mechanism to decide which base station to be chosen. Simultaneously, an effective estimation algorithm for the traffic load of base stations is also designed to represent the network traffic load without frequent information exchanges among devices or base stations. With the available access resources and estimated traffic load taken into consideration, massive access attempts can receive the decisions via the broadcast and adaptively choose proper stations for alleviation of the congestion and overload. Finally, simulation results show that the proposed attractor-selection-based congestion control scheme achieves better performance in terms of average access delay, collision probability, and throughput of the whole system, adaptively accommodating to unpredictable environments under cellular networks.

Suggested Citation

  • Qi Pan & Xiangming Wen & Zhaoming Lu & Wenpeng Jing & Haijun Zhang, 2019. "Autonomous and adaptive congestion control for machine-type communication in cellular network," International Journal of Distributed Sensor Networks, , vol. 15(4), pages 15501477198, April.
  • Handle: RePEc:sae:intdis:v:15:y:2019:i:4:p:1550147719841869
    DOI: 10.1177/1550147719841869
    as

    Download full text from publisher

    File URL: https://journals.sagepub.com/doi/10.1177/1550147719841869
    Download Restriction: no

    File URL: https://libkey.io/10.1177/1550147719841869?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
    ---><---

    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:15:y:2019:i:4:p:1550147719841869. 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.