Open AccessOpen Access


Resource Allocation Based on SFLA Algorithm for D2D Multicast Communications

Wisam Hayder Mahdi1,*, Necmi Taşpınar2

1 University of Diyala, Department of Communications Engineering, Diyala, Baquba, 32001, Iraq
2 Erciyes University, Department of Electrical and Electronics Engineering, Kayseri, 38039, Turkey

* Corresponding Author: Wisam Hayder Mahdi. Email:

Computer Systems Science and Engineering 2023, 45(2), 1517-1530.


Multicast device-to-device (D2D) communication technology is considered as one of the new technologies in the fifth generation (5G) networks that directly addresses the need for content sharing among internet users. In fact, when direct communication is available between devices, the spectral efficiency is improved by reusing the licensed cellular spectrum. The current studies show that D2D communication increases network capacity and reduces latency. In order to achieve the alternate capabilities, coordination is required to implement interference management. We considered subcarrier allocation for the uplink, in addition to the power control that takes place on the underlay network. The completed data rate in single multicast communication is significantly reduced and limited by nodes with lower channel quality. In this paper, we used Shuffled Frog Leaping Algorithm (SFLA) for resource allocation (RA) in D2D multicast communications. We compared the results of the SFLA algorithm with the Firefly Algorithm (FA), Ant Colony Optimization (ACO) and Particle Swarm Optimization (PSO); in terms of D2D user throughput, Cellular User (CU) throughput, network average throughput, network interference and signal interference noise ratio (SINR) target. The simulation results show that SFLA clearly outperforms other algorithms in terms of data rate under the high pressure of infeasibility.


Cite This Article

W. H. Mahdi and N. Taşpınar, "Resource allocation based on sfla algorithm for d2d multicast communications," Computer Systems Science and Engineering, vol. 45, no.2, pp. 1517–1530, 2023.

This work is licensed under a Creative Commons Attribution 4.0 International License , which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
  • 269


  • 136


  • 0


Share Link

WeChat scan