No Arabic abstract
We provide the reader with an accessible yet rigorous introduction to Bayesian optimisation with Gaussian processes (BOGP) for the purpose of solving a wide variety of radio resource management (RRM) problems. We believe that BOGP is a powerful tool that has been somewhat overlooked in RRM research, although it elegantly addresses pressing requirements for fast convergence, safe exploration, and interpretability. BOGP also provides a natural way to exploit prior knowledge during optimization. After explaining the nuts and bolts of BOGP, we delve into more advanced topics, such as the choice of the acquisition function and the optimization of dynamic performance functions. Finally, we put the theory into practice for the RRM problem of uplink open-loop power control (OLPC) in 5G cellular networks, for which BOGP is able to converge to almost optimal solutions in tens of iterations without significant performance drops during exploration.
Next-generation of satellite communication (SatCom) networks are expected to support extremely high data rates for a seamless integration into future large satellite-terrestrial networks. In view of the coming spectral limitations, the main challenge is to reduce the cost per bit, which can only be achieved by enhancing the spectral efficiency. In addition, the capability to quickly and flexibly assign radio resources according to the traffic demand distribution has become a must for future multibeam broadband satellite systems. This article presents the radio resource management problems encountered in the design of future broadband SatComs and provides a comprehensive overview of the available techniques to address such challenges. Firstly, we focus on the demand-matching formulation of the power and bandwidth assignment. Secondly, we present the scheduling design in practical multibeam satellite systems. Finally, a number of future challenges and the respective open research topics are described.
This paper addresses the energy-saving problem for the downlink of heterogeneous networks, which aims at minimizing the total base stations (BSs) power consumption while each users rate requirement is supported. The basic idea of this work is to make use of the flexibility and scalability of the system such that more benefits can be gained by efficient resource management. This motivates us to propose a flexible BS power consumption model, which can control system resources, such as antennas, frequency carriers and transmit power allocation in an energy efficient manner rather than the on/off binary sleep mode for BSs. To denote these power-saving modes, we employ the group sparsity of the transmit power vector instead of the {0, 1} variables. Based on this power model, a semi-dynamic green resource management mechanism is proposed, which can jointly solve a series of resource management problems, including BS association, frequency carriers (FCs) assignment, and the transmit power allocation, by group sparse power control based on the large scale fading values. In particular, the successive convex approximation (SCA)-based algorithm is applied to solve a stationary solution to the original non-convex problem. Simulation results also verify the proposed BS power model and the green resource management mechanism.
Mobile-edge computing (MEC) has recently emerged as a prominent technology to liberate mobile devices from computationally intensive workloads, by offloading them to the proximate MEC server. To make offloading effective, the radio and computational resources need to be dynamically managed, to cope with the time-varying computation demands and wireless fading channels. In this paper, we develop an online joint radio and computational resource management algorithm for multi-user MEC systems, with the objective as minimizing the long-term average weighted sum power consumption of the mobile devices and the MEC server, subject to a task buffer stability constraint. Specifically, at each time slot, the optimal CPU-cycle frequencies of the mobile devices are obtained in closed forms, and the optimal transmit power and bandwidth allocation for computation offloading are determined with the Gauss-Seidel method; while for the MEC server, both the optimal frequencies of the CPU cores and the optimal MEC server scheduling decision are derived in closed forms. Besides, a delay-improved mechanism is proposed to reduce the execution delay. Rigorous performance analysis is conducted for the proposed algorithm and its delay-improved version, indicating that the weighted sum power consumption and execution delay obey an $left[Oleft(1slash Vright),Oleft(Vright)right]$ tradeoff with $V$ as a control parameter. Simulation results are provided to validate the theoretical analysis and demonstrate the impacts of various parameters.
The limited fronthaul capacity imposes a challenge on the uplink of centralized radio access network (C-RAN). We propose to boost the fronthaul capacity of massive multiple-input multiple-output (MIMO) aided C-RAN by globally optimizing the power sharing between channel estimation and data transmission both for the user devices (UDs) and the remote radio units (RRUs). Intuitively, allocating more power to the channel estimation will result in more accurate channel estimates, which increases the achievable throughput. However, increasing the power allocated to the pilot training will reduce the power assigned to data transmission, which reduces the achievable throughput. In order to optimize the powers allocated to the pilot training and to the data transmission of both the UDs and the RRUs, we assign an individual power sharing factor to each of them and derive an asymptotic closed-form expression of the signal-to-interference-plus-noise for the massive MIMO aided C-RAN consisting of both the UD-to-RRU links and the RRU-to-baseband unit (BBU) links. We then exploit the C-RAN architectures central computing and control capability for jointly optimizing the UDs power sharing factors and the RRUs power sharing factors aiming for maximizing the fronthaul capacity. Our simulation results show that the fronthaul capacity is significantly boosted by the proposed global optimization of the power allocation between channel estimation and data transmission both for the UDs and for their host RRUs. As a specific example of 32 receive antennas (RAs) deployed by RRU and 128 RAs deployed by BBU, the sum-rate of 10 UDs achieved with the optimal power sharing factors improves 33% compared with the one attained without optimizing power sharing factors.
We consider a new approach to power control in decentralized wireless networks, termed fractional power control (FPC). Transmission power is chosen as the current channel quality raised to an exponent -s, where s is a constant between 0 and 1. The choices s = 1 and s = 0 correspond to the familiar cases of channel inversion and constant power transmission, respectively. Choosing s in (0,1) allows all intermediate policies between these two extremes to be evaluated, and we see that usually neither extreme is ideal. We derive closed-form approximations for the outage probability relative to a target SINR in a decentralized (ad hoc or unlicensed) network as well as for the resulting transmission capacity, which is the number of users/m^2 that can achieve this SINR on average. Using these approximations, which are quite accurate over typical system parameter values, we prove that using an exponent of 1/2 minimizes the outage probability, meaning that the inverse square root of the channel strength is a sensible transmit power scaling for networks with a relatively low density of interferers. We also show numerically that this choice of s is robust to a wide range of variations in the network parameters. Intuitively, s=1/2 balances between helping disadvantaged users while making sure they do not flood the network with interference.