Skip to:Content
|
Bottom
Cover image for Resource allocation in uplink OFDMA wireless systems : optimal solutions and practicalimplementations
Title:
Resource allocation in uplink OFDMA wireless systems : optimal solutions and practicalimplementations
Personal Author:
Series:
IEEE series on digital and mobile communication
Publication Information:
Hoboken, N.J. : John Wiley & Sons, Inc., 2012
Physical Description:
xviii, 276 pages : illustrations ; 24 cm.
ISBN:
9781118074503
Added Author:

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010334125 TK5103.484 Y33 2012 Open Access Book Book
Searching...

On Order

Summary

Summary

Tackling problems from the least complicated to the most, Resource Allocation in Uplink OFDMA Wireless Systems provides readers with a comprehensive look at resource allocation and scheduling techniques (for both single and multi-cell deployments) in uplink OFDMA wireless networks--relying on convex optimization and game theory to thoroughly analyze performance.

Inside, readers will find topics and discussions on:

Formulating and solving the uplink ergodic sum-rate maximization problem

Proposing suboptimal algorithms that achieve a close performance to the optimal case at a considerably reduced complexity and lead to fairness when the appropriate utility is used

Investigating the performance and extensions of the proposed suboptimal algorithms in a distributed base station scenario

Studying distributed resource allocation where users take part in the scheduling process, and considering scenarios with and without user collaboration

Formulating the sum-rate maximization problem in a multi-cell scenario, and proposing efficient centralized and distributed algorithms for intercell interference mitigation

Discussing the applicability of the proposed techniques to state-of-the-art wireless technologies, LTE and WiMAX, and proposing relevant extensions

Along with schematics and figures featuring simulation results, Resource Allocation in Uplink OFDMA Wireless Systems is a valuable book for'wireless communications and cellular systems professionals and students.


Author Notes

Zaher Dawy, PhD. is an associate professor at the American University of Beirut (AUB). His research interests include cooperative and distributed communications, resource allocation, cellular technologies, and computational biology. He received the IEEE Communications Society Outstanding Young Researcher Award for Europe, Middle East, and Africa Region in 2011 and the AUB 2008 Teaching Excellence Award Dr. Dawy is a senior member of the IEEE and Chair of the IEEE Communications Society, Lebanon Chapter.


Table of Contents

