Author
Listed:
- Kun Song
(China Mobile Group Guangdong Co., Ltd., Guangzhou 510623, China
Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China)
- Hanxiao Jiang
(Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China
Institute of Data and Information, Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China)
- Jining Liu
(China Mobile Group Guangdong Co., Ltd., Guangzhou 510623, China)
- Wai Kin (Victor) Chan
(Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China
Institute of Data and Information, Tsinghua Shenzhen International Graduate School, Tsinghua University, Shenzhen 518055, China)
Abstract
Network slicing in 5G systems enables different Quality of Service (QoS) for heterogeneous Vehicle-to-Everything (V2X) applications, yet efficiently allocating resource blocks from both 5G base stations and roadside units (RSUs) across multiple slices remains challenging. Existing approaches either pre-assign users to slices or rely on population-based metaheuristic algorithms that cannot guarantee deterministic real-time performance within the stringent 20 ms latency requirements of vehicular networks. This study formulates the resource allocation problem as an integer programming model that jointly optimizes slice selection and resource allocation to maximize weighted system transmission rate while satisfying heterogeneous QoS constraints. We develop a constructive heuristic algorithm that employs a hierarchical allocation strategy prioritizing 5G resources before RSU resources, coupled with a backfilling mechanism to exploit the remaining resource block capacity. Numerical experiments across abundant 5G and limited resource scenarios demonstrate the algorithm’s effectiveness. First, comparing against Random baseline validates the optimization model’s value, achieving 21.4–24.9% higher weighted throughput in an abundant 5G scenario and 42.5–51.0% improvement under a limited resource scenario. Second, performance evaluation with 500 users shows the proposed constructive heuristic achieves optimal solutions in abundant 5G resource scenarios and 3.5–5.7% optimality gaps in limited resource scenarios, while maintaining an execution time of under 20 ms, which satisfies real-time requirements and executes faster than Gurobi, Simulated Annealing and Round-Robin. Third, scalability analyses across 400–700 users demonstrate favorable performance scaling, as the optimality gap decreases from 5.3% to 3.4% with execution times consistently below 20 ms. The proposed heuristic achieves the highest service admission count while maintaining near-optimal system weighted transmission rate performance, ranking second only to Gurobi solver. Compared with other baseline algorithms, the proposed heuristic delivers a superior balance between solution quality and computational efficiency, confirming its real-time feasibility for large-scale V2X network deployments.
Suggested Citation
Kun Song & Hanxiao Jiang & Jining Liu & Wai Kin (Victor) Chan, 2025.
"Resource Allocation for Network Slicing in 5G/RSU Integrated Networks with Multi-User and Multi-QoS Services,"
Mathematics, MDPI, vol. 14(1), pages 1-30, December.
Handle:
RePEc:gam:jmathe:v:14:y:2025:i:1:p:159-:d:1830396
Download full text from publisher
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:14:y:2025:i:1:p:159-:d:1830396. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.