Title Page
Abstract
Contents
Chapter 1. Introduction 16
1.1. Background of Cognitive Radio Technology 16
1.2. Motivations 18
1.3. Dissertation Organization 19
Chapter 2. Research Background of Cognitive Radio 20
2.1. Overview of Cognitive Radio Coexisting Technologies 20
2.2. Behavior Controlling Game Theory in Cognitive Radio Networks 22
2.3. Capacity Maximization Water Filling Modeling in Cognitive Radio Networks 25
2.4. The Limitations 30
2.4.1. The Limitations of Current Transmission Power Control Methods 30
2.4.2. The Limitations of Current Capacity Maximization Issues 31
2.5. The Contributions 33
Chapter 3. Interference Avoidance in Cognitive Radio Networks 35
3.1. Hidden Primary Node Illustration 35
3.2. Neighbor Coordinated Transmission Power Control Estimation 38
3.2.1. Design Features 39
3.2.2. Neighbor coordinated direct distance estimation 42
3.2.3. Neighbor coordinated ST localization (NCSTL) based estimation scheme 48
3.3. Collision Free Pulse Based Reporting Scheme 52
3.4. Performance Evaluation 55
3.4.1. Evaluation Environment 55
3.4.2. Simulation parameters 56
3.4.3. Performance evaluation 57
Chapter 4. Capacity Maximization Game in Cognitive Radio Networks 66
4.1. System Model and Motivation 66
4.2. Problem Statement 67
4.3. Proposed Secondary Transmission Game Stage Formulation 69
4.4. Proposed Primary Game Stage Formulation 71
4.5. Proposed SAPC Performance Optimization 75
4.6. Primary Price Model Analysis 77
4.7. Performance Evaluation 80
4.7.1. Methodology of Simulation 81
4.7.2. Simulation parameters 82
4.7.3. Simulation result 83
Chapter 5. Reliable Power-Filling in Cognitive Radio Networks for Capacity Maximization 89
5.1. System Model and Motivation 89
5.2. Power Required and PSM Constraint Formulation 91
5.2.1. Power requirement 91
5.2.2. PSM Constraint Formulation 92
5.3. Capacity Maximization Formulation 95
5.3.1. Distributed Channel Selection Strategy 95
5.3.2. Cooperative Channel Selection Strategy 106
5.3.3. Suboptimal Integer Bit Loading Algorithm 108
5.4. Performance Evaluation 111
5.4.1. Methodology of Simulation 111
5.4.2. Simulation Topology and Parameters 112
5.4.3. Simulation Results 115
Chapter 6. Conclusions 121
Appendix 125
Appendix A 125
Appendix B 126
Appendix C 127
Appendix D 128
Appendix E 129
References 130
Table 3.1. Glossary of New Terminologies 42
Table 3.2. Simulation Parameters for TPC Estimation 57
Table 4.1. Evaluation Parameters for Game play 83
Table 5.1. Simulation Parameters 114
Figure 1. 1. Functional scenario of Cognitive Radio technology. 17
Figure 2. 1. Original Water-Filling Concept Illustration. 26
Figure 2. 2. Water-Filling Concept with Cover Illustration. 27
Figure 2. 3. Power Loading with Limited Power Budget. 28
Figure 3. 1. Conventional Transmission Power Control Illustration. 37
Figure 3. 2. Hidden Primary Node Problem Illustration. 38
Figure 3. 3. Ad hoc Cognitive Radio Communication Scenario. 39
Figure 3. 4. Proposed HPNP Solution Scenario on a Licensed Band. 43
Figure 3. 5. TPC Related Safe Transmission Range Estimation Procedure. 44
Figure 3. 6. Distance Estimation Error in the NCDDE. 48
Figure 3. 7. ST Location Based Distance Estimation Procedure. 50
Figure 3. 8. Neighbor Coordinated Localization Scheme. 51
Figure 3. 9. Proposed Pulse Based Distance Reporting Scheme. 53
Figure 3. 10. Simulation Topology. 56
Figure 3. 11. Inf_R with Num_SN Variation. 58
Figure 3. 12. Inf_R with ST_Radius Variation. 60
Figure 3. 13. Dnbr_R with ST_Radius Variation. 60
Figure 3. 14. Dnbr_R with Coordinate_ST Variation. 61
Figure 3. 15. Err_D with Coordinate_ST variation. 62
Figure 3. 16. Err_D with Num_DS variation. 63
Figure 3. 17. Err_D_Inf & Err_D with Num_DS Variation. 64
Figure 3. 18. Transmission Power Control Reduction Ratio. 65
Figure 4. 1. Methodology of the Proposed Stackelberg Game. 81
Figure 4. 2. Utilization of SU with Purchasing Power Variation. 84
Figure 4. 3. Utilization of PU with Price Variation. 85
Figure 4. 4. Convergence with Price Iteration. 86
Figure 4. 5. Utilization Convergence. 87
Figure 4. 6. Performance of the SPTR& APR_R. 88
Figure 5. 1. Illustration of PSM Constraint with Distance Variation. 94
Figure 5. 2. Accumulated Interference Cancellation Illustration. 98
Figure 5. 3. Iterative Water-Filling Level Searching (Algorithm 5.1). 105
Figure 5. 4. Example Power Loading Scenario Illustration 106
Figure 5. 5. IAORS Algorithm (Algorithm 5.2). 108
Figure 5. 6. Sub Optimal Bit Loading Algorithm. 110
Figure 5. 7. Methodology of the Proposed WFA 112
Figure 5. 8. Simulation topology on licensed/CR control band. 113
Figure 5. 9. Power filling illustration. 116
Figure 5. 10. Bit Loading Illustration. 117
Figure 5. 11. Rate performance with P_budget Variation. 118
Figure 5. 12. Amount of WF with Coordinate_ST & Num_SN Variation. 119