Prefacep. xiii
Acknowledgmentsp. xv
Acronymsp. xvii
Chapter 1 Introductionp. 1
1.1 Evolution of Wireless Communication Systemsp. 1
1.2 Orthogonal Frequency Division Multiple Accessp. 2
1.3 Organization of this Bookp. 5
Chapter 2 Background on Downlink Resource Allocation in OFDMA Wireless Networksp. 9
2.1 Centralized Single Cell Schedulingp. 9
2.1.1 Continuous Versus Discrete Ratesp. 11
2.1.2 Optimal Versus Suboptimal Schedulingp. 12
2.2 Distributed Schedulingp. 13
2.3 Scheduling in Multicell Scenariosp. 14
2.3.1 Multicell Scheduling in LTEp. 16
2.4 Summaryp. 18
Chapter 3 Ergodic Sum-Rate Maximization with Continuous Ratesp. 19
3.1 Backgroundp. 19
3.2 Problem Formulationp. 21
3.3 Problem Solutionp. 23
3.3.1 Solution of the Dual Problemp. 24
3.3.2 Duality Gap Analysisp. 26
3.3.3 Complexity Analysisp. 28
3.3.4 Solution Approach in a MIMO Scenariop. 28
3.4 Achievable Rate Regionp. 28
3.4.1 K-user Achievable Rate Region without Rate Constraintsp. 29
3.4.2 K-user Achievable Rate Region with Rate Constraintsp. 30
3.4.3 Application to the Two-Users Rate Regionp. 32
3.5 Results and Discussionp. 35
3.5.1 Simulation Parametersp. 35
3.5.2 Multiplier Calculation and Convergencep. 35
3.5.3 Duality Gap Resultsp. 38
3.5.4 Sum-Rate Resultsp. 38
3.6 Summaryp. 41
Chapter 4 Ergodic Sum-Rate Maximization with Discrete Ratesp. 43
4.1 Backgroundp. 43
4.2 Problem Formulationp. 44
4.3 Problem Solutionp. 46
4.3.1 Duality Gap Analysisp. 50
4.3.2 Complexity Analysisp. 52
4.4 Results and Discussionp. 52
4.4.1 Simulation Modelp. 52
4.4.2 Continuous Versus Discrete Ratesp. 53
4.4.3 Impact of Modulation and Coding Schemesp. 54
4.4.4 Impact of Varying the User Weightsp. 56
4.5 Summaryp. 57
Chapter 5 Generalization to Utility Maximizationp. 59
5.1 Backgroundp. 59
5.2 Ergodic Utility Maximization with Continuous Ratesp. 60
5.2.1 Duality Gapp. 62
5.3 Ergodic Utility Maximization with Discrete Ratesp. 64
5.3.1 Duality Gapp. 67
5.4 Summaryp. 68
Chapter 6 Suboptimal Implementation of Ergodic Sum-Rate Maximizationp. 69
6.1 Backgroundp. 69
6.2 Suboptimal Approximation of the Continuous Rates Solutionp. 71
6.3 Suboptimal Approximation of the Discrete Rates Solutionp. 73
6.4 Complexity Analysis of the Suboptimal Algorithmsp. 76
6.4.1 Complexity Analysis in the Continuous Rates Casep. 76
6.4.2 Complexity Analysis in the Discrete Rates Casep. 77
6.5 Results and Discussionp. 78
6.5.1 Simulation Parametersp. 78
6.5.2 Results of the Continuous Rates Approximationp. 78
6.5.3 Results of the Discrete Rates Approximationp. 80
6.5.4 Results in the Case of Imperfect CSIp. 81
6.5.5 Comparison to Existing Algorithmsp. 84
6.6 Summaryp. 88
Chapter 7 Suboptimal Implementation with Proportional Fairnessp. 89
7.1 Backgroundp. 89
7.2 Proportional Fair Schedulingp. 91
7.2.1 PF Scheduling Methodsp. 91
7.2.2 Equivalence of PF and NBSp. 92
7.3 Low Complexity Utility Maximization Algorithmsp. 94
7.3.1 Complexity Analysis of the Utility Maximization Algorithmsp. 97
7.3.2 Comparison to Existing Algorithmsp. 98
7.3.3 Rate Calculationsp. 99
7.4 Proportional Fair Utilitiesp. 100
7.5 Results and Discussionp. 101
7.5.1 Simulation Modelp. 101
7.5.2 PFF and PFTF Utility Comparisonp. 101
7.5.3 RB-based Scheduling: Greedy and PFF Utilitiesp. 103
7.5.4 Comparison to Existing Algorithmsp. 107
7.5.5 Independent versus Equal Fading over the Subcarriers of an RBp. 111
7.6 Summaryp. 112
Chapter 8 Scheduling with Distributed Base Stationsp. 113
8.1 Backgroundp. 113
8.2 System Modelp. 115
8.3 Scheduling with Distributed Base Stationsp. 118
8.3.1 Scheduling Algorithm for DBS Scenariosp. 118
8.3.2 Complexity Analysis of the DBS Scheduling Algorithmp. 120
8.4 Results and Discussionp. 120
8.4.1 Simulation Modelp. 120
8.4.2 Sum-Rate Resultsp. 121
8.4.3 Fairness Analysisp. 123
8.4.4 Location Optimizationp. 126
8.4.5 Mobility Considerationsp. 127
8.5 Distributed Base Stations Versus Relaysp. 128
8.6 Distributed Base Stations Versus Femtocellsp. 131
8.7 Summaryp. 133
Chapter 9 Distributed Scheduung with User Cooperationp. 135
9.1 Backgroundp. 135
9.2 Cooperative Distributed Scheduling Schemep. 136
9.2.1 System Modelp. 136
9.2.2 CSI Quantization Schemep. 138
9.2.3 Price of Anarchyp. 139
9.3 Distributed Scheduling Algorithmp. 140
9.3.1 Rate Calculations with Quantized CSIp. 142
9.4 Results and Discussionp. 142
9.4.1 Simulation Modelp. 142
9.4.2 Greedy Scheduling Resultsp. 143
9.4.3 PF Scheduling Resultsp. 145
9.5 Summaryp. 149
Chapter 10 Distributed Scheduling without User Cooperationp. 151
10.1 Backgroundp. 151
10.2 Noncooperative Distributed Scheduling Schemep. 153
10.2.1 System Modelp. 153
10.2.2 Distributed Scheduling Schemep. 153
10.3 Comparison to Existing Schemesp. 155
10.4 Analysis of Measurement Inaccuraciesp. 156
10.5 Results and Discussionp. 160
10.5.1 Simulation Modelp. 160
10.5.2 Simulation Resultsp. 161
10.6 Optimization of Transmission Probabilitiesp. 165
10.6.1 Optimization Methodsp. 165
10.6.2 Optimization Resultsp. 166
10.7 Practical Considerationsp. 169
10.7.1 Collisionsp. 169
10.7.2 Collaboration Between Mobile Usersp. 169
10.7.3 Role of the Central Controlling Devicesp. 170
10.7.4 Extension to a Single Cell Scenariop. 170
10.7.5 Extension to a Multiple Cell Scenariop. 171
10.7.6 Cognitive Radio and 4Gp. 171
10.8 Summaryp. 171
Chapter 11 Centralized Multicell Scheduling with Interference Mitigationp. 173
11.1 Backgroundp. 173
11.2 Problem Formulationp. 175
11.3 Iterative Pricing-Based Power Control Solutionp. 178
11.3.1 Single Cell Problem Formulationp. 178
11.3.2 Single Cell Scheduling Solutionp. 179
11.3.3 Iterative Pricing Gamep. 182
11.4 Pricing Game with Centralized Controlp. 184
11.4.1 Online versus Offline Implementationp. 186
11.5 Suboptimal Scheduling Scheme Using Pricing-Based Power Controlp. 186
11.5.1 Utility Functionsp. 186
11.5.2 Setting the Prices in the Power Control Schemep. 189
11.5.3 Scheduling Algorithmp. 189
11.6 Suboptimal Scheduling Scheme Using Probabilistic Transmissionp. 190
11.7 Results and Discussionp. 191
11.7.1 Simulation Modelp. 191
11.7.2 Comparison of the Pricing-Based Power Control Schemesp. 191
11.7.3 Results of the Suboptimal Pricing-Based Power Control Schemesp. 196
11.7.4 Results of the Suboptimal Probabilistic Scheduling Schemep. 198
11.8 Summaryp. 201
Chapter 12 Distributed Multicell Scheduling with Interference Mitigationp. 203
12.1 Backgroundp. 203
12.2 System Modelp. 204
12.3 Intracell Cooperation: Distributed Schedulingp. 205
12.4 Intercell Interference Mitigation/Avoidancep. 206
12.4.1 Intercell Cooperation: Transparent Pricing Schemep. 207
12.4.2 Intercell Cooperation: Pricing-Based Power Control Schemep. 208
12.4.3 Interference Avoidance in the Absence of Intercell Cooperation: Probabilistic Transmission Schemep. 209
12.5 Results and Discussionp. 209
12.5.1 Simulation Modelp. 209
12.5.2 Greedy Allocation Resultsp. 210
12.5.3 Proportional Fair Allocation Resultsp. 213
12.5.4 Additional Commentsp. 216
12.6 Practical Aspectsp. 217
12.6.1 Application in a Local Area Networkp. 217
12.6.2 Application in a Distributed Base Station Scenariop. 217
12.6.3 Application in a CR Networkp. 219
12.6.4 Application in a Network with Femtocell Deploymentp. 219
12.6.5 Distributed Multicell Scheduling without User Cooperationp. 220
12.7 Summaryp. 221
Chapter 13 Scheduling in State-Of-The-Art OFDMA-Based Wireless Systemsp. 223
13.1 WiMAX Scheduling Overviewp. 223
13.1.1 Enhancements in the Next Generation of WiMAXp. 226
13.1.2 Intercell Interference Issues in WiMAXp. 227
13.1.3 Relation of the Work in this Book to WiMAX Schedulingp. 227
13.2 LTE Scheduling Overviewp. 228
13.2.1 Enhancements in the Next Generation of LTEp. 233
13.2.2 Intercell Interference Issues in LTEp. 233
13.2.3 Relation of the Work in this Book to LTE Schedulingp. 234
13.3 SCFDMA Versus OFDMA Schedulingp. 235
13.3.1 SCFDMA Rate Calculationsp. 236
13.3.2 Scheduling Algorithm with Contiguous RBsp. 236
13.3.3 Results and Discussionp. 237
13.4 Comparison to the LTE Power Control Schemep. 240
13.4.1 LTE Multicell Interference Mitigation Schemesp. 241
13.4.2 Results and Discussionp. 242
13.5 Summaryp. 245
Chapter 14 Future Research Directionsp. 247
14.1 Resource Allocation with Multiple Service Classesp. 247
14.2 Network MIMOp. 247
14.3 Coalitional Game Theoryp. 248
14.4 Resource Allocation with Femtocellsp. 249
14.5 Green Networks and Self-Organizing Networksp. 249
14.6 Joint Uplink/Downlink Resource Allocationp. 250
14.7 Joint Resource Allocation in Heterogeneous Networksp. 251
14.8 Resource Allocation in Cognitive Radio Networksp. 252
Bibliographyp. 255
Indexp. 269
Go to:Top of Page