New Methods of Efficient Base Station Control for Green Wireless Communications

학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2014. 2. 이병기.This dissertation reports a study on developing new methods of efficient base station (BS) control for green wireless communications. The BS control schemes may be classified into three different types depending on the time scale — hours based, minutes based, and milli-seconds based. Specifically, hours basis pertains to determining which BSs to switch on or offminutes basis pertains to user equipment (UE) associationand milli-seconds basis pertains to UE scheduling and radio resource allocation. For system model, the dissertation considers two different models — heterogeneous networks composed of cellular networks and wireless local area networks (WLANs), and cellular networks adopting orthogonal frequency division multiple access (OFDMA) with carrier aggregation (CA). By combining each system model with a pertinent BS control scheme, the dissertation presents three new methods for green wireless communications: 1) BS switching on/off and UE association in heterogeneous networks, 2) optimal radio resource allocation in heterogeneous networks, and 3) energy efficient UE scheduling for CA in OFDMA based cellular networks. The first part of the dissertation presents an algorithm that performs BS switchingon/off and UE association jointly in heterogeneous networks composed of cellular networks and WLANs. It first formulates a general problem which minimizes the total cost function which is designed to balance the energy consumption of overall network and the revenue of cellular networks. Given that the time scale for determining the set of active BSs is much larger than that for UE association, the problem may be decomposed into a UE association algorithm and a BS switching on/off algorithm, and then an optimal UE association policy may be devised for the UE association problem. Since BS switching-on/off problem is a challenging combinatorial problem, two heuristic algorithms are proposed based on the total cost function and the density of access points of WLANs within the coverage of each BS, respectively. According to simulations, the two heuristic algorithms turn out to considerably reduce energy consumption when compared with the case where all the BSs are always turned on. The second part of the dissertation presents an energy-per-bit minimized radioresource allocation scheme in heterogeneous networks equipped with multi-homing capability which connects to different wireless interfaces simultaneously. Specifically, an optimization problem is formulated for the objective of minimizing the energy-per-bit which takes a form of nonlinear fractional programming. Then, a parametric optimization problem is derived out of that fractional programming and the original problem is solved by using a double-loop iteration method. In each iteration, the optimal resource allocation policy is derived by applying Lagrangian duality and an efficient dual update method. In addition, suboptimal resource allocation algorithms are developed by using the properties of the optimal resource allocation policy. Simulation results reveal that the optimal allocation algorithm improves energy efficiency significantly over the existing resource allocation algorithms designed for homogeneous networks and its performance is superior to suboptimal algorithms in reducing energy consumption as well as in enhancing network energy efficiency. The third part of the dissertation presents an energy efficient scheduling algorithm for CA in OFDMA based wireless networks. In support of this, the energy efficiency is newly defined as the ratio of the time-averaged downlink data rate and the time-averaged power consumption of the UE, which is important especially for battery-constrained UEs. Then, a component carrier and resource block allocation problem is formulated such that the proportional fairness of the energy efficiency is guaranteed. Since it is very complicated to determine the optimal solution, a low complexity energy-efficient scheduling algorithm is developed, which approaches the optimal algorithm. Simulation results demonstrate that the proposed scheduling scheme performs close to the optimal scheme and outperforms the existing scheduling schemes for CA.Abstract i List of Figures viii List of Tables x 1 Introduction 1 2 A Joint Algorithm for Base Station Operation and User Association in Heterogeneous Networks 7 2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 2.2 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.3 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . . . . 12 2.4 UE Association Algorithm . . . . . . . . . . . . . . . . . . . . . . 14 2.5 BS Switching-on/off Algorithm . . . . . . . . . . . . . . . . . . . . 17 2.5.1 Cost Function Based (CFB) Algorithm . . . . . . . . . . . 19 2.5.2 AP Density Based (ADB) Algorithm . . . . . . . . . . . . 19 2.6 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . . 20 2.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 25 3 Energy-per-Bit Minimized Radio Resource Allocation in Heterogeneous Networks 27 3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27 3.2 System Model and Problem Formulation . . . . . . . . . . . . . . . 30 3.3 Parametric Approach to Fractional Programming . . . . . . . . . . 36 3.3.1 Parametric Approach . . . . . . . . . . . . . . . . . . . . . 37 3.3.2 Double-Loop Iteration to Determine Optimal θ . . . . . . . 38 3.4 Optimal Resource Allocation Algorithm . . . . . . . . . . . . . . . 39 3.4.1 Optimal Allocation of Subcarrier and Power . . . . . . . . . 41 3.4.2 Optimal Allocation of Time Fraction . . . . . . . . . . . . . 44 3.4.3 Lagrangian Multipliers Update Algorithm . . . . . . . . . . 48 3.5 Design of Suboptimal Algorithms . . . . . . . . . . . . . . . . . . 51 3.5.1 Time-Fraction Allocation First (TAF) Algorithm . . . . . . 51 3.5.2 Normalized Time-Fraction Allocation (NTA) Algorithm . . 53 3.6 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . . 54 3.7 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 65 4 Energy Efficient Scheduling for Carrier Aggregation in OFDMA Based Wireless Networks 68 4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68 4.2 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70 4.3 Energy Efficiency Proportional Fairness (EEPF) Scheduling . . . . 74 4.4 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . . . . 78 4.5 Summary . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 85 5 Conclusion 87 5.1 Research Contributions . . . . . . . . . . . . . . . . . . . . . . . . 87 5.2 Future Research Directions . . . . . . . . . . . . . . . . . . . . . . 91 References 93Docto

