1 Introduction
The cellular network load depends on the amount of traffic transmitted to each client and is determined by spatial distribution of the users. The density of users and user terminals (UEs) changes in time and depends e.g. on the popularity of different locations or urban traffic patterns. To adjust the possible network throughput to users’ demand, cellular operators build heterogeneous network (HetNet) with variable cell sizes. The introduction of small cells in 4G and 5G systems allows to adapt the network topology to the demand for bandwidth in a given location. Installation of small cells is an enabler in reaching the IMT 2020 goals to increase the throughput of the network by 1000 times. The cost of a single cell decreases thanks to the development of lowcost small base stations, what allows to install them in multiple locations showing high traffic demand, leading to higher spatial reuse of the available frequencies. As a result, the throughput available to clients on a cell area, represented in the Area Traffic Capacity metric itu20202083 is increased in areas with multiple small cells. The cellular network is subject of constant changes, when new cells are added in the locations where the demand bandwidth grows.
The traditional model of radio planning relies on RF engineers to carry out measurement, RF surveys, and drive tests to determine the transmit power (TX power), antenna azimuth, and tilt. In particular, the TX power has very high influence on the intercell interferences and on the network coverageliu2019time , because the LTE and 5G use the same frequencies in all cells. During the lifetime of the network these parameters need to be adapted e.g. when a new cell is added in the nearby location. For a network consisting of large number of small cells this is not feasible, as the cost of the RF planning and reconfigurations may be a significant part of operational costs. Moreover, the modern cellular networks become more dynamic, with new base stations added to the network in response to increased load to maximize the resource reuse. The deployment of small cells is partially unplanned and makes the network topology irregular and hard to manage. The small cells may be flexibly turned on or off according to traffic requirements or new nomadic eNodeB may be installed, which makes the topology of the network more dynamic. As the complexity of the networks grows and the changes are frequent, it becomes very difficult for the operator to manually adjust the configuration of the base stations to minimize the intercell interferences, and maximize the throughput offered to the clients.
The RF planning is hard to implement in the nomadic base station use case, when a new cell, or a small set of cells is added to the network to serve temporary traffic increase e.g. in response to natural disaster or during sport events. The small cells can be deployed within hours, but the network configuration must be adapted to limit the transmission power of the adjacent eNodeBs. The automation of the configuration of the eNodeB has been standardized by the 3GPP as an element of the Coverage and Capacity Optimization (CCO) function of the selfoptimized network (SON). The goal of CCO functions is to provide optimal coverage and maximize the network capacity 3gpp.36.902 . The CCO should configure the network so the users can establish and maintain connections with acceptable or default service quality and must take the impact on network capacity into account. The CCO is realized through the control of transmit power, antenna tilt and antenna azimuth. In this work we concentrate on the control of transmit power.
The contribution of our work is the analysis of the problem of the selection of optimal set of cells which needs to be reconfigured in response to change in the network topology (e.g. the addition of a base station) or in response to the change in the traffic demand density. In our previous work slabicki_grochla we have shown that the local approach to the TX power selection provides comparable results to the problem of TX power management cellular networks, especially including small cells, providing much lower cost of the reconfiguration and while being less computation intensive. However, it is an open question what part of the network needs to be reconfigured when a new base station is added. In this work we extend the proposed method to automatically select the neighborhood that should be considered during optimization.
The selection of the part of the network which needs to be reconfigured in response to the change of the network load or to addition of a base station in a specific location has no obvious solution. Using a map an experienced operator may manually indicate the list of cells which are subject to the changes in the level of the interferences and are potential candidates for the reconfiguration. Nevertheless, the change of the parameters of one base station may propagate through the network and require some adaptations also in parts of the network which are not within direct neighborhood. To the best of our knowledge, this problem has not been solved yet. We analyze how effective is the selection of the part of the network for the reconfiguration by iterative increase of reconfiguration range (described in section 5) and prpose a sampling based reconfiguration algorithm (described in the section 6).
The rest of the paper is organized as follows: in section 2 we present the literature review, in section 3 we describe the network model used for the analysis of power management algorithms, in section 4 we show the problem of transmission power optimization. Next we describe iterative increase of reconfiguration range in section 5 and we propose a method for the selection of the range of neighbors which are subject to reconfiguration when new nomadic base station is added: sampling based reconfiguration in section 6. We finish the article with a short conclusions in section 7.
2 Literature review
The cell coverage and cell capacity is significantly influenced by the appropriate selection of transmission power, what has been shown e.g. in yilmaz2009analysis where different network scenarios and various combinations of antenna parameter configurations have been studied in terms of signal to interference plus noise ratio (SINR) performance and cell throughput. The selection of the eNodeB configuration to maximize the traffic area capacity is a classical optimization problem. Most of the solutions proposed in the literature are solutions based on optimization methods applied to the whole network slabicki:aliu2013survey . Methods such as simulated annealing balasubramanya2016simulated slabicki:temesvary2009wireless
, Integer Linear Programming (ILP)
slabicki:lopez2011optimization, fuzzy neural networks
fan2014selfor game theory
sen2012coverage have been used to search for the optimal solution. The amount of intercell interferences can be also minimized by the use of scheduling of physical resource blocks and by fractional frequency reuse schemes aghababaiyan2017qos , however this doesn’t eliminate the need of optimization of transmission power selection. In the work buenestado2017self the power planning is formulated as a largescale nonseparable multiobjective optimization problem and an algorithm is proposed to improve the overall network spectral efficiency in the downlink by reducing the transmit power of specific cells to eliminate interference. However the global approach to the problem of coverage and capacity optimization neglects the fact that changing the base station configuration (including the transmit power) is costly because it may influence the ongoing transmissions in all the cells which are subject to reconfiguration.Currently, due to the decrease of base station costs, we are observing a change in network control paradigm. Traditionally, operator decided about where and when a base station has to be located during network planning and performed a large scale optimization chang2017energy . The ability to decide about base stations placement is either shifted towards network users, which may install their own base station (femtocell), to cover the network traffic in small area (e.g. a home) slabicki:raheem2013fixed , or it is executed by the operator in response to change in network load through the addition of a nomadic cell bulakci2015towards . A special case of dynamic cell addition is to use nomadic base stations, which may be added to network only when operator forecasts significant increase of the expected demand for network services in some area (i.e. during event which is popular among people). The nomadic eNodeB has been standardized by the 3GPP 3gpp.33.897 as a deployable system which has the capability to provide radio access, local IP connectivity and public safety services to UEs. A more recent work by Bulakci et al. bulakci2017ran proposes to further extend this concept into vehicular nomadic nodes (VNNs) which are lowpower access nodes with wireless selfbackhaul that can be activated temporarily to provide additional system capacity and/or coverage on demand.
Base stations added in an uncontrolled manner may cause decrease in Quality of Service due to the intercell interferences liu2019time . Newly added nomadic base stations or femtocells may require reconfiguration of neighbor base stations, which should be done quickly and efficiently. Thus it is important to develop a method to automate the adaptation of configuration within the area of the current network which is influenced by the interferences of the newly added femtocell or nomadic eNodeB. The idea of reconfiguration of part of the network in the vicinity of the newly added nomadic cell or femtocell has been discussed in a few papers. Authors in slabicki:eisenblatter2011self propose Soft Integration concept that reconfigures the added base station and base stations which can be seen as direct neighbors. However the paper does not provide analysis of the performance of the proposed concept and there is little said on the problem of neighborhood selection. A similar idea is described in slabicki:sanneck2010context , where a Dynamic Radio Configuration framework is proposed. The authors of this paper prepared classification of configuration parameters and propose to differentiate the reconfiguration parameters depending on class. As in the previous article the paper fails to provide the validation of proposed methods. Ge, Jin and Leung propose to merge the power allocation problem with opportunistic user scheduling ge2017joint and develop an algorithm which solves the resource allocation problem via two stages, user scheduling by the BS and power allocation by each user. The proposed scheme enables nearoptimal selection for instantaneous transmit power of each user, but doesn’t take into account the influence of the transmission power in neighboring cells.
Two articles by Wang and Shen: wang2017small and 8403499 describe how to use the stochastic bandit theory to address the small base station (SBS) transmit power assignment problem. To guarantee good performance when the prior knowledge is insufficient the authors establish an algorithm that exploits the correlation structure to incorporate the performance correlation among similar power values. The simulations analysis given shows that the algorithm allows to decrease the packet loss ratio in sample scenarios, but the analysis of the range of configuration changes is oriented on reduction of the complexity of the problem, and there is no analysis of what part of the existing network should be reconfigured.
3 System model
We consider a network consists of a set of devices () and a set of (). Each of those devices is located in a twodimensional space, and have defined () position. All UEs and BSes are located in the rectangular area, which size is described as (). An example network is shown on the Figure 1. devices have defined parameter, which defines what is the energy radiated by the antenna. Every also has a parameter , which is related with the direction of the centre of the radiated beam. The width of the beam is equal 120 deg. To assign to we use heuristic, which is widely used in wireless systems ali2011understanding . The heuristic assigns a to the with highest . The also defines what is the maximal possible throughput achievable by a .
To determine SINR level for a UE connected to a particular eNodeB and taking into account the interferences from other cells, we use the following formula:
(1) 
where is a transmission power level of the BS – in numerator it is of the BS to which an UE is connected, in denumerator we consider of all eNodeBs that are visible from the UE. The value is a noise level and the is the path loss calculated according to the SUI radio signal propagation model slabicki:erceg1999empirically .
The maximum throughput for a given client is determined by the modulation and coding scheme (MCS) in a given location. The MCS is selected as a function of the signal quality indicator, which is calculated based on an average SINR at a given location. The SINR thresholds for the Additive white Gaussian noise (AWGN) case have been determined for the different MCSs with the corresponding efficiency according to the following model, presented earlier in giambene2014resource :
(2) 
where and BER = 0.00005 and where the efficiency of the ith MCS can be determined on the basis of the data in Table 1 according to the following formula:
(3) 
CQI 
Modula tions 
Code rate r 
Modula tion size, M 
SINR thresholds, SINR (AWGN) 
1  QPSK  78/1024  4  2.1054 
2  QPSK  120/1024  4  0.1083 
3  QPSK  193/1024  4  2.1776 
4  QPSK  308/1024  4  4.5647 
5  QPSK  449/1024  4  6.6514 
6  QPSK  602/1024  4  8.4275 
7  16QAM  378/1024  16  9.9379 
8  16QAM  490/1024  16  11.8495 
9  16QAM  616/1024  16  13.7624 
10  64QAM  466/1024  64  14.9370 
11  64QAM  567/1024  64  16.9703 
12  64QAM  666/1024  64  18.8734 
13  64QAM  772/1024  64  20.8506 
14  64QAM  873/1024  64  22.6980 
15  64QAM  948/1024  64  24.0546 
The throughput calculated according to the above described model can be used by a single client if it is solely using the whole available transmission time. When multiple UEs are sharing the radio resources of a given cell, the scheduler algorithm in the BS allocates the transmission time for each of the UEs. Assuming the Round Robin scheduler is implemented, the of the throughput is allocated for each of the UEs connected to the given BS, where is the number of UEs in a cell. As a consequence, the throughput available per UE may be calculated as the maximum throughput for the UEs divided by the number of UEs within the cell.
We use the total network throughput as the efficiency metric of the network and the quality measure for the given base stations’ configuration. We define the total network throughput as the sum of the offered throughput in all the cells in the network. In other words, the total throughput can be seen as an integral of Area Traffic Capacity itu20202083 over all the cells in the network. To evaluate particular configuration of the transmit power, the total network throughput is calculated as the sum of throughput of all UEs.
4 Transmit power selection
In our previous works: slabicki:slabicki2014automatic and slabicki2015local we have shown that the maximization of total throughput offered to the clients allows to correctly solve the problem of optimal selection of the transmit power in LTE networks. We use it as a reference for the analysis of the problem of the selection of reconfiguration range in response to the addition of a new nomadic cell. The sample configuration of TX power and coverage calculated as an output of a global optimization is presented on Figure 1. It uses the model of LTE network presented in section 3
. The end nodes are placed in a regular grid within a rectangle 7498x6327 meters. The following parameters have been used in the evaluation number of cells: 36, number of UEs: 361. The colors denote boundaries of the cells, namely the area for which a SINR of a given BS is highest. The TX Power of each of the BS is selected by using Simple Genetic Algorithm, with the total throughput (sum of throughput offered to all clients) used as the goal function of the optimization.
Next we present the scenario of extension of the network by adding a nomadic eNodeB: a new base station is added in the central point of the network. When the global optimization of TX power was rerun after the adding of a new cell, the network is able to adapt to the new topology, but practically all the cells need to be reconfigured 2.
4.1 Local reconfiguration method
The global optimization of the TX power in the whole network is costly, as there is high probability that even a small change in initial optimization conditions may lead of reconfigure of large part of the network. Thus it is important for a base station addition use case to limit the range of reconfiguration to some area in the vicinity of the location of nomadic eNodeB. In
slabicki2015local we have proposed a local reconfiguration method, which allows to define the range of cells which are subject of the TX Power optimization, without the changes in the remaining part of the network.The following scenario was used to evaluate the reconfiguration method:

