FR-CNN: The optimal method for slicing fifth-generation networks through the application of deep learning
Downloads
Published
DOI:
https://doi.org/10.58414/SCIENTIFICTEMPER.2025.16.4.01Keywords:
Faster R-CNN, Deep learning, Network slicing, Deep belief network, Neural network.Dimensions Badge
Issue
Section
License
Copyright (c) 2025 The Scientific Temper

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
The 5G network is expected to accommodate numerous novel use cases originating from vertical businesses in mobile broadband communication service. Higher standards of execution, affordability, security, and board-level adaptability are only a few of the difficult needs brought on by these recently changed conditions. The current organizational strategy of using a one-size-fits-all blueprint is not practicable. An emerging strategy for sustainably meeting these diverse criteria is to split a single physical network into multiple logical networks, each tailored to a unique set of requirements. The authors of this work created a hybrid learning approach to network slicing. Improving weighted feature extraction (OWFE), data collection, and slicing classification are the three processes recommended for this work. A dataset of 5G network slices is used as an initial input. This dataset contains metrics such as bandwidth, duration, modulation type, delay rate, jitter, speed, user device type, packet loss ratio, and packet delay budget. The last step is to use the Faster R-CNN model, which includes the RPN model, to classify the values provided. From this model, one can generate precise network slices like URLLC, mMTC, and eMBB. A change in the configuration of accurate 5G organization slicing would be brought about by the suggested approach, according to the findings of the study.Abstract
How to Cite
Downloads
Similar Articles
- Kinjal K. Patel, Kiran Amin, Predictive modeling of dropout in MOOCs using machine learning techniques , The Scientific Temper: Vol. 15 No. 02 (2024): The Scientific Temper
- S. Munawara Banu, M. Mohamed Surputheen, M. Rajakumar, Enhanced AOMDV-based multipath routing approach for mobile ad-hoc network using ETX and ant colony optimization , The Scientific Temper: Vol. 16 No. 06 (2025): The Scientific Temper
- K. Kalaiselvi, M. Kasthuri, Tuning VGG19 hyperparameters for improved pneumonia classification , The Scientific Temper: Vol. 15 No. 02 (2024): The Scientific Temper
- P. Ananthi, A. Chandrabose, The socio-technical opportunities and threats of crowdsensing , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- Kanthalakshmi S, Nikitha M. S, Pradeepa G, Classification of weld defects using machine vision using convolutional neural network , The Scientific Temper: Vol. 14 No. 01 (2023): The Scientific Temper
- Rajeshwari D, C. Victoria Priscilla, An optimized real-time human detected keyframe extraction algorithm (HDKFE) based on faster R-CNN , The Scientific Temper: Vol. 15 No. 03 (2024): The Scientific Temper
- A. Anand, A. Nisha Jebaseeli, AI-driven real-time performance optimization and comparison of virtual machines and containers in cloud environments , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- A. Jafar Ali, G. Ravi, D.I. George Amalarethinam, AI-Integrated Swarm-Powered Self-Scheduling Routing for Heterogeneous Wireless Sensor Networks to Maximize Network Lifetime , The Scientific Temper: Vol. 16 No. 12 (2025): The Scientific Temper
- S. Hemalatha, N. Vanjulavalli, K. Sujith, R. Surendiran, Chaotic-based optimization, based feature selection with shallow neural network technique for effective identification of intrusion detection , The Scientific Temper: Vol. 15 No. spl-1 (2024): The Scientific Temper
- Ritu Nagila, Abhishek Kumar Mishra, Ashish Nagila, Role of big data in enhancing lung cancer prediction and treatment , The Scientific Temper: Vol. 16 No. 04 (2025): The Scientific Temper
<< < 2 3 4 5 6 7 8 9 10 11 > >>
You may also start an advanced similarity search for this article.