Feedback and time are essential for the optimal control of computing systems

The performance, reliability, cost, size and energy usage of computing systems can be improved by one or more orders of magnitude by the systematic use of modern control and optimization methods. Computing systems rely on the use of feedback algorithms to schedule tasks, data and resources, but the models that are used to design these algorithms are validated using open-loop metrics. By using closed-loop metrics instead, such as the gap metric developed in the control community, it should be possible to develop improved scheduling algorithms and computing systems that have not been over-engineered. Furthermore, scheduling problems are most naturally formulated as constraint satisfaction or mathematical optimization problems, but these are seldom implemented using state of the art numerical methods, nor do they explicitly take into account the fact that the scheduling problem itself takes time to solve. This paper makes the case that recent results in real-time model predictive control, where optimization problems are solved in order to control a process that evolves in time, are likely to form the basis of scheduling algorithms of the future. We therefore outline some of the research problems and opportunities that could arise by explicitly considering feedback and time when designing optimal scheduling algorithms for computing systems

Towards Fast-Convergence, Low-Delay and Low-Complexity Network Optimization

Distributed network optimization has been studied for well over a decade. However, we still do not have a good idea of how to design schemes that can simultaneously provide good performance across the dimensions of utility optimality, convergence speed, and delay. To address these challenges, in this paper, we propose a new algorithmic framework with all these metrics approaching optimality. The salient features of our new algorithm are three-fold: (i) fast convergence: it converges with only $O(\log(1/\epsilon))$ iterations that is the fastest speed among all the existing algorithms; (ii) low delay: it guarantees optimal utility with finite queue length; (iii) simple implementation: the control variables of this algorithm are based on virtual queues that do not require maintaining per-flow information. The new technique builds on a kind of inexact Uzawa method in the Alternating Directional Method of Multiplier, and provides a new theoretical path to prove global and linear convergence rate of such a method without requiring the full rank assumption of the constraint matrix

Thirty Years of Machine Learning: The Road to Pareto-Optimal Wireless Networks

Future wireless networks have a substantial potential in terms of supporting a broad range of complex compelling applications both in military and civilian fields, where the users are able to enjoy high-rate, low-latency, low-cost and reliable information services. Achieving this ambitious goal requires new radio techniques for adaptive learning and intelligent decision making because of the complex heterogeneous nature of the network structures and wireless services. Machine learning (ML) algorithms have great success in supporting big data analytics, efficient parameter estimation and interactive decision making. Hence, in this article, we review the thirty-year history of ML by elaborating on supervised learning, unsupervised learning, reinforcement learning and deep learning. Furthermore, we investigate their employment in the compelling applications of wireless networks, including heterogeneous networks (HetNets), cognitive radios (CR), Internet of things (IoT), machine to machine networks (M2M), and so on. This article aims for assisting the readers in clarifying the motivation and methodology of the various ML algorithms, so as to invoke them for hitherto unexplored services as well as scenarios of future wireless networks.Comment: 46 pages, 22 fig