find a power configuration for reference network,

add new cell with three sector antennas in central point of the network and run (independently) two algorithms:

global reconfiguration algorithm (presented in Algorithm 1)

local reconfiguration algorithm


calculate metrics for each reconfiguration method.
Above method might be easily applied to cellular network of different topologies and geographic distribution of base stations. The optimization procedure has been executed 50 times to achieve statistically reliable results. We have used PyGMO library slabicki:izzo2012pygmo with Simple Genetic Algorithm (SGA), configured to use 100 generations (this size was selected experimentally, to the level after which the increase of number of generations did not improve the results). The SGA method was selected as an optimization method applicable to the nonlinear problems.
Considering that the global method might results in complex reconfiguration behaviour of a network, in slabicki_grochla the local approach to reconfiguration has been considered. The local method was based on similar procedure as in the global optimization, with a optimization limits set to a predefined list of BSes than can be reconfigured by the algorithm. A manually selected subset of base stations set e.g. to the 4 nearest BS locations provides proper results, the manual definition of the size and range of the neighborhood is not effective for large scale networks.
5 Iterative increase of reconfiguration range
The intuitive approach to select the range of cells considered for the reconfiguration is to start with the change of the nearest neighbors and continue by increasing the range of changes. We evaluate such method: an algorithm that starts by the designation of circles with a center in the location of a newly added BS or a center of a changed state that initiates the need for reconfiguration. The set of BSes considered for a configuration change at a given step is defined by a set of a BSes located within particular circle. The radius of the smallest circle can be calculated using the free space radio signal propagation model, as a distance at which the received power of reference signal is equal to the noise level for a default TX power. The following circles are of growing size, each one with a radius multiplied by a parameter greater than 1 or can be calculated as the size of the first circle, but for a larger TX Power. A sample set of circles is presented on the Figure 3.
The base stations within the given circle define the search space for the optimization algorithm for the network reconfiguration. The configuration of all the remaining base stations is fixed and does not change at a given step. We start by running the Algorithm 1 with the change range limited to the inner circle and next we increase the range up to a point at which there is no difference between the result of the calculation for a current step and for the previous one.
The plots 4 and 6 present the boxplots of the number of reconfigured base stations for each of the sizes of the sets used for the reconfiguration. The algorithm has been executed 50 times for each set. It can be seen that in most of the cases the optimization changes the configuration only of a part of the base stations within a given circle. Additionally, the search space grows proportionally to the growing radius of the circle.
Next, we compare the outcome of a various ranges of the local reconfiguration method with the results of global optimization. We have executed the following experiment: a new nomadic base station with three sectors (three cells) have been added to a network. Next we have calculated the optimized set of TX power using the global optimization and using the local reconfiguration method with three different ranges. For each of the configurations the relative difference in total network throughput. The experiment has been repeated 50 times with different random seeds. The ECDF have been plotted to present the number of experiments in which the difference between the local and global optimization. The results are presented on Figures 5 and 7. For larger network (108 cells) there is practically no difference between outcome of the local reconfiguration and the global optimization of parameters. For smaller networks we can observe that the global optimization outperforms the local method by up to 2 percent, but this is the case only for a very limited range of the reconfiguration. When the range is not so limited or the network size is bigger the outcome both methods provide very similar level of the resulting total throughput of the network, but the local method reaches this goal by reconfiguring smaller number of base stations.
6 Sampling based local TX power reconfiguration
The iterative increase of reconfiguration range method described in previous section is arbitrary in the selection of base stations which are subject of the reconfiguration. The set of base stations which are reconfigured is incrementally increased basing on the distance from the newly added cell, which is not always a adequate. In heterogeneous networks with cells of different size, some of the pico and nanocells could be omitted, as they will have no influence on the interferences for base stations added even in locations not so distant. Thus we have continued our work to propose a dynamic local reconfiguration method, which selects the cells which needs to be reconfigured basing on sampling.
The goal of this algorithm is to estimate whenever the change in the network is needed basing on a limited number of sample locations, for which the received signal strength is calculated before and after the change of configuration. If the metric of quality (e.g. the average value) for the selected configuration in the points chosen is worse than the expected value, the base station is subject of reconfiguration. The algorithm omits the locations for which the influence of the configuration change is negligible or negative, e.g. because of the large distance from base station. Pseudocode is presented in Algoritm
2.We propose to use the threshold on average SINR change as the metric used for selection whenever the base station needs to be reconfigured. In our experiment we have used the 2dB as the threshold.
We have compared the outcome of the sampling based local TX power reconfiguration method with the global optimization method and the iterative local reconfiguration method proposed in the previous section. The analysis has been executed for three network sizes, to analyze the performance of the proposed method in networks with various density of cells and in network topology representing irregular placement of cells. The following scenarios have been implemented:

