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

作　　者：Farid Nahli Alexander Paramonov Naglaa F.Soliman Hussah Nasser AlEisa Reem Alkanhel Ammar Muthanna Abdelhamied A.Ateya 

机构地区：[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

出　　处：《Intelligent Automation & Soft Computing》2023年第4期561-572,共12页智能自动化与软计算（英文）

基　　金：supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R66),Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.

摘　　要：Next-generation networks,including the Internet of Things(IoT),fifth-generation cellular systems(5G),and sixth-generation cellular systems(6G),suf-fer 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,includ-ing the required quality of service(QoS).The fractal dimension(FD)is consid-ered 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 clus-ter 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 compu-tational 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.

关 键 词：Cluster growing CONNECTIVITY dense networks fractal dimension network structure shortest route quality of service 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]