Browse

New Methods of Efficient Base Station Control for Green Wireless Communications

DC Field Value Language
dc.contributor.advisor이병기-
dc.contributor.author김선욱-
dc.date.accessioned2017-07-13T07:02:41Z-
dc.date.available2017-07-13T07:02:41Z-
dc.date.issued2014-02-
dc.identifier.other000000018032-
dc.identifier.urihttps://hdl.handle.net/10371/118980-
dc.description학위논문 (박사)-- 서울대학교 대학원 : 전기·컴퓨터공학부, 2014. 2. 이병기.-
dc.description.abstractThis 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 off-
dc.description.abstractminutes basis pertains to user equipment (UE) association-
dc.description.abstractand 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.
-
dc.description.tableofcontentsAbstract 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 93
-
dc.formatapplication/pdf-
dc.format.extent1662076 bytes-
dc.format.mediumapplication/pdf-
dc.language.isoen-
dc.publisher서울대학교 대학원-
dc.subjectcommunication-
dc.subjectheterogeneous networks-
dc.subjectcarrier aggregation (CA)-
dc.subjectBS switching-on/off-
dc.subjectuser association-
dc.subjectradio resource allocation-
dc.subject.ddc621-
dc.titleNew Methods of Efficient Base Station Control for Green Wireless Communications-
dc.typeThesis-
dc.description.degreeDoctor-
dc.citation.pagesx, 100-
dc.contributor.affiliation공과대학 전기·컴퓨터공학부-
dc.date.awarded2014-02-
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Electrical and Computer Engineering (전기·정보공학부)Theses (Ph.D. / Sc.D._전기·정보공학부)
Files in This Item:
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse