IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/5583570.html
   My bibliography  Save this article

IMPSO and Linear Programming-Based Energy-Efficient Cell Association Algorithm for Backhaul-Constrained Ultra-Dense Small-Cell Networks

Author

Listed:
  • Huilin Jiang
  • Wenxiang Zhu
  • Xiang Song
  • Guilu Wu

Abstract

This paper studies the energy efficiency optimization problem for coordinated multipoint (CoMP)-enabled and backhaul-constrained ultra-dense small-cell networks (UDNs). Energy efficiency is an eternal topic for future wireless communication networks; however, taking actual bottleneck of the backhaul link and the coordinated network architecture into consideration, it is difficult to find an effective way to improve the energy efficiency of the network. Aiming at this problem, we propose to combine cell association, subchannel allocation, backhaul resource allocation, and sleep/on of the cells together to develop an optimization algorithm for energy efficiency in UDN and then solve the formulated energy efficiency optimization problem by means of improved modified particle swarm optimization (IMPSO) and linear programming in mathematics. Simulation results indicate that nearly 13 energy cost saving and 21 energy efficiency improvement can be obtained by combining IMPSO with linear programming, and the backhaul link data rate can be improved by 30 as the number of small cells increases. From the results, it can be found that by combining IMPSO with linear programming, the proposed algorithm can improve the network energy efficiency effectively at the expense of limited complexity.

Suggested Citation

  • Huilin Jiang & Wenxiang Zhu & Xiang Song & Guilu Wu, 2021. "IMPSO and Linear Programming-Based Energy-Efficient Cell Association Algorithm for Backhaul-Constrained Ultra-Dense Small-Cell Networks," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-14, November.
  • Handle: RePEc:hin:jnlmpe:5583570
    DOI: 10.1155/2021/5583570
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/5583570.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/MPE/2021/5583570.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/5583570?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:hin:jnlmpe:5583570. 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: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    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.