Binary Particle Swarm Optimization for Fair User Association in Network Slicing-Enabled Heterogeneous O-RANs Manuscript Received: 18 January 2024, Accepted: 21 February 2024, Published: 15 September 2024, ORCiD: 0000-0002-6285-9481, https://doi.org/10.33093/jetap.2024.6.2.3
Main Article Content
Abstract
The Open-Radio Access Network (O-RAN) alliance is leading the evolution of telecommunications towards a greater intelligence, openness, virtualization, and interoperability within mobile networks. The O-RAN standard incorporates of many components the Open-Central Unit (O-CU) and Open-Distributed Unit (O-DU), network slicing and heterogeneous base stations (BS). Together, these innovations have given rise to a three-tiered user association (UA) relationship in a type of network called heterogeneous network (HetNet) with network slicing-enabled. There is an absence of efficient UA schemes for achieving fair resource allocation in such network scenario. Hence, this study formulates the fairness-aware UA problem as a utility-based combinatorial optimization problem, which is computationally hard to solve. Hence, an efficient Binary Particle Swarm Optimization (BPSO)-based UA scheme is proposed to solve the problem. Through simulations of an O-RAN based HetNet with network slicing-enabled, performance of the proposed BPSO-UA scheme is compared against two other baseline UA schemes. Results demonstrate the effectiveness of the proposed BPSO-UA scheme in achieving high fairness through equitable network slicing resource allocation, thereby leading to higher user connectivity rate and comparable average spectral efficiency. This innovative approach sheds light on the potential of metaheuristic algorithms in tackling intricate UA challenges, offering valuable insights for the future design and optimization of mobile networks.
Article Details
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
References
O-RAN WG4, “O-RAN Fronthaul Control, User and Synchronization Plane Specification v07.02,” 2022.
Y. L. Lee, T. C. Chuah, J. Loo and A. Vinel, “Recent Advances in Radio Resource Management for Heterogeneous LTE/LTE-A Networks,” IEEE Commun. Surv. and Tut., vol. 16, no. 4, pp. 2142–2180, 2014.
3GPP TS Group, “5G; Management and Orchestration; Concepts, Use Cases and Requirements,” ETSI TS 128 530 V17.2.0 (2022-05), 2022.
E. Hossain, M. Rasti, H. Tabassum and A. Abdelnasser, “Evolution Toward 5G Multi-Tier Cellular Wireless Networks: An Interference Management Perspective,” IEEE Trans. Wirel. Commun., vol. 21, no. 3, pp. 118–127, 2014.
A. Khandekar, N. Bhushan, J. Tingfang, and V. Vanghi, “LTE-Advanced: Heterogeneous Networks,” in 2010 Europ. Wirel. Conf., pp. 978–982, 2010.
H. Pervaiz, L. Musavian and Q. Ni, “Joint User association and Energy-Efficient Resource Allocation with Minimum-Rate Constraints in Two-Tier HetNets,” in IEEE Int. Symp. Person., Indoor and Mobile Radio Commun., pp. 1634–1639, 2013.
Q. Ye, B. Rong, Y. Chen, M. Al-Shalash, C. Caramanis and J. G. Andrews, “User Association for Load Balancing in Heterogeneous Cellular Networks,” IEEE Trans. Wirel. Commun., vol. 12, no. 6, pp. 2706–2716, 2013.
A. Mesodiakaki, F. Adelantado, L. Alonso and C. Verikoukis, “Energy-Efficient Context-Aware User Association for Outdoor Small Cell Heterogeneous Networks,” in 2014 IEEE Int. Conf. Commun., pp. 1614–1619, 2014.
W. K. Lai and J. K. Liu, “Cell Selection and Resource Allocation in LTE Advanced Heterogeneous Networks,” IEEE Access, vol. 6, pp. 72978-72991, 2018.
N. Zhao, Y.-C. Liang, D. Niyato, Y. Pei, M. Wu and Y. Jiang, “Deep Reinforcement Learning for User Association and Resource Allocation in Heterogeneous Cellular Networks,” IEEE Trans. Wirel. Commun., vol. 18, no. 11, pp. 5141-5152, 2019.
Y. Zhang, L. Xiong and J. Yu, “Deep Learning Based User Association in Heterogeneous Wireless Networks,” IEEE Access, vol. 8, pp. 197439-197447, 2020.
M. Amine, A. Kobbane and J. Ben-Othman, "New Network Slicing Scheme for UE Association Solution in 5G Ultra Dense HetNets," in 2020 IEEE Int. Conf. Commun., Dublin, pp. 1-6, 2020.
Y. Ye, T. Zhang and L. Yang, “Joint User Association and Resource Allocation for Load Balancing in RAN Slicing,” Phys. Commun., vol. 49, no. 101459, pp. 1-12, 2021.
S. S. Jayanthi, Y. L. Lee and Y. C. Chang, “User Association for Multi-Tenant Heterogeneous Network Slicing Using Genetic Algorithm,” in 8th Int. Conf. Comp. and Commun. Eng., Kuala Lumpur, pp. 326-330, 2021.
R. Joda, T. Pamuklu, P. E. Iturria-Rivera and M. Erol-Kantarci, "Deep Reinforcement Learning-Based Joint User Association and CU–DU Placement in O-RAN," IEEE Trans. Netw. and Serv. Manag., vol. 19, no. 4, pp. 4097-4110, 2022.
F. Nizam, T. C. Chuah and Y. L. Lee, “User Association for Network Slicing-Enabled Heterogeneous Hybrid Wireless-Wireline Access Networks,” in Int. Conf. Cyber Manag. and Eng., Bangkok, 2023.
A. P. Engelbrecht, Computational Intelligence An Introduction, Second Edi., John Wiley & Sons, 2007.
J. Kennedy and R. C. Eberhart, “A Discrete Binary Version of the Particle Swarm Algorithm,” in IEEE Int. Conf. Sys., Man, and Cybern.., Computat. Cybern. and Simul., pp. 4–8, 1997.
J. Mo and J. Walrand, “Fair End-to-end Window-based Congestion Control,” IEEE/ACM Trans. Netw., vol. 8, no. 5, pp. 556–567, 2000.
R. C. Eberhart and Y. Shi, "Comparing Inertia Weights and Constriction Factors in Particle Swarm Optimization," in 2000 Congr. Evolut. Computat. CEC00 (Cat. No.00TH8512), La Jolla, vol. 1, pp. 84-88, 2000.
A. P. Piotrowski, J. J., Napiorwski and A. E. Piotrowska, “Population size in Particle Swarm Optimization,” Swarm and Evolut. Computat., vol. 58, no. 100718, pp. 1 – 18, 2020.