36 base stations in honeycomb topology, with simulated 324 UEs,

75 base stations in honeycomb topology, with simulated 625 UEs,

63 base stations in topology representing the real locations of LTE cells in Hannover city rose2013ic , with 625 simulated UEs,
The experiments have been executed 50 times to select the configuration of each reference networks. The following three methods have been used:

global optimization,

local reconfiguration with constant radius of the reconfiguration (described in the previous section).

local with sampling.
The box plot on Figure 8 shows the relation between the number of reconfigured base station in response to the addition of a new cell in the network consisting 36 base stations. The sampling local reconfiguration algorithm requires to make lower number of changes in configuration (the median is 10) even comparing to the iterative approach with a small radius, but provides the same outcome in terms of the total offered throughput in the network, which is presented on the Figure 9.
The analysis of the sampling algorithm in larger network (75 base stations) shows similar results, as can be observed on the Figures 10 and 11. While the number of reconfigured stations is slightly higher because of the larger size of the network, the proportion remains similar and the sampling algorithm is able to provide results as good as the global optimization, with significantly lower amount of reconfigurations needed. The results on Hannover city network topology confirm that the sampling algorithm works well in the reallife structure of the network, and the Figures 12 and 13 show that in network with variable sizes of the cells it is able to provide throughput as good as global optimization, requiring to reconfigure less than 10 base stations.
7 Conclusions
The local approach to reconfiguration of the network, in response to the addition of a new cell to existing network, allows to limit the number of configuration changes needed to adapt the transmission power to the new network topology. This work shows how to select the range for TX Power reconfiguration when a new cell is added to the network. We propose sampling based algorithm that allow to select the set of cells which needs to be reconfigured. The analysis of the proposed method in regular topology and in real life scenario of base stations located in a city environment shows that it provides similar level of throughput offered to the clients comparing to the reconfiguration of the whole network based on global optimization, through a reconfiguration of only a small set of base stations. The sampling based algorithm is able to reach the near optimal configuration with smaller number of reconfigurations: by limiting the range of changes to on average 10 neighboring cells, the achieved efficiency of the network is the same as with global optimization of TX power. This allows 5G and LTE operators to react faster and with lower cost to the changes in network and events such as addition of a new nomadic base station or deployment of a small cell.
References
 [1] 3GPP. Selfconfiguring and selfoptimizing network (SON) use cases and solutions. TS 36.902, 3rd Generation Partnership Project (3GPP), March 2011.
 [2] 3GPP. Study on isolated EUTRAN operation for public safety; Security aspects. TS 33.897, 3rd Generation Partnership Project (3GPP), April 2015.
 [3] Keyvan Aghababaiyan and Behrouz Maham. Qosaware downlink radio resource management in ofdmabased small cells networks. IET Communications, 12(4):441–448, 2017.
 [4] Tara AliYahiya. Understanding LTE and its Performance. Springer Science & Business Media, 2011.
 [5] O.G. Aliu, A Imran, M.A Imran, and B. Evans. A Survey of Self Organisation in Future Cellular Networks. Communications Surveys Tutorials, IEEE, 15(1):336–361, First 2013.
 [6] Naveen Mysore Balasubramanya and Lutz Lampe. Simulated annealing based joint coverage and capacity optimization in lte. In Electrical and Computer Engineering (CCECE), 2016 IEEE Canadian Conference on, pages 1–5. IEEE, 2016.
 [7] Víctor Buenestado, Matías Toril, Salvador LunaRamírez, and José M RuizAviles. Selfplanning of base station transmit power for coverage and capacity optimization in lte. Mobile Information Systems, 2017, 2017.
 [8] Omer Bulakci, Alexandros Kaloxylos, Josef Eichinger, and Chan Zhou. Ran moderation in 5g dynamic radio topology. In Vehicular Technology Conference (VTC Spring), 2017 IEEE 85th, pages 1–4. IEEE, 2017.
 [9] Ömer Bulakci, Zhe Ren, Chan Zhou, Josef Eichinger, Peter Fertl, David GozalvezSerrano, and Slawomir Stanczak. Towards flexible network deployment in 5g: Nomadic node enhancement to heterogeneous networks. In Communication Workshop (ICCW), 2015 IEEE International Conference on, pages 2572–2577. IEEE, 2015.
 [10] Zheng Chang, Shan Zhang, Zhongyu Wang, Xijuan Guo, Zhu Han, and Tapani Ristaniemi. Energy efficient optimisation for largescale multipleantenna system with wpt. IET Communications, 12(5):552–558, 2017.
 [11] A Eisenblatter, U Turke, and Christoph Schmelz. Selfconfiguration in LTE radio networks: automatic generation of eNodeB parameters. In Vehicular Technology Conference (VTC Spring), 2011 IEEE 73rd. IEEE, 2011.
 [12] Vinko Erceg, Larry J Greenstein, Sony Y Tjandra, Seth R Parkoff, Ajay Gupta, Boris Kulic, Arthur A Julius, and Renee Bianchi. An empirically based path loss model for wireless channels in suburban environments. Selected Areas in Communications, IEEE Journal on, 17(7):1205–1211, 1999.
 [13] LópezPérez et al. Optimization method for the joint allocation of modulation schemes, coding rates, resource blocks and power in selforganizing LTE networks. In INFOCOM, 2011 Proceedings IEEE. IEEE, 2011.

