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

MABC: Power-Based Location Planning with a Modified ABC Algorithm for 5G Networks

Author

Listed:
  • Ruchi Sachan
  • Zahid Muhammad
  • Jaehoon (Paul) Jeong
  • Chang Wook Ahn
  • Hee Yong Youn

Abstract

The modernization of smart devices has emerged in exponential growth in data traffic for a high-capacity wireless network. 5G networks must be capable of handling the excessive stress associated with resource allocation methods for its successful deployment. We also need to take care of the problem of causing energy consumption during the dense deployment process. The dense deployment results in severe power consumption because of fulfilling the demands of the increasing traffic load accommodated by base stations. This paper proposes an improved Artificial Bee Colony (ABC) algorithm which uses the set of variables such as the transmission power and location of each base station (BS) to improve the accuracy of localization of a user equipment (UE) for the efficient energy consumption at BSes. To estimate the optimal configuration of BSes and reduce the power requirement of connected UEs, we enhanced the ABC algorithm, which is named a Modified ABC (MABC) algorithm, and compared it with the latest work on Real-Coded Genetic Algorithm (RCGA) and Differential Evolution (DE) algorithm. The proposed algorithm not only determines the optimal coverage of underutilized BSes but also optimizes the power utilization considering the green networks. The performance comparisons of the modified algorithms were conducted to show that the proposed approach has better effectiveness than the legacy algorithms, ABC, RCGA, and DE.

Suggested Citation

  • Ruchi Sachan & Zahid Muhammad & Jaehoon (Paul) Jeong & Chang Wook Ahn & Hee Yong Youn, 2017. "MABC: Power-Based Location Planning with a Modified ABC Algorithm for 5G Networks," Discrete Dynamics in Nature and Society, Hindawi, vol. 2017, pages 1-13, July.
  • Handle: RePEc:hin:jnddns:4353612
    DOI: 10.1155/2017/4353612
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/DDNS/2017/4353612.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/DDNS/2017/4353612.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2017/4353612?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:jnddns:4353612. 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.