Open Access iconOpen Access

ARTICLE

Novel Path Counting-Based Method for Fractal Dimension Estimation of the Ultra-Dense Networks

Farid Nahli11, Alexander Paramonov1, Naglaa F. Soliman2, Hussah Nasser AlEisa3,*, Reem Alkanhel2, Ammar Muthanna1, Abdelhamied A. Ateya4

1 Department of Telecommunication Networks and Data Transmission, The Bonch-Bruevich Saint-Petersburg State University of Telecommunications, Saint Petersburg, 193232, Russia
2 Department of Information Technology, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, Riyadh, 84428, Saudi Arabia
3 Department of Computer Sciences, College of Computer and Information Sciences, Princess Nourah bint Abdulrahman University, Riyadh, 84428, Saudi Arabia
4 Department of Electronics and Communications Engineering, Zagazig University, Zagazig, 44519, Sharqia, Egypt

* Corresponding Author: Hussah Nasser AlEisa. Email: email

Intelligent Automation & Soft Computing 2023, 36(1), 561-572. https://doi.org/10.32604/iasc.2023.031299

Abstract

Next-generation networks, including the Internet of Things (IoT), fifth-generation cellular systems (5G), and sixth-generation cellular systems (6G), suffer from the dramatic increase of the number of deployed devices. This puts high constraints and challenges on the design of such networks. Structural changing of the network is one of such challenges that affect the network performance, including the required quality of service (QoS). The fractal dimension (FD) is considered one of the main indicators used to represent the structure of the communication network. To this end, this work analyzes the FD of the network and its use for telecommunication networks investigation and planning. The cluster growing method for assessing the FD is introduced and analyzed. The article proposes a novel method for estimating the FD of a communication network, based on assessing the network’s connectivity, by searching for the shortest routes. Unlike the cluster growing method, the proposed method does not require multiple iterations, which reduces the number of calculations, and increases the stability of the results obtained. Thus, the proposed method requires less computational cost than the cluster growing method and achieves higher stability. The method is quite simple to implement and can be used in the tasks of research and planning of modern and promising communication networks. The developed method is evaluated for two different network structures and compared with the cluster growing method. Results validate the developed method.

Keywords


Cite This Article

F. Nahli1, A. Paramonov, N. F. Soliman, H. N. AlEisa, R. Alkanhel et al., "Novel path counting-based method for fractal dimension estimation of the ultra-dense networks," Intelligent Automation & Soft Computing, vol. 36, no.1, pp. 561–572, 2023. https://doi.org/10.32604/iasc.2023.031299



cc 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.
  • 636

    View

  • 495

    Download

  • 0

    Like

Share Link