Loading article...
Loading article...
Stream/Area:
-
Subject:
-
Paper ID:
10.55041/IJSREM15040
Volume:
6 |
6 |
Jun 2022
Pages:
Publication Frequency:
Monthly (12 issues per year)
License:International Journal of Scientific Research in Engineering and Management follows the Creative Commons Attribution 4.0 (CC BY 4.0) License, allowing free use and distribution with proper attribution.
RAN slicing is a virtualization technique that separates a radio access network’s radio resources into a number of independent virtual networks. Next-generation (5G) systems have long hoped for high-throughput and low-latency communications due to the customizability of RAN slicing to match specific performance requirements. Radio resources must be divided so that numerous base stations may work together to increase throughput; and (ii) interference across various slices must be reduced to ensure each slice is isolated and the network does not slow down. For the purpose of this study, we are looking for algorithms that can satisfy both of these requirements. As a starting point, we discus that this quadratic-proportional programming issue may be conceived of as an NP-hard problem. We’ve come up with a perfect solution for small-scale 5G network installations. To ensure that our algorithms are working correctly, we perform simulations. Then, using a standard-compliant LTE testbed comprised of two base stations and six smartphones, we discus how well they perform in real life. Our techniques not only effectively split RAN resources, but they also boost network speed by 27% and the signal-to-noise ratio by 2x..
KEYWORDS
Publication Date
6/24/2022
Peer Review Type
Double-Blind Peer Review
Review Rounds: 2
Documents
Article Views
0
Total views since publication
PDF Downloads
0
Total downloads since publication
Geographic Reach
5
Digital Preservation: This article is permanently archived on Zenodo and complies with all data preservation standards across major indexing platforms.
Plagiarism Screening
This manuscript has been checked for plagiarism using TurnitinPlagiarismChecker software.
Conflict of Interest
The authors declare no conflict of interest related to this research work.
Funding Information
No funding information available for this research.
Related research in the same subject area
Loading similar articles...