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

Ultrahigh-Dimensional Model and Optimization Algorithm for Resource Allocation in Large-Scale Intelligent D2D Communication System

Author

Listed:
  • Minxin Liang
  • Jiandong Liu
  • Jinrui Tang
  • Ruoli Tang
  • Chen Wang

Abstract

The optimal resource allocation in the large-scale intelligent device-to-device (D2D) communication system is of great importance for improving system spectrum efficiency and ensuring communication quality. In this study, the D2D resource allocation is modelled as an ultrahigh-dimensional optimization (UHDO) problem with thousands of binary dimensionalities. Then, for efficiently optimizing this UHDO problem, the coupling relationships among those dimensionalities are comprehensively analysed, and several efficient variable-grouping strategies are developed, i.e., cellular user grouping (CU-grouping), D2D pair grouping (DP-grouping), and random grouping (R-grouping). In addition, a novel evolutionary algorithm called the cooperatively coevolving particle swarm optimization with variable-grouping (VGCC-PSO) is developed, in which a novel mutation operation is introduced for ensuring fast satisfaction of constraints. Finally, the proposed UHDO-based allocation model and VGCC-PSO algorithm as well as the grouping and mutation strategies are verified by a comprehensive set of case studies. Simulation results show that the developed VGCC-PSO algorithm performs the best in optimizing the UHDO model with up to 6000 dimensionalities. According to our study, the proposed methodology can effectively overcome the “curse of dimensionality†and optimally allocate the resources with high accuracy and robustness.

Suggested Citation

  • Minxin Liang & Jiandong Liu & Jinrui Tang & Ruoli Tang & Chen Wang, 2021. "Ultrahigh-Dimensional Model and Optimization Algorithm for Resource Allocation in Large-Scale Intelligent D2D Communication System," Complexity, Hindawi, vol. 2021, pages 1-10, August.
  • Handle: RePEc:hin:complx:7321719
    DOI: 10.1155/2021/7321719
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/complexity/2021/7321719.pdf
    Download Restriction: no

    File URL: http://downloads.hindawi.com/journals/complexity/2021/7321719.xml
    Download Restriction: no

    File URL: https://libkey.io/10.1155/2021/7321719?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:complx:7321719. 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.