Evolutionary algorithms in high-dimensional radio access network optimization
Authors: 
Dmitriy Semenchikov, Anna Filippova, Dmitriy Volf, Nikolai Kovrizhnykh, Maxim Mironov, Zou Jinying, Luo Ronghui, Zhu Yuanming, Chai Dapeng, Huang WeiAuthors Info & Claims
Dmitriy Semenchikov, Anna Filippova, Dmitriy Volf, Nikolai Kovrizhnykh, Maxim Mironov, Zou Jinying, Luo Ronghui, Zhu Yuanming, Chai Dapeng, Huang WeiAuthors Info & ClaimsPages 1834 - 1841
Abstract
This article describes the project result of modeling and optimizing Radio Access Network. We have proposed a solution for controlling a large number of antennas in the conditions of engineering constraints and a large search space dimension. For estimating the performance, a virtual environment has been developed, that allows changing the parameters of Radio Access antennas to control the coverage and signal quality for all User Equipments. To optimize the Radio Access network, we have analyzed DE, CMA-ES, MOS, self-adaptive surrogate CMA-ES, lq-CMA-ES, BIPOP CMA-ES, sep-CMA-ES, lm-CMA-ES, HMO-CMA-ES, JADE, PSO, which have been adapted to the constraints of the task. To reduce dimension, graph clustering methods - Spectral clustering, Label propagation, Markov Clustering - are compared in dividing the network into groups. The experiments illustrate the efficiency of optimizing a large Radio Access network by the cluster approach.
References
[1]
Asma Atamna. 2015. Benchmarking IPOP-CMA-ES-TPA and IPOP-CMA-ES-MSR on the BBOB Noiseless Testbed. In Proceedings of the Companion Publication of the 2015 Annual Conference on Genetic and Evolutionary Computation (GECCO Companion '15). Association for Computing Machinery, 1135--1142.
[2]
Ahmad Awada, Bernhard Wegmann, Ingo Viering, and Anja Klein. 2011. Optimizing the Radio Network Parameters of the Long Term Evolution System Using Taguchi's Method. IEEE Transactions on Vehicular Technology 60, 8 (2011), 3825--3839.
[3]
V. Berthier. 2015. Experiments on the CEC 2015 expensive optimization testbed. 2015 IEEE Congress on Evolutionary Computation (CEC) (2015), 1059--1066.
[4]
Pedro M. de Sant Ana and Nikolaj Marchenko. 2020. Radio Access Scheduling using CMA-ES for Optimized QoS in Wireless Networks. In 2020 IEEE Globecom Workshops (GC Wkshps. 1--6.
[5]
V. Gjokaj, J. Doroshewitz, J. Nanzer, and P. Chahal. 2017. A Design Study of 5G Antennas Optimized Using Genetic Algorithms. In 2017 IEEE 67th Electronic Components and Technology Conference (ECTC). 2086--2091.
[6]
Sotirios K. Goudos, Margot Deruyck, David Plets, Luc Martens, Kostas E. Psannis, Panagiotis Sarigiannidis, and Wout Joseph. 2019. A Novel Design Approach for 5G Massive MIMO and NB-IoT Green Networks Using a Hybrid Jaya-Differential Evolution Algorithm. IEEE Access 7 (2019), 105687--105700.
[7]
S. K. Goudos, M. Deruyck, D. Plets, L. Martens, K. E. Psannis, P. Sarigiannidis, and W. Joseph. 2019. A Novel Design Approach for 5G Massive MIMO and NB-IoT Green Networks Using a Hybrid Jaya-Differential Evolution Algorithm. IEEE Access 7 (2019), 105687--105700.
[8]
Nikolaus Hansen. 2009. Benchmarking a BI-Population CMA-ES on the BBOB-2009 Function Testbed. In Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers (GECCO '09). Association for Computing Machinery, 2389--2396.
[9]
Joseph Isabona. 2014. Maximising Coverage and Capacity with QOS Guarantee in GSM Network by Means of Cell Cluster Optimization. International Journal of Advanced Research in Physical Science, ISSN 2349-7874 1 (10 2014), 44--55.
[10]
J. Kennedy and R. C. Eberhart. 1995. Particle swarm optimization. IEEE Int. Conf. Neural Networks (1995), 1942--1948.
[11]
Antonio Latorre, Santiago Muelas, and José Peña. 2013. Evaluating the Multiple Offspring Sampling Framework on Complex Continuous Optimization Functions. Memetic Computing (12 2013).
[12]
Ilya Loshchilov. 2014. A Computationally Efficient Limited Memory CMA-ES for Large Scale Optimization. In Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation (GECCO '14). Association for Computing Machinery, 397--404.
[13]
Ilya Loshchilov and Tobias Glasmachers. 2016. Anytime Bi-Objective Optimization with a Hybrid Multi-Objective CMA-ES (HMO-CMA-ES). In Proceedings of the 2016 on Genetic and Evolutionary Computation Conference Companion (GECCO '16 Companion). Association for Computing Machinery, 1169--1176.
[14]
Ilya Loshchilov, Marc Schoenauer, and Michele Sebag. 2012. Black-Box Optimization Benchmarking of NIPOP-ACMA-ES and NBIPOP-ACMA-ES on the BBOB-2012 Noiseless Testbed. In Proceedings of the 14th Annual Conference Companion on Genetic and Evolutionary Computation (GECCO '12). Association for Computing Machinery, 269--276.
[15]
Ilya Loshchilov, Marc Schoenauer, and Michele Sebag. 2012. Self-Adaptive Surrogate-Assisted Covariance Matrix Adaptation Evolution Strategy. In Proceedings of the 14th Annual Conference on Genetic and Evolutionary Computation (GECCO '12). Association for Computing Machinery, 321--328.
[16]
David Lynch, Takfarinas Saber, Stepan Kucera, Holger Claussen, and Michael O'Neill. 2019. Evolutionary Learning of Link Allocation Algorithms for 5G Heterogeneous Wireless Communications Networks. In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO '19). Association for Computing Machinery, 1258--1265.
[17]
NSNAM. 2019. ns-3 Model Library. Propagation. (2019). Retrieved February 2, 2021 from https://www.nsnam.org/docs/models/html/propagation.html
[18]
B. Partov, D. J. Leith, and R. Razavi. 2015. Utility Fair Optimization of Antenna Tilt Angles in LTE Networks. IEEE/ACM Transactions on Networking 23, 1 (2015), 175--185.
[19]
A. K. Qin, V. L. Huang, and P. N. Suganthan. 2009. Differential Evolution Algorithm With Strategy Adaptation for Global Numerical Optimization. IEEE Transactions on Evolutionary Computation 13, 2 (2009), 398--417.
[20]
Nandini Raghavan, Reka Albert, and Soundar Kumara. 2007. Near Linear Time Algorithm to Detect Community Structures in Large-Scale Networks. Physical review. E, Statistical, nonlinear, and soft matter physics 76 (10 2007), 036106.
[21]
Raymond Ros and Nikolaus Hansen. 2008. A Simple Modification in CMA-ES Achieving Linear Time and Space Complexity. In Proceedings of the 10th International Conference on Parallel Problem Solving from Nature --- PPSN X - Volume 5199. Springer-Verlag, 296--305.
[22]
Siddhartha Shakya, Beum Seuk Lee, and Gilbert Owusu. 2019. Optimizing Field Productivity by Mobile Warehouse Deployment Using Evolutionary Algorithms. In 2019 IEEE Symposium Series on Computational Intelligence (SSCI). 1652--1659.
[23]
Iana Siomina, Peter Varbrand, and Di Yuan. 2006. Automated optimization of service coverage and base station antenna configuration in UMTS networks. IEEE Wireless Communications 13, 6 (2006), 16--25.
[24]
N. Trabelsi, C. S. Chen, R. El Azouzi, L. Roullet, and E. Altman. 2017. User Association and Resource Allocation Optimization in LTE Cellular Networks. IEEE Transactions on Network and Service Management 14, 2 (2017), 429--440.
[25]
P. Korošec U. Škvorc, T. Eftimov. 2019. GECCO Black-Box Optimization Competitions: Progress from 2009 to 2018.
[26]
Stijn van Dongen. 2000. Graph Clustering by Flow Simulation. Ph.D. Dissertation. University of Utrecht, Utrecht, Netherlands.
[27]
U. von Luxburg. 2007. A tutorial on spectral clustering. Statistics and Computing 17 (2007), 395--416.
[28]
J. Zhang and A. C. Sanderson. 2009. JADE: Adaptive Differential Evolution With Optional External Archive. IEEE Transactions on Evolutionary Computation 13, 5 (2009), 945--958.
- Evolutionary algorithms in high-dimensional radio access network optimization
Recommendations
To explore or to exploit: An entropy-driven approach for evolutionary algorithms
An evolutionary algorithm is an optimization process comprising two important aspects: exploration discovers potential offspring in new search regions; and exploitation utilizes promising solutions already identified. Intelligent balance between these ...
An analysis on recombination in multi-objective evolutionary optimization
Evolutionary algorithms (EAs) are increasingly popular approaches to multi-objective optimization. One of their significant advantages is that they can directly optimize the Pareto front by evolving a population of solutions, where the recombination (...
Genetic diversity as an objective in multi-objective evolutionary algorithms
A key feature of an efficient and reliable multi-objective evolutionary algorithm is the ability to maintain genetic diversity within a population of solutions. In this paper, we present a new diversity-preserving mechanism, the Genetic Diversity ...
Comments
Information & Contributors
Information
Published In
July 2021
2047 pages
Copyright © 2021 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 08 July 2021
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
GECCO '21
Sponsor:
Acceptance Rates
Overall Acceptance Rate 1,669 of 4,410 submissions, 38%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 83Total Downloads
- Downloads (Last 12 months)7
- Downloads (Last 6 weeks)1
Reflects downloads up to 11 Jan 2025
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in