[14]
Shaoshuai Fan, Hui Tian, and Cigdem Sengul.
Selfoptimization of coverage and capacity based on a fuzzy neural network with cooperative reinforcement learning.
EURASIP Journal on Wireless Communications and Networking, 2014(1):57, 2014.  [15] Xin Ge, Hu Jin, and Victor CM Leung. Joint opportunistic user scheduling and power allocation: throughput optimisation and fair resource sharing. IET Communications, 12(5):634–640, 2017.
 [16] Giovanni Giambene, Tara Ali Yahiya, Krzysztof Grochla, Konrad Połys, et al. Resource management and cell planning in lte systems. In Wireless Networking for Moving Objects, pages 177–197. Springer, 2014.
 [17] Recommendation M ITUR. 20830,“. IMT VisionFramework and overall objectives of the future development of IMT for, 2020.
 [18] Dario Izzo. PyGMO and PyKEP: open source tools for massively parallel optimization in astrodynamics (the case of interplanetary trajectory optimization). In Proceed. Fifth International Conf. Astrodynam. Tools and Techniques, ICATT, 2012.
 [19] Ling Liu, Yiqing Zhou, Athanasios V Vasilakos, Lin Tian, and Jinglin Shi. Timedomain icic and optimized designs for 5g and beyond: a survey. Science China Information Sciences, 62(2):21302, 2019.
 [20] Slabicki Mariusz and Grochla Krzysztof. The Automatic Configuration of Transmit Power in LTE Networks Based on Throughput Estimation. In International Performance Computing and Communications Conference 2014, Dec 2014.
 [21] Rand Raheem, Aboubaker Lasebae, Mahdi Aiash, and Jonathan Loo. From fixed to mobile femtocells in LTE systems: Issues and challenges. In Future Generation Communication Technology, 2013 2nd International Conference on. IEEE, 2013.
 [22] Dennis M Rose, Thomas Jansen, Thomas Werthmann, Ulrich Türke, and Thomas Kürner. The IC 1004 Urban Hannover Scenario–3D Pathloss Predictions and Realistic Traffic and Mobility Patterns. European Cooperation in the Field of Scientific and Technical Research, COST IC1004 TD (13), 8054, 2013.
 [23] Henning Sanneck, Yves Bouwen, and Eddy Troch. Context based configuration management of plug & play LTE base stations. In Network Operations and Management Symposium (NOMS), 2010 IEEE. IEEE, 2010.
 [24] XU Sen, HOU Meng, NIU Kai, Zhiqiang HE, and Weiling WU. Coverage and capacity optimization in lte network based on noncooperative games. The Journal of China Universities of Posts and Telecommunications, 19(4):14–42, 2012.
 [25] Mariusz Słabicki and Krzysztof Grochla. Local approach to power management in lte networks. In Telecommunications and Signal Processing (TSP), 2015 38th International Conference on. IEEE, IEEE, 2015.
 [26] Mariusz Slabicki and Krzysztof Grochla. Local approach to power management in LTE networks. In Telecommunications and Signal Processing (TSP), 2015 38th International Conference on, pages 139–143. IEEE, 2015.
 [27] András Temesváry. SelfConfiguration of Antenna Tilt and Power for Plug & Play Deployed Cellular Networks. In Wireless Communications and Networking Conference, 2009. WCNC 2009. IEEE, April 2009.
 [28] Z. Wang and C. Shen. Small cell power assignment with unimodal continuumarmed bandit learning. In 2018 IEEE International Conference on Communications Workshops (ICC Workshops), pages 1–6, May 2018.
 [29] Zhiyang Wang and Cong Shen. Small cell transmit power assignment based on correlated bandit learning. IEEE Journal on Selected Areas in Communications, 35(5):1030–1045, 2017.
 [30] Osman NC Yilmaz, Seppo Hamalainen, and Jyri Hamalainen. Analysis of antenna parameter optimization space for 3gpp lte. In Vehicular Technology Conference Fall (VTC 2009Fall), 2009 IEEE 70th, pages 1–5. IEEE, 2009.